Many-to-one packet routing on the mesh

Authors:
Fillia Makedon;Adonios Simvonis
Affiliations:
Computer Science Program, University of Texas at Dallas, P.O. box 830688, MP 3.1, Richardson, TX;Computer Science Program, University of Texas at Dallas, P.O. box 830688, MP 3.1, Richardson, TX
Venue:
CSC '91 Proceedings of the 19th annual conference on Computer Science
Year:
1991

Citing 4
Cited 1

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal routing algorithms for mesh-connected processor arrays (extended abstract)

VLSI Algorithms and Architectures
Routing and sorting on mesh-connected arrays (extended abstract)

VLSI Algorithms and Architectures
A 2n-2 step algorithm for routing in an nxn array with constant size queues

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

Efficient protection of many-to-one communications

EDCC'05 Proceedings of the 5th European conference on Dependable Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract