DocumentCode
1926743
Title
Complete Decentralized Mechanism Design for Online Machine Scheduling
Author
Zhang, Yuan ; Chi, Chi-Hung ; Zhang, Shengqing ; Zheng, Nan
Author_Institution
Sch. of Software, Tsinghua Univ., Beijing
fYear
2009
fDate
25-27 May 2009
Firstpage
530
Lastpage
535
Abstract
We study an online version of the classical parallel scheduling problem to minimize the total weighted completion time in a total decentralized setting: both the jobs and the machines are selfish entities who try to maximize their own interest. We study the setting from an algorithmic mechanism design and present a polynomial time decentralized scheduling mechanism that induces the rational jobs and machines to report truthfully about their private information, and lures the jobs to choose proper machines such that the resulting schedule is 3.281-competitive.
Keywords
computational complexity; job shop scheduling; decentralized scheduling mechanism; job scheduling mechanism; online parallel machine scheduling; polynomial time; Cloud computing; Distributed computing; Embedded software; Environmental economics; Grid computing; Job design; Parallel machines; Polynomials; Processor scheduling; Scheduling algorithm; Job Scheduling; Online scheduling; Parallel System; decentralized system;
fLanguage
English
Publisher
ieee
Conference_Titel
Embedded Software and Systems, 2009. ICESS '09. International Conference on
Conference_Location
Zhejiang
Print_ISBN
978-1-4244-4359-8
Type
conf
DOI
10.1109/ICESS.2009.92
Filename
5066694
Link To Document