DocumentCode :
3022348
Title :
An Antisocial Strategy for Scheduling Mechanisms
Author :
Garg, Nandan ; Grosu, Daniel ; Chaudhary, Vipin
Author_Institution :
Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA
fYear :
2005
fDate :
04-08 April 2005
Abstract :
Previous work on task scheduling mechanisms assumed that the agent´s goal is to maximize its own profit without considering the effect of its strategy on the other agents´ profit. This is not always the case, an agent may want to cause loses to the other agents besides maximizing its profit. Such an agent is said to be an antisocial agent. An antisocial agent will try to gain as much profit as possible relative to the other agents. In this paper we consider a mechanism for task scheduling on related machines in which each machine is associated with an agent. We develop an antisocial strategy which can be used by an antisocial agent to inflict losses to the other participating agents. We analyze the effect of different degrees of agent´s antisociality on the losses inflicted to the other agents.
Keywords :
parallel machines; resource allocation; scheduling; antisocial agent; task scheduling; Computer science; Cost accounting; Degradation; Distributed computing; Grid computing; Processor scheduling; Protocols; Resource management; Routing; Shortest path problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International
Print_ISBN :
0-7695-2312-9
Type :
conf
DOI :
10.1109/IPDPS.2005.86
Filename :
1420101
Link To Document :
بازگشت