Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks

@article{Li2003ParallelPO,
  title={Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks},
  author={Keqin Li},
  journal={Cluster Computing},
  year={2003},
  volume={6},
  pages={47-55}
}
We analyze the parallel time and speedup for processing a divisible load on (1) a linear array with a corner initial processor; (2) a linear array with an interior initial processor; (3) a mesh with a corner initial processor; (4) a mesh with an interior initial processor; (5) a b-ary complete tree with the root as the initial processor; (6) a pyramid with the apex as the initial processor. Due to communication overhead and limited network connectivity, the speedup of parallel processing for a… CONTINUE READING
13 Citations
17 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Scheduling Data Intensive Parallel Processing in Distributed and Networked Environments

  • K. Ko
  • Ph.D. dissertation Department of Electrical and…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…