Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks

@article{Ramanujam2012RandomizedPR,
  title={Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks},
  author={Rohit Sunkam Ramanujam and Bill Lin},
  journal={IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
  year={2012},
  volume={20},
  pages={2080-2093}
}
The increasing viability of 3-D silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extension of 2-D mesh-based tiled chip-multiprocessor architectures into three dimensions. This paper focuses on efficient routing algorithms for such 3-D mesh networks. Existing routing algorithms suffer from either poor worst-case throughput (DOR, ROMM) or poor latency (VAL). Although the minimal routing algorithm O1TURN proposed in already… CONTINUE READING
3 Citations
22 References
Similar Papers

References

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

Principles and Practices of Interconnection Networks

  • W. J. Dally, B. Towles
  • 2004
Highly Influential
3 Excerpts

Tile processor: Embedded multicore for networking and multimedia

  • A. Agarwal, L. Bao, +5 authors D. Wentzlaff
  • presented at the Hot Chips’19, Stanford, CA, 2007…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…