Improved algorithms for partitioning tree and linear task graphs on shared memory architecture

  title={Improved algorithms for partitioning tree and linear task graphs on shared memory architecture},
  author={S. Ray and H. Jiang},
  journal={14th International Conference on Distributed Computing Systems},
  • S. Ray, H. Jiang
  • Published 1994
  • Computer Science
  • 14th International Conference on Distributed Computing Systems
In parallel and distributed computing, the overall system performance is significantly influenced by how a task graph representing an application is mapped onto a specific multiprocessor topology. In this paper, algorithms with improved performance are proposed to map tree and linear task graphs onto shared memory multiprocessing architectures. Specifically, the task graphs are partitioned with our algorithms so that the load is balanced, processor utilisation is maximized, and the… Expand
Sequential and Parallel Algorithms for Partitioning Tree Task Graphs on Shared Memory Architecture
  • S. Ray, H. Jiang
  • Computer Science
  • 1994 International Conference on Parallel Processing Vol. 3
  • 1994
Optimized on-chip pipelining of memory-intensive computations on the cell BE


Improved Algorithms for Mapping Pipelined and Parallel Computations
Partitioning Problems in Parallel, Pipelined, and Distributed Computing
  • S. Bokhari
  • Computer Science
  • IEEE Trans. Computers
  • 1988
A Linear-Time Heuristic for Improving Network Partitions
An algorithm for partitioning the nodes of a graph
  • E. Barnes
  • Mathematics
  • 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes
  • 1981
Distributed discrete-event simulation
Improved Algorithms for Ma in Pipelined and Parallel Com - utations ” IEI ! ?
  • Distributed Discrete - Event Simulation ” , A C M Computing Surveys
  • 1992
A New procedure for Partitionin the Nodes of a Graph
  • Working Report No. 822,
  • 1985
Computational Com - lexity of Weighted Integrity ”