Improved algorithms for mapping pipelined and parallel computations
- 1 March 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (3) , 295-306
- https://doi.org/10.1109/12.76406
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Partitioning problems in parallel, pipeline, and distributed computingIEEE Transactions on Computers, 1988
- Optimal Parallel Sorting Scheme by Order StatisticsSIAM Journal on Computing, 1987
- Nearest-Neighbor Mapping of Finite Element Graphs onto Processor MeshesIEEE Transactions on Computers, 1987
- Sorting in parallel by double distributive partitioningBIT Numerical Mathematics, 1987
- Stencils and Problem Partitionings: Their Influence on the Performance of Multiple Processor SystemsIEEE Transactions on Computers, 1987
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- Reduction of the Effects of the Communication Delays in Scientific Algorithms on Message Passing MIMD ArchitecturesSIAM Journal on Scientific and Statistical Computing, 1987
- Allocating programs containing branches and loops within a multiple processor systemIEEE Transactions on Software Engineering, 1986
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977