On advantages of grid computing for parallel job scheduling

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2002

Volumn , Issue , 2002, Pages 39-46

  Ernemann, Carsten ^a   Hamscher, Volker ^a   Schwiegelshohn, Uwe ^a   Yahyapour, Ramin ^a   Streit, Achim ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER COMPUTING; COMPUTER ARCHITECTURE; SCHEDULING ALGORITHMS;

COMMUNICATION OVERHEADS; GRID COMPUTING ENVIRONMENT; JOB EXECUTION; MULTI-SITE; PARALLEL JOB SCHEDULING; POTENTIAL BENEFITS; REAL TRACE;

GRID COMPUTING;

EID: 84887936800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2002.1017110     Document Type: Conference Paper

References (18)

1. M.Brune, J.Gehring, A.Keller, and A.Reinefeld.Managing clusters of geographically distributed highperformance computers.Concurrency-Practice and Experience, 11(15):887-911, 1999
2. European GRID Forum, http://www.egrid.org, October 2001
3. D.G.Feitelson.A Survey of Scheduling in Multiprogrammed Parallel Systems.Research report rc 19790 (87657), IBM T.J.Watson Research Center, Yorktown Heights, NY, February 1995
4. D.G.Feitelson and L.Rudolph.Parallel job scheduling: Issues and approaches.In IPPS'95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1-18.Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995
5. D.G.Feitelson, L.Rudolph, U.Schwiegelshohn, and K.C.Sevcik.Theory and Practice in Parallel Job Scheduling.pages 1-34.Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997
6. D.G.Feitelson and A.M.Weil.Utilization and Predictabillity in Scheduling the IBM SP2 with Backfilling.In Proceedings of IPPS/SPDP 1998, IEEE Computer Society, pages 542-546, 1998
7. I.Foster and C.Kesselman, editors.The GRID: Blueprint for a New Computing Infrastructure.Morgan Kaufmann, 1998
8. The grid forum, http://www.gridforum.org, October 2001
9. V.Hamscher, U.Schwiegelshohn, A.Streit, and R.Yahyapour.Evaluation of Job-Scheduling Strategies for Grid Computing.pages 191-202.Springer-Verlag, Lecture Notes in Computer Science LNCS 1971, 2000
10. 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
11. J.Krallmann, U.Schwiegelshohn, and R.Yahyapour.On the Design and Evaluation of Job Scheduling Algorithms.In Fifth Annual Workshop on Job Scheduling Strategies for Parallel Processing, IPPS'99; San Juan, Puerto Rico; April 1999, pages 17-42.Springer-Verlag, Lecture Notes in Computer Science LNCS 1659, 1999
12. 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
13. 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
14. 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
15. U.Schwiegelshohn and R.Yahyapour.Fairness in Parallel Job Scheduling.Journal of Scheduling, 3(5):297-320.John Wiley, 2000
16. J.Skovira, W.Chan, H.Zhou, and D.Lifka.The EASY - LoadLeveler API Project.volume 1162, pages 41-47.Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996
17. L.Smarr and C.E.Catlett.Metacomputing.Communications of the ACM, 35(6):44-52, June 1992
18. Parallel Workloads Archive.http://www.cs.huji.ac.il/labs/parallel/ workload/, October 2001.