Abstract
The problem of representing a setU≜{u 1,...,u m} of read-write variables on ann-node distributed-memory parallel computer is considered. It is shown thatU can be represented among then nodes of a variant of the mesh of trees usingO((m/n) polylog(m/n)) storage per node such that anyn-tuple of variables may be accessed inO(logn (log logn)2) time in the worst case form polynomial inn.
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, November 1987.
M. Ajtai, J. Komlós, and E. Szemerédi. AnO(n logn) sorting network.Proceedings of the 15thAnnual Symposium on the Theory of Computing, Boston, Massachusetts, pages 1–9, April 1983. See alsoCombinatorica 3(1):1–19, 1983.
G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers.IEEE Transactions on Computers, 27(1):84–87, January 1978.
M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table withO(1) worst case access time.Journal of the ACM, 31(3):538–544, July 1984.
T. Hagerup. A lower bound for the emulation of PRAM memories on processor networks. Technical Report 13/1990, Fachbereich 14, Informatik, Universität des Saarlandes, June 1990.
K. T. Herley. Efficient simulations of small shared memories on bounded-degree networks.Proceedings of the 30thAnnual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, pages 390–395, October 1989.
K. T. Herley. Space-efficient representations of shared data for parallel computers.Proceedings of the 2ndAnnual ACM Symposium on Parallel Algorithms and Architectures, Crete, pages 407–416, July 1990.
K. T. Herley. Improved bounds for the token distribution problem.Information Processing Letters, 38:329–334, June 1991.
K. T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks.SIAM Journal on Computing, 23(2):276–292, April 1994.
T. Hagerup, K. Mehlhorn, and B. Parker. Unpublished notes communicated by K. Mehlhorn.
S. W. Hornick and F. P. Preparata. Deterministic PRAM simulations with constant redundancy.Proceedings of the 1989ACM Symposium on Parallel Algorithms and Architectures, Sante Fe, New Mexico, pages 103–109, June 1989.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. InHandbook of Theoretical Computer Science, J. van Leeuwen, editor, pages 869–941. North-Holland, Amsterdam, 1990.
C. P. Kruskal, L. Rudolph, and M. Snir. The power of parallel prefix.IEEE Transactions on Computers, 34(10):965–968, October 1985.
A. R. Karlin and E. Upfal. Parallel hashing: an efficient implementation of shared memory.Journal of the ACM, 35(4):876–892, October 1988.
F. T. Leighton. New lower bound techniques for VLSI.Mathematical Systems Theory, 17:47–70, 1984.
F. T. Leighton. Tight bounds on the complexity of parallel sorting.IEEE Transactions on Computers, 34(4):344–354, April 1985.
F. Luccio, A. Pietracaprina, and G. Pucci. A probabilistic simulation of PRAMs on a bounded degree network.Information Processing Letters, 28(3):141–147, July 1988.
F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI.Algorithmica, 5:529–544, 1990.
F. Meyer auf der Heide. Efficient simulations among several models of parallel computers.SIAM Journal on Computing, 15(1):106–119, February 1986.
K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories.Acta Informatica, 21(4):339–374, November 1984.
D. D. Nath, S. N. Maheshwari, and P. C. P. Bhatt. Efficient VLSI networks for parallel processing based on orthogonal trees.IEEE Transactions on Computers, 32(6):569–581, June 1983.
D. Peleg and E. Upfal. The generalized packet routing problem.Theoretical Computer Science, 53:569–581, June 1987.
D. Peleg and E. Upfal. The token distribution problem.SIAM Journal on Computing, 18(2):229–243, April 1989.
A. G. Ranade. How to emulate shared memory.Journal of Computer and System Sciences, 42:307–326, 1991.
J. D. Ullman.Computational Aspects of VLSI. Computer Science Press, Rockville, Maryland, 1983.
E. Upfal. A probabilistic relation between desirable and feasible models of parallel computation.Proceedings of the 16thAnnual ACM Symposium on the Theory of Computing, Washington, DC, pages 258–265, May 1984.
E. Upfal and A. Wigderson. How to share memory in a distributed system.Journal of the ACM, 34(1):116–127, January 1987.
Author information
Authors and Affiliations
Additional information
This work was supported in part by the Joint Services Electronics Program under Contract F49620-87-C-0044 and by IBM under Agreement 12060043. Earlier versions of these results appeared in theProceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, October 1989 and in theProceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, July 1990.
Rights and permissions
About this article
Cite this article
Herley, K.T. Representing shared data on distributed-memory parallel computers. Math. Systems Theory 29, 111–156 (1996). https://doi.org/10.1007/BF01305311
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01305311