메뉴 건너뛰기




Volumn , Issue , 2007, Pages 45-52

Improving static task scheduling in heterogeneous and homogeneous computing systems

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; MULTITASKING;

EID: 47249111750     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.49     Document Type: Conference Paper
Times cited : (20)

References (20)
  • 2
    • 85014168050 scopus 로고
    • Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
    • Y.-C. Chung and S. Ranka. Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In Supercomputing '92: Proceedings of the 1992 ACM/IEEE Conference on Supercomputing, pages 512-521, 1992.
    • (1992) Supercomputing '92: Proceedings of the 1992 ACM/IEEE Conference on Supercomputing , pp. 512-521
    • Chung, Y.-C.1    Ranka, S.2
  • 3
    • 33750127985 scopus 로고    scopus 로고
    • Static task scheduling with a unified objective on time and resource domains
    • June
    • B. Demiroz and H. R. Topcuoglu. Static task scheduling with a unified objective on time and resource domains. The Computer Journal, 49(6):731-743, June 2006.
    • (2006) The Computer Journal , vol.49 , Issue.6 , pp. 731-743
    • Demiroz, B.1    Topcuoglu, H.R.2
  • 4
    • 44049113422 scopus 로고
    • A comparison of clustering heuristics for scheduling dags on multiprocessors
    • A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling dags on multiprocessors. Journal of Parallel and Distributed Computing, 16:276-291, 1992.
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , pp. 276-291
    • Gerasoulis, A.1    Yang, T.2
  • 5
    • 84943276699 scopus 로고    scopus 로고
    • A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments
    • Oct
    • T. Hagras and J. Janecek. A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments. In Proc. International Conf. on Parallel Processing Workshops, pages 149-155, Oct. 2003.
    • (2003) Proc. International Conf. on Parallel Processing Workshops , pp. 149-155
    • Hagras, T.1    Janecek, J.2
  • 11
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    • May
    • Y.-K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distributed Syst., 7(4):506-521, May 1996.
    • (1996) IEEE Trans. Parallel Distributed Syst , vol.7 , Issue.4 , pp. 506-521
    • Kwok, Y.-K.1    Ahmad, I.2
  • 12
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv., 31(4):406-471, 1999.
    • (1999) ACM Comput. Surv , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 16
    • 0030706562 scopus 로고    scopus 로고
    • DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor system
    • G. Park, B. Shirazi, and J. Marquis. DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor system. In Proc. International Conf. on Parallel Processing, pages 157-166, 1997.
    • (1997) Proc. International Conf. on Parallel Processing , pp. 157-166
    • Park, G.1    Shirazi, B.2    Marquis, J.3
  • 19
    • 0027542932 scopus 로고
    • A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
    • G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distributed Syst., 4(2):175-187, 1993.
    • (1993) IEEE Trans. Parallel Distributed Syst , vol.4 , Issue.2 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 20
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • March
    • H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distributed Syst., 13(3):260-274, March 2002.
    • (2002) IEEE Trans. Parallel Distributed Syst , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.-Y.3


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