Combinatorial auction-based protocols for resource allocation in grids

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Das, Anubhav ^a   Grosu, Daniel ^a  

^a Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL AUCTION MODEL; ECONOMIC EFFICIENCY; RESOURCE MANAGEMENT; TASKS EXECUTION;

ALGORITHMS; COMPUTER SIMULATION; COST EFFECTIVENESS; NETWORK PROTOCOLS; PERFORMANCE; RESOURCE ALLOCATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33746298128     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.140     Document Type: Conference Paper

References (21)

1. D. Abramson, R. Buyya, and J. Giddy. A computational economy for grid computing and its implementation in the Nimrod-G resource broker. Future Generation Computing Systems, 18(8):1061-1074, October 2002.
2. A. Andersson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. In Proc. of the Fourth International Conference on Multi-Agent Systems, pages 39-46, July 2000.
3. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger. Economic models for resource allocation and scheduling in grid computing. Concurrency and Computation: Practice and Experience, 14(13-15):1507-1542, November 2002.
4. R. Buyya and M. Murshed. Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurrency and Computation: Practice and Experience, 14(13-15):1175-1220, November 2002.
5. H. Casanova. Simgrid: A toolkit for the simulation of application scheduling. In Proc. of the IEEE/ACM International Symposium on Cluster Computing and the Grid, pages 430-437, May 2002.
6. K. M. Chao, R. Anane, J. H. Chen, and R. Gatward. Negotiating agents in a market-oriented grid. In Proc. of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, pages 406-407, May 2002.
7. C. Chen, M. Maheswaran, and M. Toulouse. Supporting coallocation in an auctioning-based resource allocator for grid systems. In Proc. of the 11th IEEE Heterogeneous Computing Workshop, pages 89-96, April 2002.
8. D. Ferguson, Y. Yemini, and C. Nikolaou. Microeconomic algorithms for load balancing in distributed systems. In Proc. of the 8-th IEEE Intl. Conf. on Distr. Comp. Systems, pages 491-499, 1988.
9. I. Foster and C. Kesselman. The Grid: a Blueprint for a New Computing Infrastructure. 2nd edition, Morgan Kaufmann, San Francisco, CA, 2003.
10. Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proc. of the 16th International Joint Conference on Artificial Intelligence, pages 548-553, July 1999.
11. R. Gagliano, M. Fraser, and M. Schaefer. Auction allocation of computing resources. Communications of the ACM, 38(6):88-100, June 1995.
12. J. Gomoluch and M. Schroeder. Market-based resource allocation for grid computing: A model and simulation. In Proc. of the 1st International Workshop on Middleware for Grid Computing, pages 211-218, June 2003.
13. D. Grosu and A. Das. Auction-based resource allocation protocols in grids. In Proc. of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, pages 20-27, November 2004.
14. J. Nabrzyski, J. M. Schopf, and J. Weglarz. Grid Resource Management, State of the Art and Future Trends. Kluwer Academic Publishers, Boston, MA, 2003.
15. M. H. Rothkhof, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147, August 1998.
16. T. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proc. of the 16th International Joint Conference on Artificial Intelligence, pages 542-547, 1999.
17. S. Vazhkudai and G. von Laszewski. A greedy grid - the grid economic engine directive. In Proc. of the 15th IEEE International Parallel and Distributed Processing Symposium, pages 1806-1815, April 2001.
18. R. Vohra and S. de Vries. Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3):284-309, Summer 2003.
19. R. Wolski, J. S. Plank, J. Brevik, and T. Bryan. Analyzing market-based resource allocation strategies for the computational grid. The International Journal of High Performance Computing Applications, 15(3):258-281, Fall 2001.
20. R. Wolski, J. S. Plank, T. Bryan, and J. Brevik. G-commerce: market formulations controlling resource allocation on the computational grid. In Proc. of the 15th IEEE International Parallel and Distributed Processing Symposium, April 2001.
21. E. Zurel and N. Nisan. An efficient approximate allocation algorithm for combinatorial auctions. In Proc. of the 3rd ACM Conference on Electronic Commerce, pages 125-136, October 2001.