Computing MAS Dynamics Considering the Background Load
The paper extends the formal model of a computing Multi Agent System introduced in our previous papers to the case in which the background load coming from operating systems activities as well as other applications is included. Results concerning the existence of the optimal scheduling strategy as well as the characterization of such strategies have been obtained. The theorems partially verify scheduling heuristics (diffusion rules) designed and tested for large scale CAE computations.
KeywordsMulti Agent System Schedule Strategy Virtual Node Agent Migration Computing Agent
- 1.Luque, E., Ripoll, A., Cortés, A., Margalef, T.: A distributed diffusion method for dynamic load balancing on parallel computers. In: Proceedings of EUROMICRO Workshop on Parallel and Distributed Processing, San Remo, Italy, pp. 43–50. IEEE Computer Society Press, Los Alamitos (1995)CrossRefGoogle Scholar
- 3.Grochowski, M., Smołka, M., Schaefer, R.: Architectural principles and scheduling strategies for computing agent systems. Fundamenta Informaticae (2006) (accepted)Google Scholar
- 4.Smołka, M.: Optimal scheduling problem for computing agent systems. Inteligencia Artificial (2006) (accepted)Google Scholar
- 8.Kushner, H.: Introduction to Stochastic Control. Holt, Rinehart and Winston (1971)Google Scholar