Evaluating the impact of inaccurate information in utility-based scheduling

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, SC '09

Volumn , Issue , 2009, Pages

  AuYoung, Alvin ^a   Vahdat, Amin ^a   Snoeren, Alex C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION MECHANISM; INACCURATE INFORMATION; MODEL POTENTIAL; OPERATING CONDITION; PRIORITY QUEUES; UTILITY-BASED SCHEDULING; WORST CASE;

SCHEDULING;

EID: 74049135651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1654059.1654098     Document Type: Conference Paper

References (37)

1. E. Anderson, D. Beyer, K. Chaudhuri, T. Kelly, N. Salazar, C. Santos, R. Swaminathan, R. Tarjan, J. Wiener, and Y. Zhou. Value-maximizing deadline scheduling and its application to animation rendering. In Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures, July 2005.
2. L. M. Ausubel and P. Milgrom. The Lovely but Lonely Vickrey Auction, chapter 1. MIT Press, 2006.
3. A. AuYoung, L. E. Grit, J. Wiener, and J. Wilkes. Service contracts and aggregate utility functions. In Proc. 15th IEEE Int'l Symp. High Performance Distributed Computing, June 2006.
4. 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.
5. J. Benhabib and A. Bisin. The distribution of wealth and redistributive policies. Meeting Papers 368, Soc. for Economic Dynamics, Dec. 2006.
6. A. Byde, M. Sallé, and C. Bartolini. Market-Based Resource Allocation for Utility Data Centers. Technical Report HPL-2003-188, Hewlett Packard Laboratories, September 2003.
7. J. S. Chase, D. C. Anderson, P. N. Thakar, A. M. Vahdat, and R. P. Doyle. Managing energy and server resources in hosting centers. In Proc. 18th ACM Symp. Operating Systems Principles, October 2001.
8. K. Chen and P. Muhlethaler. A Scheduling Algorithm for Tasks Described by Time Value Function. Real-Time Systems, 10(3):293-312, May 1996.
9. A. Chernev. Reverse pricing and online price elicitation strategies in consumer choice. J. Consumer Psychology, 13(1&2):51-62, 2003.
10. S.-H. Chiang, A. Arpaci-Dusseau, and M. K. Vernon. The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance. In Proc. 8th Workshop Job Scheduling Strategies for Parallel Processing, July 2002.
11. 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. In Proc. IEEE Workshop Embedded Networked Sensors, May 2005.
12. B. N. Chun and D. E. Culler. User-centric Performance Analysis of Market-based Cluster Batch Schedulers. In Proc. 2nd IEEE Int'l Symp. Cluster Computing and the Grid, May 2002.
13. T. Duffield, D. Hart, and N. Wolter. Data obtained through personal communication. San Diego Supercomputing Center, 2009.
14. D. Feitelson. Parallel Workloads Archive. http: //www.cs.huji.ac.il/labs/ parallel/workload/.
15. D. Feitelson, L. Rudolph, and U. Schwiegelshohn. Parallel Job Scheduling - A Status Report. In Proc. 10th Workshop Job Scheduling Strategies for Parallel Processing, June 2004.
16. D. G. Feitelson. Experimental Analysis of the Root Causes of Performance Evaluation Results: A Backfilling Case Study. IEEE Trans. Parallel and Distributed Systems, 16(2):175-182, Feb. 2005.
17. D. Grosu. AGORA: an architecture for strategyproof computing in grids. In Proc. 3rd Int'l Workshop Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, July 2004.
18. D. E. Irwin, L. E. Grit, and J. S. Chase. Balancing Risk and Reward in a Market-Based Task Service. In Proc. 13th IEEE Int'l Symp. High Performance Distributed Computing, pages 160-169, June 2004.
19. D. Jackson, Q. Snell, and M. Clement. Core algorithms of the Maui scheduler. In Proc. 7th Workshop Job Scheduling Strategies for Parallel Processing, June 2001.
20. T. Kelly. Utility-directed allocation. In Proc. 1st Workshop Algorithms, Architectures for Self-Managing Systems, July 2003.
21. K. Larson and T. Sandholm. Costly Valuation Computation in Auctions. In Proc. 8th Conf. Theoretical Aspects of Rationality and Knowledge, pages 169-182, July 2001.
22. C. B. Lee and A. Snavely. On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions. Int'l J. High Performance Computing Applications, 20(4):495-506, 2006.
23. C. B. Lee and A. E. Snavely. Precise and Realistic Utility Functions for User-centric Performance Analysis of Schedulers. In Proc. 16th IEEE Int'l Symp. High Performance Distributed Computing, June 2007.
24. D. A. Lifka. The ANL/IBM SP Scheduling System. In Proc. 1sd Workshop Job Scheduling Strategies for Parallel Processing, Apr. 1995.
25. A. W. Muálem and D. G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Trans. Parallel and Distributed Systems, 12(6):529-543, June 2001.
26. C. Ng, D. Parkes, and M. Seltzer. Strategyproof Computing: Systems Infrastructures for Self-Interested Parties. In Proc. 1st Workshop Economics of Peer-to-Peer Systems, June 2003.
27. D. C. Parkes, R. Cavallo, N. Elprin, A. Juda, S. Lahaie, B. Lubin, L. Michael, J. Shneidman, and H. Sultan. ICE: An iterative combinatorial exchange. In Proc. 6th ACM Conf. Electronic Commerce (EC 05), pages 249-258, June 2005.
28. D. C. Parkes, L. H. Ungar, and D. P. Foster. Accounting for Cognitive Costs in On-Line Auction Design. Lecture Notes in Computer Science, 1571:25-40, 1998.
29. F. I. Popovici and J. Wilkes. Profitable Services in an Uncertain World. In Proc. ACM/IEEE Conf. Supercomputing, page 36, Nov. 2005.
30. 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. In Proc. 10th USENIX Workshop Hot Topics in Operating Systems, June 2005.
31. D. Talby and D. Feitelson. Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling. In Proc. 13th Int'l Parallel and Distributed Processing Symp., Apr. 1999.
32. D. Tsafrir, Y. Etsion, and D. G. Feitelson. Modeling User Runtime Estimates. In Proc. 11th Workshop Job Scheduling Strategies for Parallel Processing, June 2005.
33. D. Tsafrir and D. G. Feitelson. The Dynamics of Backfilling: Solving the Mystery of Why Increased Inaccuracy May Help. In 2006 IEEE Int'l Symp. Workload Characterization, Oct. 2006.
34. W. E. Walsh, G. Tesauro, J. O. Kephart, and R. Das. Utility Functions in Autonomic Systems. In Proc. 1st Int'l Conf. Autonomic Computing, May 2004.
35. A. Wierman and M. Nuyens. Scheduling despite inexact job-size information. In Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems, June 2008.
36. R. Wolski, J. S. Plank, T. Bryan, and J. Brevik. G-Commerce: Market Formulations Controlling Resource Allocation on the Computational Grid. In Proc. 15th Int'l Parallel and Distributed Processing Symp., Apr. 2001.
37. C. S. Yeo and R. Buyya. A Taxonomy of Market-based Resource Management Systems for Utility-driven Cluster Computing. Software: Practice and Experience, 36(13):1381-1419, Nov. 2006.