Smart Caching Algorithm for Software Agents Based on Re-execution Probability.

Autor: Carbonell, Jaime G., Siekmann, Jörg, Mařík, Vladimír, Vyatkin, Valeriy, Colombo, Armando W., Rykowski, Jarogniew
Zdroj: Holonic & Multi-Agent Systems for Manufacturing (9783540744788); 2007, p173-184, 12p
Abstrakt: In this paper we propose a new, smart strategy for efficient caching of user-defined software agents. The strategy is based on setting up minimum and maximum caching time for individual agents. These timings are formed on the basis of a way of calling an agent (type of input/output gateway serving a call, previous calls to the same agent, etc.), on the one hand, and past/current/ predicted system load, including waiting calls to be served in the near future for the same and other agents, on the other hand. As proven by the tests in real applications, the strategy is efficient, especially in the case of a mass-scale system with thousands and even millions of agents owned (and possibly programmed) by different users. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index