This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
N. Pippenger, IBM Research Laboratory
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.
Citation:
N. Pippenger, "Parallel Communication With Limited Buffers," focs, pp.127-136, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.