Efficient grid task-bundle allocation using bargaining based self-adaptive auction

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGRID 2009

Volumn , Issue , 2009, Pages 4-11

  Zhao, Han ^a   Li, Xiaolin ^a  

^a Oklahoma State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION ALGORITHM; ANALYTICAL PROPERTIES; BIDDING STRATEGY; COMPLEXITY ISSUES; COMPUTING NODES; DISTRIBUTED ENVIRONMENTS; EQUILIBRIUM POINT; EXTENSIVE SIMULATIONS; MARKET EQUILIBRIA; PARETO-OPTIMAL; REVENUE MAXIMIZATION; SELF-ADAPTIVE; SELFISH NODE; TASK ALLOCATION;

CLUSTER COMPUTING; COMMERCE; COMPUTER SCIENCE;

GRID COMPUTING;

EID: 70349729826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2009.86     Document Type: Conference Paper

References (25)

1. R. Buyya, J. Giddy, and H. Stockinger, "Economic models for resource management and scheduling," in The Journal of Concurrency and Computation: Practice and Experience (CCPE). Wiley Press, 2002, pp. 1507-1542.
2. Foster and Iamnitchi, "On death, taxes, and the convergence of peer-topeer and grid computing," in International Workshop on Peer-to-Peer Systems (IPTPS), LNCS, vol. 2, 2003.
3. A. Iosup, O. Sonmez, S. Anoep, and D. Epema, "The performance of bags-of-tasks in large-scale distributed systems," in HPDC '08: Proceedings of the 17th international symposium on High performance distributed computing, 2008, pp. 97-108.
4. Blumrosen and Nisan, "Combinatorial auctions," in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Eds. Cambridge University Press, 2007.
5. P. Cramton, Y. Shoham, and R. Steinberg, Combinatorial Auctions. MIT Press, 2006.
6. A. Akella, S. Seshan, R. M. Karp, S. Shenker, and C. H. Papadimitriou, "Selfish behavior and stability of the internet: a game-theoretic analysis of TCP," in SIGCOMM, 2002, pp. 117-130.
7. Z. Han and K. J. R. Liu, "Noncooperative power-control game and throughput game over wireless networks," IEEE Transactions on Communications, vol. 53, no. 10, pp. 1625-1629, 2005.
8. D. Ferguson, Y. Yemini, and C. Nikolaou, "Microeconomic algorithms for load balancing in distributed computer systems," in 8th International Conference on Distributed Computing Systems, 1988, pp. 491-499.
9. K. Ranganathan, M. Ripeanu, A. Sarin, and I. T. Foster, "Incentive mechanisms for large collaborative resource sharing," in CCGRID, 2004, pp. 1-8.
10. K. Rzadca, D. Trystram, and A. Wierzbicki, "Fair game-theoretic resource management in dedicated grids," in CCGRID, 2007, pp. 343-350.
11. Y.-K. Kwok, S. Song, and K. Hwang, "Selfish grid computing: gametheoretic modeling and NAS performance results," in CCGRID, 2005, pp. 1143-1150.
12. R. Buyya, D. Abramson, and J. Giddy, "Nimrod/G: An architecture of a resource management and scheduling system in a global computational grid," in Proceedings of the 4th International Conference on High Performance Computing in the Asia-Pacific Region, vol. 1, 2000, pp. 283-289.
13. O. Regev and N. Nisan, "The POPCORN market. online markets for computational resources," Decision Support Systems, vol. 28, no. 1-2, pp. 177-189, 2000.
14. U. Kant and D. Grosu, "Double auction protocols for resource allocation in grids," in International Conference on Information Technology (ITCC), 2005, pp. 366-371.
15. A. Das and D. Grosu, "Combinatorial auction-based protocols for resource allocation in grids," in Proceedings of the International Parallel & Distributed Processing Symposium IPDPS, 2005.
16. Zurel and Nisan, "An efficient approximate allocation algorithm for combinatorial auctions," in CECOMM: ACM Conference on Electronic Commerce, 2001.
17. Sandholm, "Algorithm for optimal winner determination in combinatorial auctions," AIJ: Artificial Intelligence, vol. 135, 2002.
18. R. Wolski, J. S. Plank, J. Brevik, and T. Bryan, "G-commerce: Market formulations controlling resource allocation on the computational grid," in Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS), 2001, pp. 46-53.
19. 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," Journal of Parallel and Distributed Computing, vol. 65, no. 11, pp. 1366-1383, 2005.
20. S. K. Garg, S. Venugopal, and R. Buyya, "A meta-scheduler with auction based resource allocation for global grids," Parallel and Distributed Systems, 2008. ICPADS '08. 14th IEEE International Conference on, pp. 187-194, 2008.
21. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, "Seti@home: an experiment in public-resource computing," Commun. ACM, vol. 45, no. 11, pp. 56-61, 2002.
22. G. Debreu, Theory of Value: an Axiomatic Analysis of Economic Equilibrium. New York: John Wiley and Sons, 1959.
23. L. M. Ausubel, "An efficient ascending-bid auction for multiple objects," American Economic Review, vol. 94, no. 5, pp. 1452-1475, 2004.
24. H. Casanova, A. Legrand, and M. Quinson, "SimGrid: a Generic Framework for Large-Scale Distributed Experiments," in 10th IEEE International Conference on Computer Modeling and Simulation, 2008.
25. "Simboinc," uRL: http://simboinc.gforge.inria.fr/.