The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
En tant que technologie permettant de récupérer des contenus souhaités sur des réseaux à grande échelle, les systèmes multi-agents font l'objet d'une grande attention. Comme il y a trop de contenus sur le réseau pour les rechercher tous de manière exhaustive, certaines applications sur les systèmes multi-agents ont des contraintes de temps, c'est-à-dire qu'elles doivent obtenir un résultat dans un délai donné. Pour obtenir de meilleurs résultats pour de telles applications, il est important que les agents terminent leurs tâches sur autant de nœuds que possible avant la date limite. Cependant, la plupart des systèmes d'agents existants utilisant des disciplines de planification à tour de rôle ne prennent pas en compte les contraintes de temps. Par conséquent, les agents risquent de ne pas respecter leurs délais sur de nombreux nœuds. Dans cet article, nous proposons une méthode efficace de répartition des agents pour les applications limitées dans le temps. Cette méthode décide de la création et de la migration d'un agent clone en fonction de la valeur estimée du nombre d'agents qui auraient terminé leurs tâches à la date limite. Les résultats de notre évaluation des performances montrent que la méthode proposée augmente le nombre d'agents qui accomplissent leurs tâches.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Tran Nguyen TRUNG, Hideo KAMADA, Kazuhiko KINOSHITA, Nariyoshi YAMAI, Tetsuya TAKINE, Koso MURAKAMI, "An Efficient Agent Control Method for Time-Constrained Applications" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2972-2979, September 2008, doi: 10.1093/ietcom/e91-b.9.2972.
Abstract: As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2972/_p
Copier
@ARTICLE{e91-b_9_2972,
author={Tran Nguyen TRUNG, Hideo KAMADA, Kazuhiko KINOSHITA, Nariyoshi YAMAI, Tetsuya TAKINE, Koso MURAKAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={An Efficient Agent Control Method for Time-Constrained Applications},
year={2008},
volume={E91-B},
number={9},
pages={2972-2979},
abstract={As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2972},
ISSN={1745-1345},
month={September},}
Copier
TY - JOUR
TI - An Efficient Agent Control Method for Time-Constrained Applications
T2 - IEICE TRANSACTIONS on Communications
SP - 2972
EP - 2979
AU - Tran Nguyen TRUNG
AU - Hideo KAMADA
AU - Kazuhiko KINOSHITA
AU - Nariyoshi YAMAI
AU - Tetsuya TAKINE
AU - Koso MURAKAMI
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2972
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.
ER -