메뉴 건너뛰기




Volumn 7, Issue 1, 1996, Pages 46-55

Task clustering and scheduling for distributed memory parallel architectures

Author keywords

Approximation algorithms; Distributed memory architectures; Program task graph; Task granularity; Task scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; COMPUTER SYSTEMS PROGRAMMING; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; SCHEDULING;

EID: 0029770359     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.481597     Document Type: Article
Times cited : (160)

References (19)
  • 2
    • 0024920989 scopus 로고
    • The last algorithm: A heuristic-based static allocation algorithm
    • J. Baxter and J.H. Patel, "The last algorithm: A heuristic-based static allocation algorithm," Proc. 1989 Int'l Conf. on Parallel Processing, vol. 2, pp. 217-222, 1989.
    • (1989) Proc. 1989 Int'l Conf. on Parallel Processing , vol.2 , pp. 217-222
    • Baxter, J.1    Patel, J.H.2
  • 4
    • 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," Proc. Supercomputing '92, pp. 512-521, 1992.
    • (1992) Proc. Supercomputing '92 , pp. 512-521
    • Chung, Y.-C.1    Ranka, S.2
  • 6
    • 0002770375 scopus 로고
    • Network and processor architecture for message-driven computer
    • R. Suaya and G. Birtwistle, eds., San Mateo, Calif.: Morgan Kaufmann
    • W. Dally, "Network and processor architecture for message-driven computer," R. Suaya and G. Birtwistle, eds., VLSI and Parallel Computation. San Mateo, Calif.: Morgan Kaufmann, pp. 140-218, 1990.
    • (1990) VLSI and Parallel Computation , pp. 140-218
    • Dally, W.1
  • 7
    • 0027606922 scopus 로고
    • On the granularity and clustering of directed acyclic task graphs
    • June
    • A. Gerasoulis and T. Yang, "On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686-701, June 1993.
    • (1993) IEEE Transactions on Parallel and Distributed Systems , vol.4 , Issue.6 , pp. 686-701
    • Gerasoulis, A.1    Yang, T.2
  • 8
    • 0024647955 scopus 로고
    • Scheduling precedence graphs in systems with interprocessor communication times
    • Apr.
    • J.J. Hwang, Y.C. Chow, F.D. Anger, and C.Y. Lee, "Scheduling precedence graphs in systems with interprocessor communication times," SIAM J. Computing, vol. 18, no. 2, pp. 244-257, Apr. 1989.
    • (1989) SIAM J. Computing , vol.18 , Issue.2 , pp. 244-257
    • Hwang, J.J.1    Chow, Y.C.2    Anger, F.D.3    Lee, C.Y.4
  • 9
    • 0024126036 scopus 로고
    • A general approach to mapping of parallel computation upon multiprocessor architectures
    • S. Kim and J.C. Browne, "A general approach to mapping of parallel computation upon multiprocessor architectures," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 1-8, 1988.
    • (1988) Proc. Int'l Conf. Parallel Processing , vol.3 , pp. 1-8
    • Kim, S.1    Browne, J.C.2
  • 10
    • 0023866688 scopus 로고
    • Grain size determination for parallel processing
    • Jan.
    • B. Kruatrachue and T. Lewis, "Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
    • (1988) IEEE Software , pp. 23-32
    • Kruatrachue, B.1    Lewis, T.2
  • 11
    • 0024034138 scopus 로고
    • Multiprocessor scheduling with interprocessor communication delays
    • C.Y. Lee, J.J. Hwang, Y.C. Chow, and F.D. Anger, "Multiprocessor scheduling with interprocessor communication delays," Oper. Res. Lett., vol. 7, no. 3, pp. 141-147, 1988.
    • (1988) Oper. Res. Lett. , vol.7 , Issue.3 , pp. 141-147
    • Lee, C.Y.1    Hwang, J.J.2    Chow, Y.C.3    Anger, F.D.4
  • 13
    • 0024732926 scopus 로고
    • Automatic determination of grain size for efficient parallel processing
    • Sept.
    • C. McCreary and H. Gill, "Automatic determination of grain size for efficient parallel processing," Comm. ACM, pp. 1,073-1,078, Sept. 1989.
    • (1989) Comm. ACM
    • McCreary, C.1    Gill, H.2
  • 15
    • 0025418536 scopus 로고
    • Towards an architecture-independent analysis of parallel algorithms
    • Apr.
    • C.H. Papadimitriou and M. Yannakakis, "Towards an architecture-independent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322-328, Apr. 1990.
    • (1990) SIAM J. Computing , vol.19 , Issue.2 , pp. 322-328
    • Papadimitriou, C.H.1    Yannakakis, M.2
  • 16
    • 0025440941 scopus 로고
    • Scheduling parallel program tasks onto arbitrary target machines
    • H.E. Rewini and T.G. Lewis, "Scheduling parallel program tasks onto arbitrary target machines," J. Parallel and Distributed Computing, vol. 9, pp. 138-153, 1990.
    • (1990) J. Parallel and Distributed Computing , vol.9 , pp. 138-153
    • Rewini, H.E.1    Lewis, T.G.2


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