A market design for grid computing

INFORMS Journal on Computing

Volumn 20, Issue 1, 2008, Pages 100-111

  Bapna, Ravi ^a   Das, Sanjukta ^b   Garfinkel, Robert ^c   Stallaert, Jan ^c  

^a INDIAN SCHOOL OF BUSINESS   (India)

^b UNIVERSITY AT BUFFALO   (United States)

^c UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Combinatorial call auction; Fair versus efficient allocation; Grid computing; Market design; Social welfare

Indexed keywords

EID: 48349106714     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1070.0221     Document Type: Article

References (32)

1. Ausubel, L. M. 2006. An efficient dynamic auction for heterogeneous commodities. Amer.Econom. Rev. 96 602-629.
2. Ba, S., J. Stallaert, A. B. Whinston. 2001. Optimal investment in knowledge within a firm using a market mechanism. Management Sci. 47 1203-1219.
3. Bapna, R., P. Goes, A. Gupta. 2005. Pricing and allocation for quality differentiated online services. Management Sci. 51 1141-1150.
4. Berman, F., A. Chien, K. Cooper, J. Dongarra, I. Foster, D. Gannon, L. Johnson, K. Kennedy, C. Kessclman, J. Mellor-Crummey, D. Reed, L. Torczon, R. Wolski. 2002. The GrADS project: Software support for high-level grid application development. Internat.J High-Performance Comput. Appl. 15 327-344.
5. Bertin, L. 2001. Grid computing promises to reshape the backbone of the Internet-and perhaps our entire view of technology. Information Week, http://www.informationweek.com/story/IWK20010809S0010.
6. Bikchandani, S., J. W. Mamer. 1997. Competitive equilibrium in an exchange economy with indivisibilities. J Econom. Theory 74 385-413.
7. Buyya, R. 2002. Economic-based distributed resource management and scheduling for grid computing. PhD thesis, School of Computer Science and Software Engineering, Monash University, Melbourne, Australia.
8. Clarke, E. H. 1971. Multipart pricing of public goods. Public Choice 11 17-33.
9. Cramton, P., Y. Shoham, R. Steinberg. 2006. Combinatorial Auctions. MIT Press, Cambridge, MA.
10. DeVries, S., R. Vohra. 2003. Combinatorial auctions: A survey. INFORMS J Comput. 15 284-309.
11. Fan, M., J. Stallaert, A. B. Whinston. 2003. Decentralized mechanism design for supply chain organizations using an auction market. Inform. Systems Res. 14 1-22.
12. Foster, I., C. Kesselman, J. Nick, S. Tuecke. 2002. The physiology of the grid: An open grid services architecture for distributed systems integration. Open Grid Service Infrastructure WG, Global Grid Forum, http://www.globus.org/ alliancc/publications/papers/ogsa.pdf.
13. Globus Alliance. 2006. The Globus Alliance. Retrieved October 19, 2007, http://www.globus.org.
14. Groves, T. 1973. Incentives in teams. Econometrica 41 617-631.
15. Gupta, A., D. O. Stahl, A. B. Whinston. 1997. A stochastic equilibrium model of internet pricing. J Econom. Dynamics Control 21 697-722.
16. Keahey, K., T. Fredian, Q. Peng, D. P. Schissel, M. Thompson, I. Foster, M. Greenwald, D. McCune. 2002. Computational grids in action: The national fusion collaboratory. Future Generation Comput. Systems 18 1005-1015.
17. Kothari, A., T. Sandholm, S. Suri. 2002. Solving combinatorial exchanges: Optimality via a few partial bids. Proc. AAAI-02 Workshop on AI for Intelligent Bus., Edmonton, Alberta, Canada, AAAI Press, Edmonton, AB, Canada.
18. Lee, B.-D., J. M. Schopf. 2003. Run-time prediction of parallel applications on shared environments. IEEE Internat. Conf. Proc. Cluster 2003, IEEE Computer Society, Hong Kong, 487-491.
19. Nakada, H., H. Takagi, S. Matsuoka, U. Nagashima, M. Sato, S. Sekiguchi. 1998. Utilizing the metaserver architecture in the ninf global computing system. Proc. Internat. Conf. Exhibition on High-Performance Computing and Netivorking '98, Lecture Notes in Computer Science, Vol. 1401, Springer, Amsterdam, 607-616.
20. O'Hara, M. 1995. Market Microstructure Theory. Blackwell Publishers, Maiden, MA.
21. Pekec, A., M. H. Rothkopf. 2003. Combinatorial auction design. Management Sci. 49 1485-1503.
22. Regev, O., N. Nisan. 1998. The popcorn market-An online market for computational resources. Proc. First Internat. Conf. Inform. Comput. Economies, ACM Press, Charleston, SC, 148-157.
23. Rothkopf, M. H., A. Pekec, R. M. Harstad. 1998. Computationally manageable combinatorial auctions. Management Sci. 44 1131-1147.
24. Russel, M., G. Allen, G. Daues, I. Foster, E. Seidel, J. Novotny, J. Shalf, G. von Laszewski. 2002. The astrophysics simulation collaboratory: A science portal enabling community software development. Cluster Comput. 5 297-304.
25. Smith, W., I. Foster, V. Taylor. 1998. Predicting application run times using historical information. Proc. IPPS/SPDP 1998 Workshop on Job Scheduling Strategies for Parallel Processing, Holborn Books, Orlando, FL, 122-142.
26. Tannenbaum, T, M. Litzkow. 1995. The condor distributed processing system. Dr. DobbsJ2 40-48.
27. Vance, A. 2005. Sun's grid: Lights on, no customers. Channel Register (October 25), http://www.channelregister.co.uk/2005/10/ 25 / sun-grid-slip/.
28. Vickrey, W. 1961. Counter-speculation, auctions, and competitive sealed tenders. J Finance 41 8-37.
29. Waldspurger, C. A., T. Hogg, B. Huberman, J. O. Kephart, S. Stornetta. 1992. Spawn: A distributed computational economy. IEEE Trans. Software Engrg. 18 103-117.
30. Wang, R. 1993. Auctions versus posted-price selling. Amer. Econom. Rev. 83 838-851.
31. Wolski, R., J. Plank, J. Brevik. 2003. G-commcrce-Building computational marketplaces for the computational grid. Technical Report CS-00-439, The University of Tennessee at Knoxville, Knoxville, TN.
32. Wolski, R., J. Plank, J. Brevik, T. Bryan. 2001. Analyzing market- based resource allocation strategies for the computational grid. Internat. J. High-Performance Comput. Appl. 15 258-281.