Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines
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  when “real-time” applications are considered.
KeywordsBoolean Function Shared Memory Memory Module Parallel Time Read Request
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 3.Chor B., and Gilboa N. (1997), Computationally Private Information Retrieval. Proc. of ACM STOC, p. 304–313.Google Scholar
- 4.Chor B., Goldreich O., Kushilevitz E., and Sudan M. (1995), Private Information Retrieval. Proc of IEEE FOCS, pp. 41–50.Google Scholar
- 6.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 Google Scholar
- 7.Gertner Y., Ishai Y., Kushilevitz E., and Malkin T. (1998), Protecting Data Privacy in Private Information Retrieval Schemes. Proc. of ACM STOC.Google Scholar
- 9.Karlin A. and Upfal E. (1986), Parallel hashing-an efficient implementation of shared memory. Proc. of ACM STOC, 160–168.Google Scholar
- 10.Kruskal C.P., Rudolph L., and Snir M. (1990), A Complexity Theory of Efficient Parallel Algorithms. Theoret. Comput. Sci, 71, p. 95–132.Google Scholar
- 11.Kumar V., Grama A., Gupta A., and Karypis G. (1995), Introduction to Parallel Computing. Benjamin/Cummings Publ. Company.Google Scholar
- 12.T. Leighton(1992), Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, san Mateo,CA.Google Scholar
- 13.Liu Z., Li X., and You J. (1992), On storage schemes for parallel array access. Proc. ACMICS, pp. 282–291.Google Scholar
- 15.Pietracaprina A., and F. P. Preparata (1993), A Practical Constructive Scheme for Deterministic Shared-Memory Access. Proc of ACM SPAA, p. 100–109.Google Scholar
- 16.Pluris Inc. (1998), Pluris Massively Parallel Routing. Technical Report available at http://www.pluris.com/wp/index.html.
- 17.Pluris Inc. (1998), Parallel Routing, Technical report available at http://www.pluris.com.
- 18.Tannenbaum A. (1994), Computer Networks. Prenctice Hall, III Edition.Google Scholar
- 19.Ullman J.D. (1982) Principles of Database Systems. II edition.Google Scholar