25th Annual Symposium onFoundations of Computer Science, 1984. (1984)

Singer Island, FL

Oct. 24, 1984 to Oct. 26, 1984

ISBN: 0-8186-0591-X

pp: 127-136

N. Pippenger , IBM Research Laboratory

ABSTRACT

Currently known parallel communication schemes allow n nodes interconnected by arcs (in such a way that each node meets only a fixed number of arcs) to transmit n packets according to an arbitrary permutation in such a way that (1) only one packet is sent over a given arc at any step, (2) at most 0(log n) packets reside at a given node at any time and (3) with high probability, each packet arrives at its destination within 0(log n) steps. We present and analyze a new parallel communication scheme that ensures that at most a fixed number of packets reside at a given node at any time.

INDEX TERMS

CITATION

N. Pippenger, "Parallel Communication With Limited Buffers,"

*25th Annual Symposium onFoundations of Computer Science, 1984.(FOCS)*, Singer Island, FL, 1984, pp. 127-136.

doi:10.1109/SFCS.1984.715909

CITATIONS

SEARCH