Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems

Authors:
Thomas E. Carroll;Daniel Grosu
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2008

Citing 0
Cited 5

PPDD: scheduling multi-site divisible loads in single-level tree networks

Cluster Computing
Distributed algorithmic mechanism design for scheduling on unrelated machines

Journal of Parallel and Distributed Computing
An incentive-based distributed mechanism for scheduling divisible loads in tree networks

Journal of Parallel and Distributed Computing
From immediate agreement to eventual agreement: early stopping agreement protocol for dynamic networks with malicious faulty processors

The Journal of Supercomputing
Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world this assumption is unrealistic as the processors are owned and operated by autonomous, rational organizations that have no \\textit{a priori} motivation for cooperation. Consequently, they will manipulate the algorithms if it benefits them to do so. In this work we propose strategyproof mechanisms for scheduling divisible loads on three types of bus connected distributed systems. These mechanisms provide incentives to the processors to obey the prescribed algorithms and to truthfully report their parameters, leading to an efficient load allocation and execution.