Abstract
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 chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a virtual chatting schedule, 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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S.N. Bhatt, G. Bilardi, G. Pucci, A. Ranade, A.L. Rosenberg, E.J. Schwabe (1993): On Bufferless Routing on Variable-Length Messages in Leveled Networks. Tech. Rep., University of Massachusetts, Amherst, MA.
S.N. Bhatt, G. Pucci, A. Ranade, A.L. Rosenberg (1992): Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Comput., to appear. See also Advanced Research in VLSI and Parallel Systems 1992 (T. Knight and J. Savage, eds.) 318–332.
A. Borodin and J.E. Hopcroft (1985): Routing, merging, and sorting on parallel models of computation. J. Comp. Syst. Sci. 30, 130–145.
W.J. Dally and C.L. Seitz (1987): Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comp., C-36, 547–553.
G. Doenhardt and T. Lengauer: Algorithmic Aspects of One-Dimensional Layout Compaction. IEEE Trans. Comp. Aided Design.
U. Feige and P. Raghavan (1992): Exact analysis of hot-potato routing. 33rd IEEE Symp. on Foundations of Computer Science, 553–562.
S. Felperin, P. Raghavan, E. Upfal (1992): A theory of wormhole routing in parallel computers. 33rd IEEE Symp. on Foundations of Computer Science, 563–572.
H.A. Kierstead (1988): The linearity of first-fit coloring of interval graphs. SIAM J. Discr. Math. 1, 526–530.
H.A. Kierstead (1991): A polynomial time approximation algorithm for Dynamic Storage Allocation. Discr. Math. 88, 231–237.
G. Kortsarz and D. Peleg (1992): Approximation algorithms for minimum time broadcast. Theory of Computing and Systems (ISTCS '92). Lecture Notes in Computer Science 601, Springer-Verlag, N.Y., pp. 67–78.
D.H. Lawrie and D.A. Padua (1984): Analysis of message switching with shuffle-exchanges in multiprocessors. In Interconnection Networks, IEEE Computer Soc. Press, N.Y.
D.H. Linder and J.C. Harden (1991): An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. Comp. 40, 2–12.
D. Peleg and J.D. Ullman (1989): An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 740–747.
L.G. Valiant (1981): Universality considerations in VLSI circuits. IEEE Trans. Comp., C-30, 135–140.
L.G. Valiant (1982): A scheme for fast parallel communication. SIAM J. Comput. 11, 350–361.
L.G. Valiant (1989): Bulk-synchronous parallel computers. In Parallel Processing and Artificial Intelligence (M. Reeve and S.E. Zenith, eds.) Wiley, N. Y., pp. 15–22.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhatt, S.N., Bilardi, G., Pucci, G., Ranade, A., Rosenberg, A.L., Schwabe, E.J. (1993). On bufferless routing of variable-length messages in leveled networks. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_43
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive