By Topic

Selfish Multi-User Task Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Carroll, T.E. ; Dept. of Comput. Sci., Wayne State Univ., Detroit, MI ; Grosu, D.

In this paper we formulate and study a new scheduling problem called selfish multi-user task scheduling. This problem assumes that there are several users, each of them having multiple tasks that need processing on a set of parallel identical machines. Each user is selfish and her goal is to minimize the makespan of her own tasks. We model this problem as a non-cooperative, extensive-form game. We use the subgame perfect equilibrium solution concept to analyze the game which provides insight into the problem's properties. We compute the price of anarchy to quantify the costs due to lack of coordination among the users

Published in:

Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on

Date of Conference:

6-9 July 2006