A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring(Algorithms and Data Structures)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a distributed task assignment algorithm in a logical unidirectional ring, which guarantees that almost all tasks are assigned to servers with the first come first served (FCFS) policy without a global clock. A task assignment for a process is obtained in the time period needed for a message to circle the ring. This time period is almost optimal for a unidirectional ring. The FCFS policy is very important in terms of task fairness and can also avoid starvation and provide an efficient response time. Simulation results show that the algorithm generally works better than conventional task assignment or load balancing schemes with respect to both mean response time and task fairness.

• 一般社団法人電子情報通信学会の論文
• 2005-06-01

著者

• Sasaki Atsushi

  Ntt Communication Science Laboratories Ntt Corporation

• Sasaki Atsushi

  Ntt Communication Science Laboratories Ntt Corporation:(present Address)ntt Service Integration Labo

関連論文

• Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
• A Time- and Communication-Optimal Distributed Sorting Algorithm in a Line Network and Its Extension to the Dynamic Sorting Problem(Algorithms and Data Structures)
• A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring(Algorithms and Data Structures)
• A Time-Optimal Distributed Arrangement Selection Algorithm in a Line Network (Special Issue on Selected Papers from LA Symposium)

スポンサーリンク