메뉴 건너뛰기
Parallel Computing
Volumn 28, Issue 11, 2002, Pages 1573-1585
Minimizing the volume in scheduling an out-tree with communication delays and duplication
Author keywords

Communication delays; Duplication; Makespan; Out tree
Indexed keywords

COMPUTER ARCHITECTURE; DYNAMIC PROGRAMMING; PARALLEL ALGORITHMS; POLYNOMIALS; SCHEDULING;
EID: 0036827636     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00131-X     Document Type: Article
Times cited : (1)
References (11)
  • 2
    • 0024765785 scopus 로고
    • A polynomial time to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints
    • Chrétienne P. A polynomial time to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints. European Journal of Operational Research. 2:1989;225-230.
    • (1989) European Journal of Operational Research , vol.2 , pp. 225-230
    • Chrétienne, P.1
  • 3
    • 0003151227 scopus 로고
    • Scheduling with communication delays a survey
    • Chrétienne P., Coffman E.G., Lenstra J.K., Liu Z. (Eds.), John Wiley Ltd., New York
    • Chrétienne P., Picouleau C. Scheduling with communication delays a survey. Chrétienne P., Coffman E.G., Lenstra J.K., Liu Z. Scheduling Theory and its Applications. 1995;65-89 John Wiley Ltd. New York.
    • (1995) Scheduling Theory and its Applications , pp. 65-89
    • Chrétienne, P.1    Picouleau, C.2
  • 4
    • 0001769792 scopus 로고
    • C.p.m scheduling with small communication delays and task duplication
    • Colin J.-Y., Chrétienne P. C.p.m scheduling with small communication delays and task duplication. Operations Research. 39:1991;681-684.
    • (1991) Operations Research , vol.39 , pp. 681-684
    • Colin, J.-Y.1    Chrétienne, P.2
  • 5
    • 0041337419 scopus 로고
    • Lower bounds and efficient algorithms for multiprocessor scheduling of DAG's with communication delays
    • Jung H., Kirousis L., Spirakis P. Lower bounds and efficient algorithms for multiprocessor scheduling of DAG's with communication delays. 1.SPAA. 1989;254-264.
    • (1989) 1.SPAA , pp. 254-264
    • Jung, H.1    Kirousis, L.2    Spirakis, P.3
  • 6
    • 0032649712 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling trees with general communication delays
    • Munier A. Approximation algorithms for scheduling trees with general communication delays. Parallel Computing. 25:1999;41-48.
    • (1999) Parallel Computing , vol.25 , pp. 41-48
    • Munier, A.1
  • 7
    • 0031142402 scopus 로고    scopus 로고
    • Using duplication for scheduling unitary tasks on m processors with communication delays
    • Munier A., Hanen C. Using duplication for scheduling unitary tasks on m processors with communication delays, Theoretical Computer Science. (178):1997;119-127.
    • (1997) Theoretical Computer Science , vol.178 , pp. 119-127
    • Munier, A.1    Hanen, C.2
  • 8
    • 0025418536 scopus 로고
    • Towards an architecture independent analysis of parallel algorithms
    • Papadimitriou C., Yannakakis M. Towards an architecture independent analysis of parallel algorithms. SIAM Journal on Computing. 19:1990;322-328.
    • (1990) SIAM Journal on Computing , vol.19 , pp. 322-328
    • Papadimitriou, C.1    Yannakakis, M.2
  • 9
    • 0005029748 scopus 로고
    • Two new NP-complete scheduling problems with communication delays and unlimited number of processors
    • Picouleau C. Two new NP-complete scheduling problems with communication delays and unlimited number of processors. Discrete Applied Mathematics. 60:1995;331-342.
    • (1995) Discrete Applied Mathematics , vol.60 , pp. 331-342
    • Picouleau, C.1
  • 11
    • 0025673181 scopus 로고
    • Multiprocessor scheduling with communication delays
    • Veltman B., Lageweg B.J., Lenstra J.K. Multiprocessor scheduling with communication delays. Parallel Computing. 16:1990;173-182.
    • (1990) Parallel Computing , vol.16 , pp. 173-182
    • Veltman, B.1    Lageweg, B.J.2    Lenstra, J.K.3

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