Abstract
This paper describes an improved scheme for PRAM simulation on the mesh. The simulation algorithm achieves nearly optimal slowdown by means of a hierarchical distribution technique, which provides a powerful mechanism to control network congestion. The results in this paper improve upon previous works in many directions. Specifically, the scheme requires less powerful expanding graphs and can be made fully constructive for a wide range of memory sizes, with better slowdown than previous constructive schemes.
This research was supported, in part, by MURST of Italy and 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.
Preview
Unable to display preview. Download preview PDF.
References
H. Alt, T. Hagerup, K. Mehlhom, and F.P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SI AM Journal on Computing, 16(5):808–835, 1987.
M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York NY, second edition, 1986.
K. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM Journal on Computing, 23(2):276–292, April 1994.
F.T. Leighton, B. Maggs, A. Ranade, and S. Rao. Randomized routing and sorting on fixed-connection networks. Journal of Algorithms, April 1994.
F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5(4):529–544, 1990.
K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339–374, 1984.
A. Pietracaprina and F.P. Preparata. An O(√n)-worst-case-time solution to the granularity problem. In K.W. Wagner P. Enjalbert, A. Finkel, editor, Proc. 10th Symp. on Theoretical Aspects of Computer Science, LNCS 665, pages 110–119, Würzburg, Germany, February 1993. Springer-Verlag.
A. Pietracaprina and F.P. Preparata. A practical constructive scheme for deterministic shared-memory access. In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 100–109, 1993.
A. Pietracaprina and G. Pucci. Improved deterministic PRAM simulation on the mesh. Technical Report GEPPCOM-16, DEI Universitá di Padova, Padova, Italy, September 1994.
A. Pietracaprina and G. Pucci. Tight bounds on deterministic PRAM emulations with constant redundancy. In J.V. Leeuwen, editor, Proc. 2nd European Symposium on Algorithms, LNCS 855, pages 319–400, Utrecht, NL, September 1994. Springer-Verlag.
A. Pietracaprina, G. Pucci, and J. Sibeyn. Constructive deterministic PRAM simulation on a mesh-connected computer. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 248–256, Cape May, NJ, June 1994.
A.G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307–326, 1991. See also 28th IEEE FOCS (1987).
J.F. Sibeyn and M. Kaufmann. Deterministic 1-k routing on meshes, with application to hot-potato worm-hole routing. In Proc. of the 11th Symp. on Theoretical Aspects of Computer Science, LNCS 775, pages 237–248, 1994.
E. Upfal and A. Widgerson. How to share memory in a distributed system. Journal of the ACM, 34(1):116–127, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pietracaprina, A., Pucci, G. (1995). Improved deterministic PRAM simulation on the mesh. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_89
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive