The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call <it>chatting</it>, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on <it>oblivious</it> routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a <it>virtual chatting schedule</it>, and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies for producing efficient virtual chatting schedules on a variety of network topologies.</p>
Processor networks, interprocessor communication, message scheduling, routing algorithms, all-to-all communication, high-level communication primitives.

G. Pucci, A. Ranade, G. Bilardi, S. N. Bhatt, A. L. Rosenberg and E. J. Schwabe, "On Bufferless Routing of Variable Length Messages in Leveled Networks," in IEEE Transactions on Computers, vol. 45, no. , pp. 714-729, 1996.
80 ms
(Ver 3.3 (11022016))