메뉴 건너뛰기




Volumn 38, Issue 4-5, 2012, Pages 175-193

Scheduling for heterogeneous Systems using constrained critical paths

Author keywords

Heterogeneous scheduling; List scheduling; Parallel applications; Scheduling algorithms; Static scheduling

Indexed keywords

COMPLEX COMPUTING; CRITICAL PATHS; EXECUTION TIME; FINISH TIME; HETEROGENEOUS SYSTEMS; LIST-SCHEDULING; MULTIPLE PROCESSING; NON-TRIVIAL TASKS; NP COMPLETE; OPTIMAL SCHEDULE; PARALLEL APPLICATION; PARALLEL PROGRAM; PROCESSING ELEMENTS; SCHEDULING STRATEGIES; STATIC SCHEDULING; TASK GRAPH;

EID: 84863421985     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2012.01.001     Document Type: Article
Times cited : (109)

References (33)
  • 1
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • J.L.R.L. Graham, E.L. Lawler, and A.R. Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
    • (1979) Annals of Discrete Mathematics , Issue.5 , pp. 287-326
    • Graham, J.L.R.L.1    Lawler, E.L.2    Kan, A.R.3
  • 4
    • 0026837186 scopus 로고
    • Task scheduling with interprocessor communication delays
    • 10.1016/0377-2217(92)90346-B
    • P. ChrTtienne Task scheduling with interprocessor communication delays European Journal of Operational Research 57 3 1992 348 354 10.1016/0377-2217(92) 90346-B
    • (1992) European Journal of Operational Research , vol.57 , Issue.3 , pp. 348-354
    • Chrttienne, P.1
  • 5
    • 0028498486 scopus 로고
    • Dsc: Scheduling parallel tasks on an unbounded number of processors
    • 10.1109/71.308533
    • T. Yang, and A. Gerasoulis Dsc: scheduling parallel tasks on an unbounded number of processors IEEE Transactions on Parallel and Distributed Systems 5 1994 951 967 10.1109/71.308533
    • (1994) IEEE Transactions on Parallel and Distributed Systems , vol.5 , pp. 951-967
    • Yang, T.1    Gerasoulis, A.2
  • 6
    • 0042387807 scopus 로고
    • A linear time algorithm to schedule trees with communication delays optimally on two machines
    • Utrecht University, Netherlands
    • M. Veldhorst, A linear time algorithm to schedule trees with communication delays optimally on two machines, Technical Report RUU-CS-93-04, Utrecht University, Netherlands, 1993.
    • (1993) Technical Report RUU-CS-93-04
    • Veldhorst, M.1
  • 7
    • 0020164101 scopus 로고
    • Linear-time computability of combinatorial problems on series - Parallel graphs
    • DOI 10.1145/322326.322328
    • K. Takamizawa, T. Nishizeki, and N. Saito Linear-time computability of combinatorial problems on series-parallel graphs Journal of the ACM 29 3 1982 623 641 10.1145/322326.322328 (Pubitemid 12550124)
    • (1982) Journal of the ACM , vol.29 , Issue.3 , pp. 623-641
    • Takamizawa, K.1    Nishizeki, T.2    Saito, N.3
  • 8
    • 0017908061 scopus 로고
    • Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints
    • H.M. Abdel-Wahab, and T. Kameda Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints Operations Research 26 1978 141 158 (Pubitemid 8576427)
    • (1978) Operations Research , vol.26 , Issue.1 , pp. 141-158
    • Abdel-Wahab, H.M.1    Kameda, T.2
  • 10
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • DOI 10.1109/71.993206
    • H. Topcuouglu, S. Hariri, and M.-y. Wu Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Transactions on Parallel and Distributed Systems 13 2002 260 274 10.1109/71.993206 (Pubitemid 34448780)
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.-Y.3
  • 11
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    • Y. Kwong Kwok, and I. Ahmad Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors IEEE Transactions on Parallel and Distributed Systems 7 1996 506 521 (Pubitemid 126782383)
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.5 , pp. 506-521
    • Kwok, Y.-K.1    Ahmad, I.2
  • 12
    • 35048847213 scopus 로고    scopus 로고
    • From heterogeneous task scheduling to heterogeneous mixed parallel scheduling
    • F. Suter, F. Desprez, H. Casanova, From heterogeneous task scheduling to heterogeneous mixed parallel scheduling, in: Euro-Par, Vivien, 2004, pp. 230-237.
    • (2004) Euro-Par, Vivien , pp. 230-237
    • Suter, F.1    Desprez, F.2    Casanova, H.3
  • 13
    • 0024034138 scopus 로고
    • Multiprocessor scheduling with interprocessor communication delays
    • DOI 10.1016/0167-6377(88)90080-6
    • C.-Y. Lee, J.-J. Hwang, Y.-C. Chow, and F.D. Anger Multiprocessor scheduling with interprocessor communication delays Operations Research Letters 7 3 1988 141 147 10.1016/0167-6377(88)90080-6 (Pubitemid 18651168)
    • (1988) Operations Research Letters , vol.7 , Issue.3 , pp. 141-147
    • Lee Chung-Yee1    Hwang Jing-Jang2    Chow Yuan-Chieh3    Anger Frank, D.4
  • 14
    • 85030319813 scopus 로고    scopus 로고
    • A dynamic matching and scheduling algorithm for heterogeneous computing systems
    • IEEE Computer Society Washington, DC, USA
    • M. Maheswaran, and H.J. Siegel A dynamic matching and scheduling algorithm for heterogeneous computing systems Proceedings of the Seventh Heterogeneous Computing Workshop, HCW'98 1998 IEEE Computer Society Washington, DC, USA 57 69
    • (1998) Proceedings of the Seventh Heterogeneous Computing Workshop, HCW'98 , pp. 57-69
    • Maheswaran, M.1    Siegel, H.J.2
  • 16
    • 0025440941 scopus 로고
    • Scheduling parallel program tasks onto arbitrary target machines
    • DOI 10.1016/0743-7315(90)90042-N
    • H. El-Rewini, and T.G. Lewis Scheduling parallel program tasks onto arbitrary target machines Journal of Parallel and Distributed Computing 9 2 1990 138 153 10.1016/0743-7315(90)90042-N (Pubitemid 20729738)
    • (1990) Journal of Parallel and Distributed Computing , vol.9 , Issue.2 , pp. 138-153
    • El-Rewini Hesham1    Lewis, T.G.2
  • 17
    • 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 Transactions on Parallel and Distributed Systems 4 2 1993 175 187
    • (1993) IEEE Transactions on Parallel and Distributed Systems , vol.4 , Issue.2 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 18
    • 0023866688 scopus 로고
    • Grain size determination for parallel processing
    • DOI 10.1109/52.1991
    • B. Kruatrachue, and T. Lewis Grain size determination for parallel processing IEEE Software 5 1988 23 32 10.1109/52.1991 (Pubitemid 18596651)
    • (1988) IEEE Software , vol.5 , Issue.1 , pp. 23-32
    • Kruatrachue Boontee1    Lewis Ted2
  • 19
    • 0025566270 scopus 로고
    • Lower bound on the number of processors and time for scheduling precedence graphs with communication costs
    • 10.1109/32.62447
    • M.A. Al-Mouhamed Lower bound on the number of processors and time for scheduling precedence graphs with communication costs IEEE Transactions on Software Engineering 16 1990 1390 1401 10.1109/32.62447
    • (1990) IEEE Transactions on Software Engineering , vol.16 , pp. 1390-1401
    • Al-Mouhamed, M.A.1
  • 20
    • 0032166239 scopus 로고    scopus 로고
    • On exploiting task duplication in parallel program scheduling
    • I. Ahmad, and Y.-K. Kwok On exploiting task duplication in parallel program scheduling IEEE Transactions on Parallel and Distributed Systems 9 9 1998 872 892 10.1109/71.722221 (Pubitemid 128752026)
    • (1998) IEEE Transactions on Parallel and Distributed Systems , vol.9 , Issue.9 , pp. 872-892
    • Ahmad, I.1    Kwok, Y.-K.2
  • 21
    • 67349261356 scopus 로고    scopus 로고
    • Compaction of schedules and a two-stage approach for duplication-based dag scheduling
    • 10.1109/TPDS.2008.260
    • D. Bozda, F. Özgüner, and U.V. Catalyurek Compaction of schedules and a two-stage approach for duplication-based dag scheduling IEEE Transactions on Parallel and Distributed Systems 20 2009 857 871 10.1109/TPDS.2008.260
    • (2009) IEEE Transactions on Parallel and Distributed Systems , vol.20 , pp. 857-871
    • Bozda, D.1    Özgüner, F.2    Catalyurek, U.V.3
  • 22
  • 25
    • 0028727449 scopus 로고
    • Exploiting duplication to minimize the execution times of parallel programs on message-passing systems
    • doi:10.1109/SPDP.1994.346138
    • Y.-K. Kwok, I. Ahmad, Exploiting duplication to minimize the execution times of parallel programs on message-passing systems, in: Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994 1994, pp. 426 -433. doi:10.1109/SPDP.1994.346138.
    • (1994) Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994 , pp. 426-433
    • Kwok, Y.-K.1    Ahmad, I.2
  • 28
  • 30
    • 44049113422 scopus 로고
    • A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
    • 10.1016/0743-7315(92)90012-C
    • A. Gerasoulis, and T. Yang A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors Journal of Parallel and Distributed Computing 16 4 1992 276 291 10.1016/0743-7315(92)90012-C
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , Issue.4 , pp. 276-291
    • Gerasoulis, A.1    Yang, T.2
  • 32
    • 0020593101 scopus 로고
    • Solving linear algebraic equations on an mimd computer
    • DOI 10.1145/322358.322366
    • R.E. Lord, J.S. Kowalik, and S.P. Kumar Solving linear algebraic equations on an mimd computer Journal of the ACM 30 1983 103 117 10.1145/322358.322366 (Pubitemid 13504813)
    • (1983) Journal of the ACM , vol.30 , Issue.1 , pp. 103-117
    • Lord, R.E.1    Kowalik, J.S.2    Kumar, S.P.3


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