메뉴 건너뛰기
Theoretical Computer Science
Volumn 178, Issue 1-2, 1997, Pages 119-127
Using duplication for scheduling unitary tasks on m processors with unit communication delays
Author keywords

Communication delays; Makespan; Scheduling
Indexed keywords

ALGORITHMS; MULTIPROGRAMMING; PROBLEM SOLVING; PROGRAM PROCESSORS; RESOURCE ALLOCATION; SCHEDULING;
EID: 0031142402     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)88194-7     Document Type: Article
Times cited : (23)
References (9)
  • 1
    • 0003151227 scopus 로고
    • Scheduling with communication delays: A survey
    • P. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu, eds., Wiley, New York
    • P. Chrétienne and C. Picouleau, Scheduling with communication delays: a survey, in: P. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu, eds., Scheduling Theory and its Applications (Wiley, New York, 1995) 65-89.
    • (1995) Scheduling Theory and Its Applications , pp. 65-89
    • Chrétienne, P.1    Picouleau, C.2
  • 2
    • 0001769792 scopus 로고
    • CPM scheduling with small communication delays and task duplication
    • J.-Y. Colin and P. Chrétienne, CPM scheduling with small communication delays and task duplication, Oper. Res. 39 (1991) 681-684.
    • (1991) Oper. Res. , vol.39 , pp. 681-684
    • Colin, J.-Y.1    Chrétienne, P.2
  • 3
    • 0010338549 scopus 로고
    • Bounds on the performance of scheduling algorithms
    • E.G. Coffman Jr., ed., Wiley, New York
    • R.L. Graham, Bounds on the performance of scheduling algorithms, in: E.G. Coffman Jr., ed., Computer and Job-Shop Scheduling Theory (Wiley, New York, 1976).
    • (1976) Computer and Job-Shop Scheduling Theory
    • Graham, R.L.1
  • 4
    • 0345749295 scopus 로고
    • An approximation algorithm for scheduling unitary tasks on m processors with communication delays
    • Unìversité P. et M. Curie, Paris, France
    • A. Munier and C. Hanen, An approximation algorithm for scheduling unitary tasks on m processors with communication delays, Internal Report LITP No. 12, Unìversité P. et M. Curie, Paris, France, 1995.
    • (1995) Internal Report LITP No. 12 , vol.12
    • Munier, A.1    Hanen, C.2
  • 5
    • 0025418536 scopus 로고
    • Towards an architecture independent analysis of parallel algorithms
    • C. Papadimitriou and M. Yannakakis, Towards an architecture independent analysis of parallel algorithms, SIAM J. Comput. 19 (1990) 322-328.
    • (1990) SIAM J. Comput. , vol.19 , pp. 322-328
    • Papadimitriou, C.1    Yannakakis, M.2
  • 6
    • 0005029748 scopus 로고
    • Two new NP-complete scheduling problems with communication delays and unlimited number of processors
    • C. Picouleau, Two new NP-complete scheduling problems with communication delays and unlimited number of processors, Discrete Appl. Math. 60 (1995) 331-342.
    • (1995) Discrete Appl. Math. , vol.60 , pp. 331-342
    • Picouleau, C.1
  • 7
    • 0023476962 scopus 로고
    • UET scheduling with unit interprocessor communication delays
    • V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays. Discrete Appl. Math. 18 (1987) 55-71.
    • (1987) Discrete Appl. Math. , vol.18 , pp. 55-71
    • Rayward-Smith, V.J.1
  • 8
    • 0003446257 scopus 로고
    • Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands
    • B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1993.
    • (1993) Multiprocessor Scheduling with Communication Delays
    • Veltman, B.1
  • 9
    • 0025673181 scopus 로고
    • Multiprocessor scheduling with communication delays
    • B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comput. 16 (1990) 173-182.
    • (1990) Parallel Comput. , vol.16 , pp. 173-182
    • Veltman, B.1    Lageweg, B.J.2    Lenstra, J.K.3

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