IEICE TRANSACTIONS on Fundamentals
A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.6 pp.1573-1582
- Publication Date
- 2005/06/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.6.1573
- Type of Manuscript
- PAPER
- Category
- Algorithms and Data Structures
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Atsushi SASAKI, "A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 6, pp. 1573-1582, June 2005, doi: 10.1093/ietfec/e88-a.6.1573.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.6.1573/_p
Copy
@ARTICLE{e88-a_6_1573,
author={Atsushi SASAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring},
year={2005},
volume={E88-A},
number={6},
pages={1573-1582},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.6.1573},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Distributed Task Assignment Algorithm with the FCFS Policy in a Logical Ring
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1573
EP - 1582
AU - Atsushi SASAKI
PY - 2005
DO - 10.1093/ietfec/e88-a.6.1573
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2005
AB - 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.
ER -
English
