research-article

A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems

Authors:

Sajal K. DasAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 18, Issue 3

Pages 289 - 306

https://doi.org/10.1109/TPDS.2007.34

Published: 01 March 2007 Publication History

Abstract

Today's distributed computing systems incorporate different types of nodes with varied bandwidth constraints which should be considered while designing cost-optimal job allocation schemes for better system performance. In this paper, we propose a fair pricing strategy for job allocation in bandwidth-constrained distributed systems. The strategy formulates an incomplete information, alternating-offers bargaining game on two variables, such as price per unit resource and percentage of bandwidth allocated, for both single and multiclass jobs at each node. We present a cost-optimal job allocation scheme for single-class jobs that involve communication delay and, hence, the link bandwidth. For fast and adaptive allocation of multiclass jobs, we describe three efficient heuristics and compare them under different network scenarios. The results show that the proposed algorithms are comparable to existing job allocation schemes in terms of the expected system response time over all jobs.

References

[1]

R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, “Economic Models for Resource Management and Scheduling in Grid Computing,” The J. Concurrency and Computation: Practice and Experience (CCPE), special issue on grid computing environments, vol. 14, nos. 13-15, pp. 1507-1542, Nov.-Dec. 2002.

[2]

R. Buyya, “Economic-Based Distributed Resource Management and Scheduling for Grid Computing,” PhD thesis, Monash Univ., Australia, Apr. 2002, http://www.buyya.com/thesis/thesis.pdf.

[3]

K. Chatterjee and L. Samuelson, “Bargaining with Two-Sided Incomplete Information: An Infinite Horizon Model with Alternating Offers,” Rev. of Economic Studies, vol. 54, pp. 175-192, 1987.

[4]

J. Copic and C. Ponsati, “Implementation by Decent Mechanisms,” unpublished research, http://www.iae.csic.es/ponsati/publicCP.html, 2005.

[5]

D. Grosu, A.T. Chronopoulos, and M.Y. Leung, “Load Balancing in Distributed Systems: An Approach Using Cooperative Games,” Proc. 16th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '02), pp. 501-510, 2002.

Digital Library

[6]

K. Larson and T. Sandhlom, “An Alternating Offers Bargaining Model for Computationally Limited Agents,” Proc. First Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '02), pp.135-142, 2002.

Digital Library

[7]

C. Mudgal and J. Vassileva, “Bilateral Negotiation with Incomplete and Uncertain Information: A Decision-Theoretic Approach Using a Model of the Opponent,” Proc. Cooperative Information Agents (CIA '00), pp. 107-118, 2000.

Digital Library

[8]

M.J. Osborne and A. Rubinstein, Bargaining and Markets. Academic Press, Inc., 1990.

[9]

G. Owen, Game Theory, second ed. Academic Press, 1982.

[10]

SETI@home Homepage, [email protected]/, 2005.

[11]

M. Stonebraker, R. Devine, M. Kornacker, W. Litwin, A. Pfeffer, A. Sah, and C. Staelin, “An Economic Paradigm for Query Processing and Data Migration in Mariposa,” Proc. Third Int'l Conf. Parallel and Distributed Information Systems, pp. 58-67, 1994.

Digital Library

[12]

A.N. Tantawi and D. Towsley, “Optimal Static Load Balancing in Distributed Computer Systems,” J. ACM, vol. 32, no. 2, pp. 445-465, Apr. 1985.

Digital Library

[13]

C. Waldspurger, T. Hogg, B. Huberman, J. Kephart, and W. Stornetta, “Spawn: A Distributed Computational Economy,” IEEE Trans. Software Eng., vol. 18, no. 2, pp. 103-117, Feb. 1992.

Digital Library

[14]

P. Winoto, G. McCalla, and J. Vassileva, “An Extended Alternating-Offers Bargaining Protocol for Automated Negotiation in Multi-Agent Systems,” Proc. 10th Int'l Conf. Cooperative Information Systems (CoopIS '02), pp. 179-194, Nov. 2002.

Digital Library

[15]

R.K. Jain, D.M. Chiu, and W.R. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer System,” Technical Report DEC-TR-301, Digital Equipment Corp., Eastern Research Lab, 1984.

[16]

P. Ghosh, N. Roy, K. Basu, and S.K. Das, “A Game Theory Based Pricing Strategy for Job Allocation in Mobile Grids,” Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), p.82a, 2004.

[17]

X. Tang and S.T. Chanson, “Optimizing Static Job Scheduling in a Network of Heterogeneous Computers,” Proc. Int'l Conf. Parallel Processing, pp. 373-382, Aug. 2000.

Digital Library

[18]

S.K. Bose, An Introduction to Queueing Systems. Kluwer Academic/Plenum Publishers, p. 312, 2002.

[19]

L. Fratta, M. Gerla, and L. Kleinrock, “The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design,” Networks, vol. 3, pp. 97-133, 1973.

[20]

K.W. Ross and D.D. Yao, “Optimal Load Balancing and Scheduling in a Distributed Computer System,” J. ACM, vol. 38, no. 3, pp.676-690, July 1991.

Digital Library

[21]

C. Kim and H. Kameda, “Optimal Static Load Balancing of Multi-Class Jobs in a Distributed Computer System,” Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 562-569, May 1990.

[22]

J. Li and H. Kameda, “Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems,” IEEE Trans. Computers, vol. 47, no. 3, pp. 322-332, Mar. 1998.

Digital Library

[23]

L.M. Ni and K. Hwang, “Adaptive Load Balancing in a Multiple Processor System with Many Job Classes,” IEEE Trans. Software Eng., vol. 11, no. 5, pp. 491-496, May 1985.

