The performance of bags-of-tasks in large-scale distributed systems
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Mathematics of Operations Research
Graph Theory, Computational Intelligence and Thought
A strategyproof mechanism for scheduling divisible loads in tree networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Centralized versus distributed schedulers for multiple bag-of-task applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A strategyproof mechanism for scheduling divisible loads in bus networks without control processors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling problem and was studied extensively in recent years resulting in a cohesive theory called Divisible Load Theory (DLT). In this paper we augment the existing divisible load theory with incentives. We develop a strategyproof mechanism for scheduling divisible loads in distributed systems assuming a bus type interconnection and a linear cost model for the processors. The mechanism provides incentives to processors such that it is beneficial for them to report their true processing power and process the assigned load using their full processing capacity. We define the strategyproof mechanism and prove its properties. We simulate and study the implementation of the mechanism on systems characterized by different parameters.