Christos Kaklamanis and Danny Krizanc. Multipacket Hot-Potato Routing on Processor Arrays. In Second International Euro-Par Conference, Volume I, number 1123 in LNCS, pages 270--277, Lyon, France, August 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Communication Performance of Wormhole Interconnection Networks - Petrini (1997) (Correct)
....node does not correspond high network throughput. As outlined above, these results do not overlap with previous results in the literature [61] so will not consider the Chaos routing in the following experimental results. We think that, even if non minimal routing has nice theoretical properties [85], it is very sensitive to the communication pattern and packet size and it is not very robust in practice. A more detailed discussion on minimal and non minimal adaptive routing algorithms can be found in [123] 6.4.5 Network Performance with Deterministic and Adaptive Routing We can now compare ....
Christos Kaklamanis and Danny Krizanc. Multipacket Hot-Potato Routing on Processor Arrays. In Second International Euro-Par Conference, Volume I, number 1123 in LNCS, pages 270--277, Lyon, France, August 1996.
Randomized Algorithms on the Mesh - Narayanan (1998) (1 citation) (Correct)
No context found.
C. Kaklamanis and D. Krizanc. Multipacket hot-potato routing on processor arrays. In Euro-Par, pages 270#277, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC