Abstract
We present deterministic upper and lower bounds on the slowdown required to simulate an (n,m)-PRAM on a variety of networks. The upper bounds are based on a novel scheme that exploits the splitting and combining of messages. Such a scheme can be implemented on an n-node d-dimensional mesh, with d constant, and on an n-leaf pruned butterfly, attaining the best worst-case slowdowns to date for such interconnections. Moreover, the one for the pruned butterfly is the first PRAM simulation scheme on an area-universal network. Finally, under the standard point-to-point assumption, we prove a bandwidth-based lower bound on the slowdown of any deterministic PRAM simulation on an arbitrary network, formulated in terms of its decomposition tree.
This research was supported, in part, by the ESPRIT III Basic Research Programme of the EC under contract No. 9072 (project GEPPCOM).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM Journal on Computing, 16(5):808–835, Oct 1987.
P. Bay and G. Bilardi. Deterministic on-line routing on area-universal networks. In Proceedings of the 31st Annual Symposium on Foundation of Computer Science, pages 297–306, 1990.
S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computers and System Sci., 28(2);300–343, Apr 1984.
G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, c-27(1):84–87, Jan 1978.
K. T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM Journal on Computing, 23(2):276–292, Apr 1994.
K.T. Herley. Representing shared data on distributed-memory parallel computers. Mathematical Systems Theory, 1995. To appear.
M. Kaufmann, J. F. Sibeyn and T. Suel. Derandomizing Algorithms for Routing and Sorting on Meshes. In Proceedings of 5th ACM-SIAM Symp. on Discrete Algorithms, pages 669–679, 1994.
A.R. Karlin and E. Upfal. Parallel hashing: An efficient implementation of shared memory. Journal of the ACM, 35(4):876–892, Oct 1988.
C. E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, c-34(10):892–900, Oct 1985.
A. Pietracaprina, G. Pucci. Work-Efficient Deterministic PRAM Simulations are Impossible. GEPPCOM Report 17–94. Dipartimento di Elettronica e Informatica, Università di Padova, Italy, Oct 1994.
A. Pietracaprina, G. Pucci, and J. F. Sibeyn. Constructive deterministic PRAM simulations on a mesh-connected computer. In Proceedings of 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 248–256, Jun 1994.
A. Pietracaprina, G. Pucci. Improved deterministic PRAM simulation on the mesh. In Proceedings of 22nd International Colloquium on Automata, Languages and Programming, Jul 1995. To appear.
D. Peleg and E. Upfal. The token distribution problem. SIAM Journal on Computing, 18(2):229–243, Apr 1989.
E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34(1):116–127, Jan 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herley, K.T., Pietracaprina, A., Pucci, G. (1995). Implementing shared memory on multi-dimensional meshes and on the fat-tree. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_134
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive