An incentive-based distributed mechanism for scheduling divisible loads in tree networks

Authors:
T. E. Carroll;D. Grosu
Affiliations:
Pacific Northwest National Laboratory, P.O Box 999 MSIN J4-45, 902 Battelle Boulevard, Richland, WA 99352, USA;Department of Computer Science, Wayne State University, 5057 Woodward Avenue, Detroit, MI 48202, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2012

Citing 28
Cited 0

Divisible task scheduling — concept and verification

Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Large matrix-vector products on distributed bus networks with communication delays using the divisable load paradigm: performance analysis and simulaton

Mathematics and Computers in Simulation
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Sharing the cost of multicast transmissions

Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Access Time Minimization for Distributed Multimedia Applications

Multimedia Tools and Applications
G-commerce: Market Formulations Controlling Resource Allocation on the Computational Grid

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Ten Reasons to Use Divisible Load Theory

Computer
Some Economics of Market-Based Distributed Scheduling

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Globally Distributed Computation over the Internet - The POPCORN Project

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Truthful Mechanisms for One-Parameter Agents

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Specification faithfulness in networks with rational nodes

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems

IEEE Transactions on Parallel and Distributed Systems
Optimized Distributed Delivery of Continuous-Media Documents over Unreliable Communication Links

IEEE Transactions on Parallel and Distributed Systems
Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources

IEEE Transactions on Parallel and Distributed Systems
Multiround Algorithms for Scheduling Divisible Loads

IEEE Transactions on Parallel and Distributed Systems
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems

ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
A sufficient condition for truthfulness with single parameter agents

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Distributed scheduling strategy for divisible loads on arbitrarily configured distributed networks using load balancing via virtual routing

Journal of Parallel and Distributed Computing
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment

IEEE Transactions on Parallel and Distributed Systems
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Autonomous nodes and distributed mechanisms

ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A strategyproof mechanism for scheduling divisible loads in tree networks

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
FIFO scheduling of divisible loads with return messages under the one-port model

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The underlying assumption of Divisible Load Scheduling (DLS) theory is that the processors composing the network are obedient, i.e., they do not ''cheat'' the scheduling algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is beneficial to do so. In this paper, we address this issue by designing a distributed mechanism for scheduling divisible loads in tree networks, called DLS-T, which provides incentives to processors for reporting their true processing capacity and executing their assigned load at full processing capacity. We prove that the DLS-T mechanism computes the optimal allocation in an ex post Nash equilibrium. Finally, we simulate and study the mechanism under various network structures and processor parameters.