메뉴 건너뛰기




Volumn , Issue , 2007, Pages

PFAS: A resource-performance-fluctuation-aware workflow scheduling algorithm for grid computing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRID COMPUTING; PARALLEL PROCESSING SYSTEMS;

EID: 34548712852     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370328     Document Type: Conference Paper
Times cited : (18)

References (19)
  • 2
    • 84887548418 scopus 로고    scopus 로고
    • GridFlow: Workflow Management for Grid Computing
    • pages:, Tokyo, Japan, May
    • J. Cao, S. A. Jarvis, et al.. GridFlow: Workflow Management for Grid Computing. In Proc. of the 3rd CCGrid, pages: 198-205, Tokyo, Japan, May 2003.
    • (2003) Proc. of the 3rd CCGrid , pp. 198-205
    • Cao, J.1    Jarvis, S.A.2
  • 3
    • 31444449557 scopus 로고    scopus 로고
    • Scheduling of Scientific Workflows in the ASKALON Grid Environment
    • pages:, September
    • M. Wieczorek, R. Prodan and T. Fahringer. Scheduling of Scientific Workflows in the ASKALON Grid Environment. In ACM SIGMOD Record, Vol.34, No.3, pages: 56-62, September 2005.
    • (2005) ACM SIGMOD Record , vol.34 , Issue.3 , pp. 56-62
    • Wieczorek, M.1    Prodan, R.2    Fahringer, T.3
  • 4
    • 28844508855 scopus 로고    scopus 로고
    • Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments
    • pages:, November
    • L. Yang, J. M. Schopf and I. Foster. Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments. In Proc. of the 2003 Supercomputing, pages: 31-46, November 2003.
    • (2003) Proc. of the 2003 Supercomputing , pp. 31-46
    • Yang, L.1    Schopf, J.M.2    Foster, I.3
  • 6
    • 0042888968 scopus 로고    scopus 로고
    • Quality of Service on the Grid via Metascheduling with Resource Co-Scheduling and CoReservation
    • pages
    • G. Mateescu. Quality of Service on the Grid via Metascheduling with Resource Co-Scheduling and CoReservation. In International Journal of High Performance Computing Applications, Vol. 17, No. 3, pages: 209-218, 2003.
    • (2003) International Journal of High Performance Computing Applications , vol.17 , Issue.3 , pp. 209-218
    • Mateescu, G.1
  • 7
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors
    • pages:, May
    • Y.K. Kwok and I. Ahmad. Dynamic Critical-Path Scheduling: an Effective Technique for Allocating Task Graphs to Multiprocessors. In IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 5, pages: 506-521, May, 1996.
    • (1996) IEEE Trans. on Parallel and Distributed Systems , vol.7 , Issue.5 , pp. 506-521
    • Kwok, Y.K.1    Ahmad, I.2
  • 8
    • 0036504666 scopus 로고    scopus 로고
    • Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
    • pages
    • H. Topcuoglu, S. Hariri and M.Y. Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. In IEEE Trans. on Parallel and Distributed Systems, Vol. 13, No. 3, pages: 260-274, 2002.
    • (2002) IEEE Trans. on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.Y.3
  • 9
    • 35048856562 scopus 로고    scopus 로고
    • H. Zhao and R. Sakellariou. An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In Proc. of Euro-Par 2003, Springer-Verlag, LNCS 2790, pages: 189-194, Klagenfurt, Austria, August 2003.
    • H. Zhao and R. Sakellariou. An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In Proc. of Euro-Par 2003, Springer-Verlag, LNCS 2790, pages: 189-194, Klagenfurt, Austria, August 2003.
  • 12
    • 34548783281 scopus 로고    scopus 로고
    • Grid Application Scheduling Algorithms: State of the Art and Open Problems
    • Technical Report No. 2006-504, School of Computing, Queen's University, Canada, Jan
    • F. Dong and S. G. Akl. Grid Application Scheduling Algorithms: State of the Art and Open Problems. Technical Report No. 2006-504, School of Computing, Queen's University, Canada, Jan 2006.
    • (2006)
    • Dong, F.1    Akl, S.G.2
  • 15
    • 0028498486 scopus 로고
    • DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
    • pages
    • T. Yang and A. Gerasoulis. DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. In IEEE Trans. on Parallel and Distributed Systems, vol. 5, no. 9, pages: 951-967, 1994.
    • (1994) IEEE Trans. on Parallel and Distributed Systems , vol.5 , Issue.9 , pp. 951-967
    • Yang, T.1    Gerasoulis, A.2
  • 16
    • 0031697506 scopus 로고    scopus 로고
    • Optimal Scheduling Algorithm for Distributed Memory Machines
    • pages:, January
    • S. Darbha and D.P. Agrawal. Optimal Scheduling Algorithm for Distributed Memory Machines. In IEEE Trans. on Parallel and Distributed Systems, vol. 9, no. 1, pages: 87-95, January 1998.
    • (1998) IEEE Trans. on Parallel and Distributed Systems , vol.9 , Issue.1 , pp. 87-95
    • Darbha, S.1    Agrawal, D.P.2
  • 17
    • 1342287617 scopus 로고    scopus 로고
    • Improving Scheduling of Tasks in A Heterogeneous Environment
    • pages:, February
    • R. Bajaj and D. P. Agrawal, Improving Scheduling of Tasks in A Heterogeneous Environment. In IEEE Trans. on Parallel and Distributed Systems, Vol. 15, no. 2, pages: 107-118, February 2004.
    • (2004) IEEE Trans. on Parallel and Distributed Systems , vol.15 , Issue.2 , pp. 107-118
    • Bajaj, R.1    Agrawal, D.P.2


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