Presentation	2003/4/10 Global Task Assignments for Task Fairness Atsushi SASAKI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper proposes two global task assignments for load balancing and task fairness, and then evaluates them by computer simulation. These assignments target large tasks. One uses a distributed sorting algorithm such that a larger task is assigned to a server with a lower load, the other works on a logical ring and performs in such a way that all unassigned tasks flow around the ring and a free server accepts a new task with the highest priority from the unassigned tasks that it receives. As a result, these task assignments perform better than conventional task assignments or load balancing with respect to both the mean response time and the task fairness, especially for large networks. Moreover, these task assignments do not require much memory space even if the network becomes very large thus making them suitable for execution in a large network.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Task assignment / Load balancing / Mean response time / Task fairness
Paper #	NS2003-6
Date of Issue

Conference Information
Committee	NS
Conference Date	2003/4/10(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Network Systems(NS)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Global Task Assignments for Task Fairness
Sub Title (in English)
Keyword(1)	Task assignment
Keyword(2)	Load balancing
Keyword(3)	Mean response time
Keyword(4)	Task fairness
1st Author's Name	Atsushi SASAKI
1st Author's Affiliation	NTT Communication Science Laboratories, NTT Corporation()
Date	2003/4/10
Paper #	NS2003-6
Volume (vol)	vol.103
Number (no)	9
Page	pp.pp.-
#Pages	4
Date of Issue