Two Auction-Based Resource Allocation Environments: Design and Experience

Market-Oriented Grid and Utility Computing

Volumn , Issue , 2009, Pages 513-539

  Auyoung, Alvin ^a   Buonadonna, Phil ^b   Chun, Brent N ^b   Ng, Chaki ^c   Parkes, David C ^c   Shneidman, Jeff ^c   Snoeren, Alex C ^a   Vahdat, Amin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTEL CORPORATION   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Mirage architecture and deployment experience on Intel Research Sensor Network Lab; System design; Two auction based resource allocation environments design and experience

Indexed keywords

EID: 84891025737     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470455432.ch23     Document Type: Chapter

References (51)

1. eBay, inc, http://www.ebay.com/.
2. EmuLab, http://www.emulab.net/.
3. Millennium sensor cluster. http://www.millennium.berkeley.edu/sensornets/.
4. Parallel Workloads Archive, http://www.cs.huji.ac.il/labs/parallel/workload/.
5. PlanetLab, http://planet-lab.org/.
6. San Diego Supercomputing Center, http://www.sdsc.edu/.
7. TeraGrid, http://teragrid.org/.
8. A. AuYoung, B. N. Chun, A. C. Snoeren, and A. Vahdat, Resource allocation in federated distributed computing infrastructures, Proc. 1stACMWorkshop on Operating System and Architectural Support for the On Demand IT Infrastructure (OASIS 04), Boston, MA, Oct. 9, 2004.
9. A. AuYoung, L. E. Grit, J. Wiener, and J. Wilkes, Service contracts and aggregate utility functions, Proc. 13th IEEE International Symp. High Performance Distributed Computing, Paris, France, June 19-23, 2006.
10. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F.Wang, On the competitiveness of on-line real-time task scheduling, Real-Time Systems 4(2):125-144 (1992).
11. C. Boutilier, Bidding languages for combinatorial auctions, Proc. 17th International Joint Conf. Artificial Intelligence, Seattle, WA, Aug. 4-10, 2001.
12. A. Byde, M. Salle, and C. Bartolini, Market-Based Resource Allocation for Utility Data Centers, Technical Report HPL-2003-188, HP Laboratories, 2003.
13. J. S. Chase, D. C. Anderson, P. N. Thakar, A.M.Vahdat, and R. P. Doyle, Managing energy and server resources in hosting centers, Proc. 18th ACM Symp. Operating Systems Principles (SOSP 01), Chateau Lake Louise, Banff, Canada, Oct. 21-24, 2001.
14. K. Chen and P. Muhlethaler, A scheduling algorithm for tasks described by time value function, Real-Time Systems 10(3):293-312 (1996).
15. N. Christin, J. Grossklags, and J. Chuang, Near Rationality and Competitive Equilibria in Networked Systems, Technical Report 2004-04-CGC, Univ. California Berkeley, 2004.
16. B. N. Chun and A. Vahdat, Workload and Failure Characterization on a Large-Scale Federated Testbed, Technical Report IRB-TR-03-040, Intel Research Berkeley, CA, 2003.
17. B. N. Chun, P. Buonadonna, A. AuYoung, C. Ng, D. C. Parkes, J. Shneidman, A. C. Snoeren, and A. Vahdat, Mirage: A microeconomic resource allocation system for SensorNet testbeds, Proc. 2nd IEEE Workshop on Embedded Networked Sensors (EmNetsII), Sydney, Australia, May 30-31, 2005.
18. B. N. Chun and D. E. Culler, User-centric performance analysis of market-based cluster batch schedulers, Proc. 2nd IEEE International Symp. Cluster Computing and the Grid, Berlin, Germany, May 21-24, 2002.
19. R. K. Clark, E. D. Jensen, and F. D. Reynolds, An Architectural overview of the alpha realtime distributed kernel, Proc. USENIX Winter Technical Conf., San Diego, CA, Jan. 25-29, 1993.
20. J. Dean and S. Ghemawat, MapReduce: Simplified data processing on large clusters, Proc. 6th Conf. Operating Systems Design & Implementation, San Francisco, CA, Dec. 6-8, 2004.
21. D. Feitelson, L. Rudolph, and U. Schwiegelshohn, Parallel job scheduling-a status report, Proc. 10th Workshop on Job Scheduling Strategies for Parallel Processing, New York, NY, June 13, 2004.
22. I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.
23. E. J. Friedman, J. Y. Halpern, and I. Kash, Efficiency and Nash equilibria in a Scrip system for P2P networks, Proc. 7th ACM Conf. Electronic Commerce (EC 06), Ann Arbor, MI June 11-15, 2006.
24. Y. Fu, J. Chase, B. Chun, S. Schwab, and A. Vahdat, Sharp: An architecture for secure resource peering, Proc. 19thACMSymp. Operating Systems Principles (SOSP 03), Bolton Landing, NY, Oct. 19-22, 2003.
25. Intel Research Berkeley, Mirage: Microeconomic Resource Allocation for SensorNet Testbeds, http://mirage.berkeley.intel-research.net/.
26. D. Jackson, Q. Snell, and M. Clement, Core algorithms of the Maui scheduler, Proc. 7th Workshop on Job Scheduling Strategies for Parallel Processing, Cambridge, MA, June 16, 2001.
27. L. Kang and D. C. Parkes, A decentralized auction framework to promote efficient resource allocation in open computational Grids, Proc. Joint Workshop on Economics of Networked Systems and Incentive-Based Computing (NetEcon-IBC 07), San Diego, CA, June 11, 2007.
28. I. A. Kash, E. J. Friedman, and J. Y. Halpern, Optimizing Scrip systems: Efficiency, crashes, hoarders, and altruists, Proc. 8th ACM Conf. Electronic Commerce (EC 07), San Diego, CA, June 11-15, 2007.
29. V. Kumar, B. F. Cooper, and K. Schwan, Distributed stream management using utilitydriven self-adaptive middleware, Proc. 2nd International Conf. Autonomic Computing, Seattle, WA, June 13-16, 2005.
30. K. Lai, B. A. Huberman, and L. Fine, Tycoon: A Distributed Market-Based Resource Allocation System, Technical Report cs.DC/0404013, HP Laboratories, 2004.
31. C. Lee, J. Lehoczky, D. Siewiorek, R. Rajkumar, and J. Hansen, A scalable solution to the multi-resource QoS problem, Proc. 20th IEEE Real-Time Systems Symp., Phoenix, AZ, Dec. 1-3, 1999.
32. C. B. Lee and A. Snavely, On the user-scheduler dialogue: Studies of user-provided runtime estimates and utility functions, International Journal of High-Performance Computing Applications 20(4):495-506 (2006).
33. L. Levy, L. Blumrosen, and N. Nisan, On-line markets for distributed object services: The MAJIC system, Proc. 3rd USENIX Symp. Internet Technologies and Systems, San Francisco, CA, March 26-28, 2001.
34. C. Ng, P. Buonadonna, B. N. Chun, A. C. Snoeren, and A. Vahdat, Addressing strategic behavior in a deployed microeconomic resource allocator, Proc. 3rd Workshop on the Economics of Peer to Peer Systems (P2PEcon 05), Philadelphia, PA, Aug. 22, 2005.
35. N. Nisan, Bidding and allocation in combinatorial auctions, Proc. 2nd ACM Conf. Electronic Commerce, Minneapolis, MN, Oct. 17-20, 2000.
36. D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, Design and implementation tradeoffs for wide-area resource discovery, Proc. 13th IEEE International Symp. High Performance Distributed Computing, Research Triangle Park, NC, July 24-27, 2005.
37. D. C. Parkes, Online mechanisms, in Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds., Cambridge Univ. Press, 2007.
38. L. Peterson, D. Culler, T. Anderson, and T. Roscoe, A blueprint for introducing disruptive technology into the Internet, Proc. 1st Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ, Oct. 28-29, 2002.
39. L. Peterson, V. Pai, N. Spring, and A. Bavier, Using PlanetLab for Network Research:Myths, Realities, and Best Practices, Technical Report PDN-05-028, PlanetLab Consortium, 2005.
40. D. Petrou, G. R. Ganger, and G. A. Gibson, Cluster scheduling for explicitly speculative tasks, Proc. 18th ACMInternational Conf. Supercomputing, Saint-Malo, France, June 26-July 1, 2004.
41. O. Regev and N. Nisan, The POPCORN market-an online market for computational resources, Proc. 1st International Conf. Information and Computation Economies, Charleston, SC, Oct. 25-28, 1998.
42. M. H. Rothkopf, A. Pekec, and R. M. Harstad, Computationally manageable combinational auctions, Management Science 44(8):1131-1147 (1998).
43. T. Sandholm, S. Suri, A. Gilpin, and D. Levine, Winner determination in combinatorial auction generalizations, Proc. 1st International Joint Conf. Autonomous Agents and Multiagent Systems, Bologna, Italy, July 2002.
44. J. Shneidman, C. Ng, D. Parkes, A. AuYoung, A. C. Snoeren, A. Vahdat, and B. N. Chun, Why markets could (but don't currently) solve resource allocation problems in systems, Proc. 10th USENIX Workshop on Hot Topics in Operating Systems (HotOS-X), Santa Fe, NM, June 12-15, 2005.
45. I. Stoica, H. Abdel-Wahab, and A. Pothen, A microeconomic scheduler for parallel computers, Proc. 1st Workshop on Job Scheduling Strategies for Parallel Processing, Santa Barbara, CA, April 25, 1995.
46. I. E. Sutherland, A futures market in computer time, Communications of the ACM 11(6):449-451 (1968).
47. C. A. Waldspurger, T. Hogg, B. A. Huberman, J. O. Kephart, and S. Stornetta, Spawn: A distributed computational economy, IEEE Transactions on Software Engineering 18(2):103-177 (1992).
48. W. E. Walsh, G. Tesauro, J. O. Kephart, and R. Das, Utility functions in autonomic systems, Proc. 1st International Conf. Autonomic Computing, New York, NY, May 17-18, 2004.
49. G. Werner-Allen, P. Swieskowski, and M. Welsh, MoteLab: A wireless sensor network testbed, Proc. 4th International Conf. Information Processing in Sensor Networks, Los Angeles, CA, April 25-27, 2005.
50. R. Wolski, J. S. Plank, T. Bryan, and J. Brevik, G-commerce: Market formulations controlling resource allocation on the computational Grid, Proc. 15th International Parallel and Distributed Processing Symp., San Francisco, CA, April 23-27, 2001.
51. C. S. Yeo and R. Buyya, Pricing for utility-driven resource management and allocation in clusters, International Journal of High-Performance Computing Applications 21(4):405-418 (2007).