메뉴 건너뛰기




Volumn 4376 LNCS, Issue , 2007, Pages 47-67

Advance reservation policies for workflows

Author keywords

[No Author keywords available]

Indexed keywords

GRID COMPUTING; PARALLEL PROCESSING SYSTEMS; USER INTERFACES;

EID: 38049112667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71035-6_3     Document Type: Conference Paper
Times cited : (23)

References (33)
  • 2
    • 38049142742 scopus 로고    scopus 로고
    • O. Beaumont, V. Boudet, and Y. Robert. The Iso-Level Scheduling Heuristic for Heterogeneous Processors. Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP2002), 2002 (extended version available as Research Report RR2001-22, LIP, ENS Lyon, France).
    • O. Beaumont, V. Boudet, and Y. Robert. The Iso-Level Scheduling Heuristic for Heterogeneous Processors. Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP2002), 2002 (extended version available as Research Report RR2001-22, LIP, ENS Lyon, France).
  • 3
    • 38049162937 scopus 로고    scopus 로고
    • G. B. Berriman, J. C. Good, A. C. Laity, A. Bergou, J. Jacob, D. S. Katz, E. Deelman, C. Kesselman, G. Singh, M. Su and R. Williams. Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory. In the Conference Series of Astronomical Data Analysis Software and Systems XIII (ADASS XIII), 314, 2004.
    • G. B. Berriman, J. C. Good, A. C. Laity, A. Bergou, J. Jacob, D. S. Katz, E. Deelman, C. Kesselman, G. Singh, M. Su and R. Williams. Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory. In the Conference Series of Astronomical Data Analysis Software and Systems XIII (ADASS XIII), Volume 314, 2004.
  • 5
  • 11
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors
    • Y.-K. Kwok and I. Ahmad. Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, Vol. 7(5):506-521, 1996.
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.5 , pp. 506-521
    • Kwok, Y.-K.1    Ahmad, I.2
  • 12
    • 0002050141 scopus 로고    scopus 로고
    • Static Scheduling Algorithms for Allocating Directed Task Graphs
    • Y.-K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs. ACM Computing Surveys, 31(4):406-471, 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 13
    • 84974728067 scopus 로고    scopus 로고
    • Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems
    • Job Scheduling Strategies for Parallel Processing, Springer-Verlag
    • B. Lawson and E. Smirni. Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems. In Job Scheduling Strategies for Parallel Processing, Springer-Verlag, Lecture Notes in Computer Science, Vol. 2537, pp. 72-87, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2537 , pp. 72-87
    • Lawson, B.1    Smirni, E.2
  • 15
    • 38049126793 scopus 로고    scopus 로고
    • D. A. Lifka, M. W. Henderson, and K. Rayl. Users Guide to the Argonne SP Scheduling System. Technique Report ANL/MCS-TM-201, Argonne National Laboratory.
    • D. A. Lifka, M. W. Henderson, and K. Rayl. Users Guide to the Argonne SP Scheduling System. Technique Report ANL/MCS-TM-201, Argonne National Laboratory.
  • 21
    • 0035363047 scopus 로고    scopus 로고
    • Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling
    • A. W. Mu'alem and D. G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems, 12(6):529-543, 2001.
    • (2001) IEEE Transactions on Parallel and Distributed Systems , vol.12 , Issue.6 , pp. 529-543
    • Mu'alem, A.W.1    Feitelson, D.G.2
  • 24
    • 12944263565 scopus 로고    scopus 로고
    • A low-cost rescheduling policy for efficient mapping of workflows on grid systems
    • Dec
    • R. Sakellariou and H. Zhao. A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Scientific Programming, 12(4):253-262, Dec. 2004.
    • (2004) Scientific Programming , vol.12 , Issue.4 , pp. 253-262
    • Sakellariou, R.1    Zhao, H.2
  • 25
    • 34547721661 scopus 로고    scopus 로고
    • Resource Management for Future Generation Grids
    • Future Generation Grids, V. Getov, D. Laforenza, A. Reinefeld Eds, Springer
    • U. Schwiegelshohn, P. Wieder and R. Yahyapour. Resource Management for Future Generation Grids. In Future Generation Grids, V. Getov, D. Laforenza, A. Reinefeld (Eds.), Springer, CoreGrid Series, 2005.
    • (2005) CoreGrid Series
    • Schwiegelshohn, U.1    Wieder, P.2    Yahyapour, R.3
  • 26
    • 0027542932 scopus 로고
    • A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecture
    • February
    • G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecture. IEEE Transactions on Parallel and Distributed Systems, 4(2): 175-187, February 1993.
    • (1993) IEEE Transactions on Parallel and Distributed Systems , vol.4 , Issue.2 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 27
    • 84955597092 scopus 로고    scopus 로고
    • The EASY - LoadLeveler API Project
    • Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
    • J. Skonira, W. Chan, H. Zhou, and D. Lifka. The EASY - LoadLeveler API Project. In Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, Springer-Verlag Lecture Notes In Computer Science, Vol. 1162, pp. 41-47, 1996.
    • (1996) Springer-Verlag Lecture Notes In Computer Science , vol.1162 , pp. 41-47
    • Skonira, J.1    Chan, W.2    Zhou, H.3    Lifka, D.4
  • 29
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • March
    • H. Topcuoglu, S. Hariri, and M. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, March 2002.
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.3
  • 30
    • 31444449557 scopus 로고    scopus 로고
    • Scheduling of Scientific Workflows in the ASKALON Grid Environment
    • September
    • M. Wieczorek, R. Prodan and T. Fahringer. Scheduling of Scientific Workflows in the ASKALON Grid Environment. In SIGMOD Record, volume 34(3), September 2005.
    • (2005) SIGMOD Record , vol.34 , Issue.3
    • Wieczorek, M.1    Prodan, R.2    Fahringer, T.3
  • 31
    • 33847146803 scopus 로고    scopus 로고
    • An Evaluation of Heuristics for SLA Based Parallel Job Scheduling
    • in conjunction with IPDPS, IEEE Computer Society
    • V. Yarmolenko and R. Sakellariou. An Evaluation of Heuristics for SLA Based Parallel Job Scheduling. In 3rd High Performance Grid Computing Workshop (in conjunction with IPDPS 2006), IEEE Computer Society, 2006.
    • (2006) 3rd High Performance Grid Computing Workshop
    • Yarmolenko, V.1    Sakellariou, R.2
  • 32
    • 35048885520 scopus 로고    scopus 로고
    • A Low-Cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems
    • Proceedings of the 2nd AcrossGrids, Springer
    • H. Zhao and R. Sakellariou. A Low-Cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems. In Proceedings of the 2nd AcrossGrids, Lecture Notes in Computer Science, Vol. 3165, pages 21-31, Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3165 , pp. 21-31
    • Zhao, H.1    Sakellariou, R.2
  • 33
    • 35048856562 scopus 로고    scopus 로고
    • An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm
    • Proceedings of 9th International Euro-Par Conference, Springer
    • H. Zhao and R. Sakellariou. An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In Proceedings of 9th International Euro-Par Conference, Lecture Notes in Computer Science, Vol. 2790, Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2790
    • Zhao, H.1    Sakellariou, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.