Economic scheduling in grid computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2537, Issue , 2002, Pages 128-152

  Ernemann, Carsten ^a   Hamscher, Volker ^a   Yahyapour, Ramin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

QUALITY OF SERVICE; SCHEDULING; SCHEDULING ALGORITHMS;

ACCESS POLICIES; COMPUTING PLATFORM; COMPUTING RESOURCE; ECONOMIC MODELS; ECONOMIC SCHEDULING; MARKET ECONOMICS; SCHEDULING TASKS; TIME MINIMIZATION;

GRID COMPUTING;

EID: 84974731321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36180-4_8     Document Type: Conference Paper

References (29)

1. N. Bogan. Economic allocation of computation time with computation markets. In Master Thesis. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May 1994.
2. R. Buyya, D. Abramson, J. Giddy, and H. 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), May 2002(accepted for publication).
3. R. Buyya, J. Giddy, and D. Abramson. An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications. In The Second Workshop on Active Middleware Services (AMS 2000), In conjuction with Ninth IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), Pittsburgh, USA, August 2000. Kluwer Academic Press.
4. K. Czajkowski, I. Foster, C. Kesselman, S. Martin, W. Smith, and S. Tuecke. A Resource Management Architecture for Metacomputing Systems. In Job Scheduling Strategies for Prallel Processing, volume 1459 of Lecutre Notes in Computer Science, pages 62-68 Springer Verlag, 1998.
5. European grid forum, http://www.egrid.org, August 2002.
6. C. Ernemann, V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. On Advantages of Grid Computing for Parallel Job Scheduling. In Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid (CC-GRID 2002), Berlin, pages 39-46 2002.
7. C. Ernemann, V. Hamscher, A. Streit, and R. Yahyapour. On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids. In International Conference on Architecture of Computing Systems, (ARCS 2002), pages 169-179. VDE-Verlag, April 2002.
8. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong. Theory and Practice in Parallel Job Scheduling. In D. G. Feitelson and L. Rudolph, editors, IPPS’97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 34. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997.
9. D. G. Feitelson and A. M. Weil. Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In Procedings of IPPS/SPDP 1998, pages 542-546. IEEE Computer Society, 1998.
10. I. Foster and C. Kesselman. Globus: A metacomputing Infrastructure Toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115-128, 1997.
11. I. Foster and C. Kesselman, editors. The GRID: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1998.
12. The Grid Forum, http://www.gridforum.org, August 2002.
13. V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. Evaluation of Job-Scheduling Strategies for Grid Computing. Lecture Notes in Computer Science, 1971:191-202, 2000
14. S. Hotovy. Workload Evolution on the Cornell Theory Center IBM SP2. In D. G. Feitelson and L. Rudolph, editors, IPPS’96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 27-40. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.
15. J. Krallmann, U. Schwiegelshohn, and R. Yahyapour. On the Design and Evaluationof Job Scheduling Systems. In D. G. Feitelson and L. Rudolph, editors, IPPS/SPDP’99 Workshop: Job Scheduling Strategies for Parallel Processing. Springer-Verlag, Lecture Notes in Computer Science, 1999. 141
16. D. A. Lifka. The ANL/IBM SP Scheduling System. In D. G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295-303. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.
17. M. Livny and R. Raman. High-Throughput Resource Management. In I. Foster and C. Kesselman, editors, The Grid - Blueprint for a New Computing Infrastructure, pages 311-337. Morgan Kaufmann, 1999.
18. U. Schwiegelshohn and R. Yahyapour. Analysis of First-Come-First-Serve Parallel Job Scheduling. In Proceedings of the 9th SIAM Symposium on Discrete Algorithms, pages 629-638, January 1998.
19. U. Schwiegelshohn and R. Yahyapour. Resource Allocation and Scheduling in Metasystems. In P. Sloot, M. Bibak, A. Hoekstra, and B. Hertzberger, editors, Proceedings of the Distributed Computing and Metacomputing Workshop at HPCN Europe, pages 851-860. Springer-Verlag, Lecture Notes in Computer Science LNCS 1593, April 1999.
20. L. Smarr and C. E. Catlett. Metacomputing. Communications of the ACM, 35(6):44-52, June 1992.
21. I. Stoica, H. Abdel-Wahab, and A. Pothen. A Microeconomic Scheduler for Parallel Computers. In D. G. Feitelson and L. Rudolph, editors, IPPS’95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 200-218. SpringerVerlag, Lecture Notes in Computer Science LNCS 949, 1995.
22. M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A Wide-Area Distributed Database System. VLDB Journal, 5(1):48-63, 1996.
23. Parallel Workloads Archive. http://www.cs.huji.ac.il/labs/parallel/workload/, August 2002.
24. K. R. Grant, T. W. Malone, R.E. Fikes and M. T. Howard. Enterprise: A Market-like Task Scheduler for Distributed Computing Environments. In The Ecology of Computation, volume 2 of Studies in Computer Science and Artifical Intelligence, pages 177-255, 1988.
25. P. Tucker. Market Mechanisms in a Programmed System. Department of Computer Science and Engineering, University of California, 1998.
26. P. Tucker and F. Berman. On market mechanisms as a software technique, 1996.
27. C. A. Waldspurger, T. Hogg, B. Huberman, J. O. Kephart, and W. S. Stornetta. Spawn: A distributed computational economy. IEEE Transactions on Software Engineering, 18(2):103-117, 1992.
28. W. Walsh, M. Wellman, P. Wurman, and J. MacKieMason. Some economics of market-based distributed scheduling. In In Eighteenth International Conference on Distributed Computing Systems, pages 612-621, 1998.
29. F. Ygge. Market-Oriented Programming and its Application to Power Load Management. PhD thesis, Department of Computer Science, Lund University, 1998.