Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling

Journal of Parallel and Distributed Computing - Tập 16 - Trang 378-384 - 1992
Virginia M. Lo1
1Department of Computer Science, University of Oregon, Eugene, Oregon 97403-/202, USA

Tài liệu tham khảo

Berman, 1989, Prep-p: Evolution and overview Bokhari, 1987 Browne, 1986, Framework for fomulation and analysis of parallel computation structures, Parallel Comput., 3, 1, 10.1016/0167-8191(86)90002-5 El-rewini, 1990, Scheduling parallel program tasks onto arbitrary target machines, J. Parallel Distrib. Comput., 9, 138, 10.1016/0743-7315(90)90042-N Griswold, 1989 Hough, 1990, Perspective views: A technique for enhancing parallel program visualization, II Hough, 1990, Perspective views: A technique for enhancing parallel program visualization, 124 Lamport, 1978, Time, clocks, and the ordering of events in a distributed system, Comm. ACM, 21, 558, 10.1145/359545.359563 Lo, 1992, Temporal communication graphs: Lamport's process time graphs augmented for the purpose of mapping and scheduling, 10.1016/0743-7315(92)90020-N Lo, 1991, OREGAMI: Tools for mapping parallel algorithms to parallel architectures, Internat. J. Parallel Programming, 20, 10.1007/BF01379319 Lo, 1990, LaRCS: A language for describing parallel computations for the purpose of mapping Sadayappan, 1990, Clustering partitioning approaches to mapping parallel programs onto a hypercube, Parallel Comput., 13, 1, 10.1016/0167-8191(90)90115-P Sakar, 1987, Partitioning and scheduling parallel programs for execution on multiprocessors. Technical report Stone, 1977, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Engrg., SE-3, 85, 10.1109/TSE.1977.233840