The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2008 vol.19)
pp: 1124-1135
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.
INDEX TERMS
divisible load scheduling, mechanism design
CITATION
Thomas E. Carroll, Daniel Grosu, "Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 8, pp. 1124-1135, August 2008, doi:10.1109/TPDS.2007.70818
REFERENCES
[1] A. Archer and E. Tardos, “Truthful Mechanism for One-Parameter Agents,” Proc. 42nd IEEE Symp. Foundations of Computer Science (FOCS '01), pp. 482-491, Oct. 2001.
[2] A. Archer and E. Tardos, “Frugal Path Mechanisms,” Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '02), pp. 991-999, Jan. 2002.
[3] O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, “Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 3, pp. 207-218, Mar. 2005.
[4] O. Beaumont, L. Marchal, and Y. Robert, “Scheduling Divisible Loads with Return Messages on Heterogeneous Master-Worker Platforms,” Proc. 12th Int'l Conf. High Performance Computing (HiPC '05), pp. 123-132, 2005.
[5] O. Beaumount, L. Marchal, V. Rehn, and Y. Robert, “FIFO Scheduling of Divisible Loads with Return Messages under the One-Port Model,” Proc. 20th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '06), Apr. 2006.
[6] V. Bharadwaj and G. Barlas, “Access Time Minimization for Distributed Multimedia Applications,” Multimedia Tools and Applications, vol. 12, no. 2-3, pp. 235-256, Nov. 2000.
[7] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE CS Press, 1996.
[8] V. Bharadwaj, D. Ghose, and T.G. Robertazzi, “Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems,” Cluster Computing, vol. 6, no. 1, pp. 7-17, Jan. 2003.
[9] J. Blazewicz, M. Drozdowski, and M. Markiewicz, “Divisible Task Scheduling—Concept and Verification,” Parallel Computing, vol. 25, no. 1, pp. 87-98, Jan. 1999.
[10] T.E. Carroll and D. Grosu, “A Strategyproof Mechanism for Scheduling Divisible Loads in Bus Networks without Control Processors,” Proc. IEEE IPDPS Eighth Workshop Advances in Parallel and Distributed Computational Models (APDCM '06), Apr. 2006.
[11] S. Chan, V. Bharadwaj, and D. Ghose, “Large Matrix-Vector Products on Distributed Bus Networks with Communication Delays Using the Divisible Load Paradigm: Performance and Simulation,” Math. and Computers in Simulation, vol. 58, pp. 71-92, 2001.
[12] E. Clarke, “Multipart Pricing of Public Goods,” Public Choice, vol. 8, pp. 17-33, 1971.
[13] J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, “A BGP-Based Mechanism for Lowest-Cost Routing,” Proc. 21st ACM Symp. Principles of Distributed Computing (PODC '02), pp. 173-182, July 2002.
[14] J. Feigenbaum, C.H. Papadimitriou, and S. Shenker, “Sharing the Cost of Multicast Transmissions,” J. Computer and System Sciences, vol. 63, no. 1, pp. 21-41, Aug. 2001.
[15] J. Feigenbaum and S. Shenker, “Distributed Algorithmic Mechanism Design: Recent Results and Future Directions,” Proc. Sixth ACM Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIAL-M '02), pp. 1-13, Sept. 2002.
[16] D. Ghose, H.J. Kim, and T.H. Kim, “Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 10, pp. 897-907, Oct. 2005.
[17] D. Grosu and T.E. Carroll, “A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems,” Proc. Fourth Int'l Symp. Parallel and Distributed Computing (ISPDC '05), pp. 83-90, July 2005.
[18] D. Grosu and A.T. Chronopoulos, “Algorithmic Mechanism Design for Load Balancing in Distributed Systems,” IEEE Trans. Systems, Man and Cybernetics—Part B: Cybernetics, vol. 34, no. 1, pp.77-84, Feb. 2004.
[19] T. Groves, “Incentive in Teams,” Econometrica, vol. 41, no. 4, pp.617-631, 1973.
[20] L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, July 1982.
[21] X. Li, V. Bharadwaj, and C. Ko, “Distributed Image Processing on a Network of Workstations,” Int'l J. Computers and Their Applications, vol. 25, no. 2, pp. 1-10, 2003.
[22] J.C. Mitchell and V. Teague, “Autonomous Nodes and Distributed Mechanisms,” Proc. Mext-NSF-JSPS Int'l Symp. Software Security—Theories and Systems (ISSS '03), pp. 58-83, Nov. 2003.
[23] C. Ng, D. Parkes, and M. Seltzer, “Strategyproof Computing: Systems Infrastructures for Self-Interested Parties,” Proc. First Workshop Economics of Peer-to-Peer Systems, June 2003.
[24] C. Ng, D. Parkes, and M. Seltzer, “Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation,” Proc. Fourth ACM Conf. Electronic Commerce (EC '03), pp. 238-239, June 2003.
[25] N. Nisan, S. London, O. Regev, and N. Camiel, “Globally Distributed Computation over Internet—The POPCORN Project,” Proc. 18th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '98), pp. 592-601, May 1998.
[26] N. Nisan and A. Ronen, “Algorithmic Mechanism Design,” Games and Economic Behavior, vol. 35, nos. 1-2, pp. 166-196, Apr. 2001.
[27] M. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
[28] M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in the Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228-234, Apr. 1980.
[29] T.G. Robertazzi, “Ten Reasons to Use Divisible Load Theory,” Computer, vol. 36, no. 5, pp. 63-68, May 2003.
[30] W. Vickrey, “Counterspeculation, Auctions, and Competitive Sealed Tenders,” J. Finance, vol. 16, no. 1, pp. 8-37, Mar. 1961.
[31] W.E. Walsh, M.P. Wellman, P.R. Wurman, and J.K. MacKie-Mason, “Some Economics of Market-Based Distributed Scheduling,” Proc. 18th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '98), pp.612-621, May 1998.
[32] R. Wolski, J.S. Plank, T. Bryan, and J. Brevik, “G-Commerce: Market Formulations Controlling Resource Allocation on the Computational Grid,” Proc. 15th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '01), Apr. 2001.
[33] Y. Yang, K. van der Raadt, and H. Casanova, “Multiround Algorithms for Scheduling Divisible Loads,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 11, pp. 1092-1102, Nov. 2005.
[34] D. Yu and T.G. Robertazzi, “Divisible Load Scheduling for Grid Computing,” Proc. 15th Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '03), Nov. 2003.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool