Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
- 1 December 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 16 (4) , 378-384
- https://doi.org/10.1016/0743-7315(92)90020-n
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and schedulingJournal of Parallel and Distributed Computing, 1992
- OREGAMI: Tools for mapping parallel computations to parallel architecturesInternational Journal of Parallel Programming, 1991
- Scheduling parallel program tasks onto arbitrary target machinesJournal of Parallel and Distributed Computing, 1990
- Cluster partitioning approaches to mapping parallel programs onto a hypercubeParallel Computing, 1990
- Framework for formulation and analysis of parallel computation structuresParallel Computing, 1986
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977