Abstract
We address the problem of organizing a set T of shared data into the memory modules of a Distributed Memory Machine (DMM) in order to minimize memory access conflicts during read operations. In this paper we present a new randomized scheme that, with high probability, performs any set of r unrelated read operations on the shared data set T in O(log r + log log|T|) parallel time with no memory conflicts and using O(r) processors. The set T is distributed into m DMM memory modules where m is polynomial in r and logarithmic in T, and the overall size of the shared memory used by our scheme is not larger than (1 + 1/ log |T|)|T|(this means that there is “almost” no data replication). The memory organization scheme and most part of all the computations of our method do not depend on the read requests, so they can be performed once and for all during an off-line phase. This is a relevant improvement over the previous deterministic method recently given in [1] when “real-time” applications are considered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim(1996), On the parallel computation of Boolean functions on unrelated inputs. Proc. of the IV IEEE Israel Symposium on Theory of Computing and Systems (ISTCS’96), IEEE, pp. 155–161.
Chin F. (1986), Security Problems on Inference Control for SUM, MAX and MIN Queries. J. of ACM, 33(3), pp. 451–464.
Chor B., and Gilboa N. (1997), Computationally Private Information Retrieval. Proc. of ACM STOC, p. 304–313.
Chor B., Goldreich O., Kushilevitz E., and Sudan M. (1995), Private Information Retrieval. Proc of IEEE FOCS, pp. 41–50.
Dobkin D., Jones A. K., Lipton R.J. (1979), Secure Databases: Protection Against User Influence, ACM Trans. on Database Systems, 4(1), pp. 97–106.
Gertner Y., Goldwasser S., and Malkin T. (1998), A Random Server Model for Private Information Retrieval. Technical Report MIT-LCS-TR-715. To appear on Proc. RANDOM’ 98
Gertner Y., Ishai Y., Kushilevitz E., and Malkin T. (1998), Protecting Data Privacy in Private Information Retrieval Schemes. Proc. of ACM STOC.
Karp R. M., Luby M., and Meyer auf der Heide F. (1996), Efficient PRAM Simulation on a Distributed Memory Machine. Algoritmica, 16, pp. 517–542(Extended Abstract in A CM STOC 1992).
Karlin A. and Upfal E. (1986), Parallel hashing-an efficient implementation of shared memory. Proc. of ACM STOC, 160–168.
Kruskal C.P., Rudolph L., and Snir M. (1990), A Complexity Theory of Efficient Parallel Algorithms. Theoret. Comput. Sci, 71, p. 95–132.
Kumar V., Grama A., Gupta A., and Karypis G. (1995), Introduction to Parallel Computing. Benjamin/Cummings Publ. Company.
T. Leighton(1992), Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, san Mateo,CA.
Liu Z., Li X., and You J. (1992), On storage schemes for parallel array access. Proc. ACMICS, pp. 282–291.
Mehlhorn K. and Vishkin U. (1984), Randomized and Deterministic Simulation of PRAM by Parallel Machines with Restricted Granularity of Parallel Memories. ACTA Informatica, 21, pp. 339–374.
Pietracaprina A., and F. P. Preparata (1993), A Practical Constructive Scheme for Deterministic Shared-Memory Access. Proc of ACM SPAA, p. 100–109.
Pluris Inc. (1998), Pluris Massively Parallel Routing. Technical Report available at http://www.pluris.com/wp/index.html.
Pluris Inc. (1998), Parallel Routing, Technical report available at http://www.pluris.com.
Tannenbaum A. (1994), Computer Networks. Prenctice Hall, III Edition.
Ullman J.D. (1982) Principles of Database Systems. II edition.
Upfal E. (1984), Efficient Schemes for Parallel Communication. J. of the ACM, 31(3), pp. 507–517.
Upfal E. and Wigderson A. (1987), How to share memory in a distributed system, J. of the ACM, 34, pp. 116–127.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, A.E., Clementi, A.E.F., Penna, P., Rolim, J.D.P. (1999). Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive