Divisible task scheduling — concept and verification
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Using high-speed WANs and network data caches to enable remote and distributed visualization
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Mathematics and Computers in Simulation
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
Proceedings of the 4th ACM conference on Electronic commerce
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
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
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
Autonomous nodes and distributed mechanisms
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Algorithmic mechanism design for load balancing in distributed systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
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
| Hi-index | 0.00 |
The underlying assumption of Divisible Load Scheduling is that the processors composing the network are obedient, i.e., they do not "cheat" the 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 propose the strategyproof mechanism DLS-TL for scheduling divisible loads in tree networks. Our proposal augments Divisible Load Theory (DLT) with incentives such that it is beneficial for processors to report their true processing capacity and compute their assignments at full processing capacity. Additionally, incentives are provided for processors to report algorithm deviants. Deviants are penalized which abates the processors' willingness to deviate.