Balancing risk and reward in a market-based task service

IEEE International Symposium on High Performance Distributed Computing, Proceedings

Volumn , Issue , 2004, Pages 160-169

  Irwin, David E ^a   Grit, Laura E ^a   Chase, Jeffrey S ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING RESOURCES; HEURISTIC BALANCE; MULTIPLE GRID; USER CENTRIC VALUE;

COSTS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; JOB ANALYSIS; RESOURCE ALLOCATION; RISKS;

SCHEDULING;

EID: 4944266204     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.2004.1323519     Document Type: Conference Paper

References (24)

1. I. Baev, W. Meleis, and A. Eichenberger. Algorithms for total weighted completion time scheduling. Algorithmica, 33(1):34-51, May 2002.
2. J. Bent, D. Thain, A. Arpaci-Dusseau, R. Arpaci-Dusseau, and M. Livny. Explicit control in the batch-aware distributed file system. In First Symposium on Networked Systems Design and Implementation, March 2004.
3. A. Burns, D. Prasad, A. Bondavalli, F. D. Giandomenico, K. Ramamritham, J. Stankovic, and L. Strigini. The meaning and role of value in scheduling flexible real-time systems. Journal of Systems Architecture, 46(4):305-325, January 2000.
4. R. Buyya, D. Abramson, J. Giddy, and K. Stockinger. Economic models for resource management and scheduling in grid computing. Special Issue on Grid Computing Environments, The Journal of Concurrency and Computation: Practice and Experience (CCPE), 14(13-15), Nov.-Dec. 2002.
5. A. Byde, M. Salle, and C. Bartolini. Market-based resource allocation for utility data centers. Technical Report HPL-2003-188, HP Laboratories Bristol, 2003.
6. 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 Proceedings of the 18th ACM Symposium on Operating System Principles (SOSP), pages 103-116, October 2001.
7. J. S. Chase, L. E. Grit, D. E. Irwin, J. D. Moore, and S. E. Sprenkle. Dynamic virtual clusters in a grid site manager. In Proceedings of the Twelfth International Symposium on High Performance Distributed Computing (HPDC-12), June 2003.
8. K. Chen and P. Muhlethaler. A scheduling algorithm for tasks described by time value function. Real-Time Systems, 10(3):293-312, 1996.
9. B. Chun. Market-based Cluster Resource Management. PhD thesis, University of California at Berkeley, November 2001.
10. B. N. Chun and D. E. Culler. User-centric performance analysis of market-based cluster batch schedulers. In 2nd IEEE International Symposium on Cluster Computing and the Grid, May 2002.
11. K. Czajkowski, I. Foster, C. Kesselman, V. Sander, and S. Tuecke. SNAP: A protocol for negotiating service level agreements and coordinating resource management in distributed systems. In 8th Workshop on Job Scheduling Strategies for Parallel Processing, July 2002.
12. A. Downey and D. Feitelson. The elusive goal of workload characterization. In Performance Evaluation Review, pages 14-29, March 1999.
13. Y. Fu, J. Chase, B. Chun, S. Schwab, and A. Vahdat. SHARP: An Architecture for Secure Resource Peering. In Proceedings of the 19th ACM Symposium on Operating System Principles, October 2003.
14. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103, March 1972.
15. T. Kelly. Utility-directed allocation. In First Workshop on Algorithms and Architectures for Self-Managing Systems, June 2003.
16. V. Lo, J. Mache, and K. Windisch. A comparative study of real workload traces and synthetic workload models for parallel job scheduling. In Proceedings of the 4th Workshop on Job Scheduling Strategies for Parallel Processing, March 1998.
17. LSF. http://www.platform.com.
18. H. Shan, L. Oliker, and R. Biswas. Job superscheduler architecture and performance in computational grid environments. In Proceedings of Supercomputing (SC2003), November 2003.
19. I. Stoica, H. Abdel-Wahab, and A. Pothen. A microeconomic scheduler for parallel computers. In Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing (IPPS), pages 122-135, April 1995.
20. M. Stonebraker, R. Devine, M. Kornacker, W. Litwin, A. Pfeffer, A. Sah, and C. Staelin. An economic paradigm for query processing and data migration in Mariposa. In 3rd International Conference on Parallel and Distributed Information Systems, September 1994.
21. Sun's GridEngine. http://gridengine.sunsource.net/.
22. C. A. Waldspurger, T. Hogg, B. A. Huberman, J. O. Kephart, and W. S. Stornetta. Spawn: A distributed computational economy. Software Engineering, 18(2): 103-117, 1992.
23. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In First Symposium on Operating Systems Design and Implementation, November 1994.
24. 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.