Digital Library

[24]

H. Kameda, J. Li, C. Kim, and Y. Zhang, Optimal Load Balancing in Distributed Computer Systems (Telecommunication Networks and Computer Systems). Springer Verlag, 1997.

Digital Library

[25]

T. Roughgarden, “Stackelberg Scheduling Strategies,” Proc. 33rd Ann. ACM Symp. Theory of Computing, pp. 104-113, July 2001.

Digital Library

[26]

D. Grosu and A.T. Chronopoulos, “Noncooperative Load Balancing in Distributed Systems,” J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 1022-1034, Sept. 2005.

Digital Library

[27]

P. Ghosh, K. Basu, and S.K. Das, “Cost-Optimal Job Allocation Schemes for Band-Width-Constrained Distributed Computing Systems,” Proc. 12th Ann. IEEE Int'l Conf. High Performance Computing (HiPC), pp. 40-50, Dec. 2005.

Digital Library

[28]

P. Ghosh, N. Roy, S.K. Das, and K. Basu, “A Pricing Strategy for Job Allocation in Mobile Grids Using a Non-Cooperative Bargaining Theory Framework,” J.Parallel and Distributed Computing, special issue on design and performance of networks for super-computing, cluster-computing, and grid-computing, vol.65, pp. 1366-1383, 2005.

Digital Library

[29]

A. Czumaj, P. Krysta, and B. Vöcking, “Selfish Traffic Allocation for Server Farms,” Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 287-296, 2002.

Digital Library

[30]

Y.-K. Kwok, S.S. Song, and K. Hwang, “Selfish Grid Computing: Game-Theoretic Modeling and NAS Performance Results,” Proc. Int'l Symp. Cluster Computing and the Grid (CCGrid '05), May 2005.

Digital Library

[31]

H. Lee, “Optimal Static Distribution of Prioritized Customers to Heterogeneous Parallel Servers,” Computers and Operations Research, vol. 22, no. 10, pp. 995-1003, Dec. 1995.

Digital Library

[32]

C. Kim and H. Kameda, “An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems,” IEEE Trans. Computers, vol. 41, no. 3, pp. 381-384, Mar. 1992.

Digital Library

Cited By

Shyam GManvi SPrasad B(2018)Concurrent and cooperative negotiation of resources in cloud computingMultiagent and Grid Systems10.3233/MGS-18028714:2(177-202)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/MGS-180287
Birje MManvi SDas S(2014)Reliable resources brokering scheme in wireless grids based on non-cooperative bargaining gameJournal of Network and Computer Applications10.5555/3170014.317016139:C(266-279)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.5555/3170014.3170161
Kumar NAgarwal SZaidi TSaxena V(2014)A Distributed Load-balancing Scheme Based on a Complex Network Model of Cloud ServersACM SIGSOFT Software Engineering Notes10.1145/2674632.267463939:6(1-6)Online publication date: 9-Dec-2014
https://dl.acm.org/doi/10.1145/2674632.2674639
Show More Cited By

Index Terms

A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems

Recommendations

Cost-Optimal job allocation schemes for bandwidth-constrained distributed computing systems
HiPC'05: Proceedings of the 12th international conference on High Performance Computing

This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in the design of cost-optimal job allocation schemes. In this paper, we present a ...
Game theory based job allocation/load balancing in distributed systems with applications to grid computing
Pricing strategy of ecological industry chain based on game theory

The pricing decision of three stages ecological industry chain of which is consisted of manufacturer producing mainproduct and byproduct, mainproduct seller and byproduct buyer is studied. Four kinds of pricing decision were discussed: manufacturer ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 18, Issue 3

March 2007

143 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © 2007.

Publisher

IEEE Press

Publication History

Published: 01 March 2007

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Shyam GManvi SPrasad B(2018)Concurrent and cooperative negotiation of resources in cloud computingMultiagent and Grid Systems10.3233/MGS-18028714:2(177-202)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.3233/MGS-180287
Birje MManvi SDas S(2014)Reliable resources brokering scheme in wireless grids based on non-cooperative bargaining gameJournal of Network and Computer Applications10.5555/3170014.317016139:C(266-279)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.5555/3170014.3170161
Kumar NAgarwal SZaidi TSaxena V(2014)A Distributed Load-balancing Scheme Based on a Complex Network Model of Cloud ServersACM SIGSOFT Software Engineering Notes10.1145/2674632.267463939:6(1-6)Online publication date: 9-Dec-2014
https://dl.acm.org/doi/10.1145/2674632.2674639
Duan RProdan RLi X(2014)A sequential cooperative game theoretic approach to scheduling multiple large-scale applications in gridsFuture Generation Computer Systems10.1016/j.future.2013.09.00130:C(27-43)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1016/j.future.2013.09.001
Skowron PRzadca KBlelloch GVöcking B(2013)Non-monetary fair schedulingProceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures10.1145/2486159.2486169(288-297)Online publication date: 23-Jul-2013
https://dl.acm.org/doi/10.1145/2486159.2486169
Duan RProdan RLi X(2012)A Sequential Cooperative Game Theoretic Approach to Storage-Aware Scheduling of Multiple Large-Scale Workflow Applications in GridsProceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing10.1109/Grid.2012.14(31-39)Online publication date: 20-Sep-2012
https://dl.acm.org/doi/10.1109/Grid.2012.14
Penmatsa SChronopoulos A(2011)Game-theoretic static load balancing for distributed systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.11.01671:4(537-555)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1016/j.jpdc.2010.11.016

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents