메뉴 건너뛰기




Volumn 24, Issue 11, 1998, Pages 1653-1664

Optimal schedules for d-D grid graphs with communication delays

Author keywords

Communication; DAGs; Grids; Scheduling

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

EID: 0032182285     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(98)00047-7     Document Type: Article
Times cited : (5)

References (22)
  • 3
    • 0040634183 scopus 로고
    • The time complexity of scheduling interval orders with communication is polynomial
    • H.H. Ali, H. El-Rewini, The time complexity of scheduling interval orders with communication is polynomial, Parallel Processing Letters 3 (1) (1993) 53-58.
    • (1993) Parallel Processing Letters , vol.3 , Issue.1 , pp. 53-58
    • Ali, H.H.1    El-Rewini, H.2
  • 6
    • 0003151227 scopus 로고
    • Scheduling with communication delays: A survey
    • P. Chretienne et al. (Eds.), Wiley, New York
    • P. Chrétienne, C. Picouleau, Scheduling with communication delays: A survey, in: P. Chretienne et al. (Eds.), Sheduling Theory and Its Applications, Wiley, New York, 1995.
    • (1995) Sheduling Theory and Its Applications
    • Chrétienne, P.1    Picouleau, C.2
  • 7
    • 0030212249 scopus 로고    scopus 로고
    • Optimal schedules for UET-UCT series parallel digraphs on two processors
    • L. Finta, Z. Liu, I. Milis, E. Bampis, Optimal schedules for UET-UCT series parallel digraphs on two processors, Theoretical Computer Science 162 (1996) 323-340.
    • (1996) Theoretical Computer Science , vol.162 , pp. 323-340
    • Finta, L.1    Liu, Z.2    Milis, I.3    Bampis, E.4
  • 11
    • 0028530486 scopus 로고
    • Three, four, five, six or the complexity of scheduling with communication delays
    • J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Three, four, five, six or the complexity of scheduling with communication delays, Operational Research Letters 16 (1994) 129-137.
    • (1994) Operational Research Letters , vol.16 , pp. 129-137
    • Hoogeveen, J.A.1    Lenstra, J.K.2    Veltman, B.3
  • 14
    • 0030363273 scopus 로고    scopus 로고
    • The complexity of scheduling trees with communication delays
    • J.K. Lenstra, M. Veldhorst, B. Veltman, The complexity of scheduling trees with communication delays, Journal of Algorithms 20 (1) (1996) 157-173.
    • (1996) Journal of Algorithms , vol.20 , Issue.1 , pp. 157-173
    • Lenstra, J.K.1    Veldhorst, M.2    Veltman, B.3
  • 16
    • 0025418536 scopus 로고
    • Towards an architecture-independent analysis of parallel algorithms
    • C. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM Journal of Computing 19 (2) (1990) 322-328.
    • (1990) SIAM Journal of Computing , vol.19 , Issue.2 , pp. 322-328
    • Papadimitriou, C.1    Yannakakis, M.2
  • 18
    • 0023476962 scopus 로고
    • UET scheduling with unit interprocessor communication delays
    • V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics 18 (1987) 55-71.
    • (1987) Discrete Applied Mathematics , vol.18 , pp. 55-71
    • Rayward-Smith, V.J.1


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