Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

@article{Makedon1993OptimalAF,
  title={Optimal algorithms for the many-to-one routing problem on two-dimensional meshes},
  author={Fillia Makedon and Antonios Symvonis},
  journal={Microprocessors and Microsystems - Embedded Hardware Design},
  year={1993},
  volume={17},
  pages={361-367}
}
In this paper, we consider the many-to-one packet routing problem on the mesh parallel architecture. This problem has not been considered before. It models the communication pattern that occurs when many processors try to write on the same memory location on a Concurrent Read Concurrent Write Shared Memory parallel machine. We prove that there is an… CONTINUE READING