Martin Dietzfelbinger
Friedhelm Meyer auf der Heide
- 1.R. J. Anderson, G. L. Miller. Optical communication for pointer based algorithms. Tech. Rep. CRI 88-14, Comp. Sci. Dept., Univ. of Southern California, Los Angeles, 1988.Google Scholar
- 2.H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. A CM Syrup. on Para//e/ Algorithms and Architectures, pp. 50-61, 1991. Google ScholarDigital Library
- 3.B. Bollob#s.Combinatorics. Cambridge University Press, 1986.Google Scholar
- 4.J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143-154, 1979.Google Scholar
- 5.M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proc. of the 29th IEEE Ann. Syrup. on Foundations of Computer Sdence, pp. 524-531, 1988. (Extended version appears in SIAM J. Comput.) Google ScholarDigital Library
- 6.M. Dietzfelbinger and F. Meyer auf der Heide. How to distribute a dictionary in a complete network. In Proc. of the 22nd Ann. ACM Syrup. on Theory of Computing, pp. 117-127, 1990. Google ScholarDigital Library
- 7.M. Dietzfelbinger and F. Meyer auf der Heide. Dynamic hashing in real time, in J. Buchmann, H. Ganzinger, W. J. Paul (Eds.): lnformatik. Festschrift zum 60. Geburt. stag yon Ganter Hotz, Teubner-Texte zur Informatik, Band 1, B. G. Teubner, 1992, pp. 95-119. (Revised Version of A new universal class of hash functions and dynamic hashing in real time. In M. S. Paterson, editor, Proceedings of 17th ICALP, pp. 6-19. Springer, 1990. Lecture Notes in Computer Science 443.) Google ScholarDigital Library
- 8.M. Ger#b-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proc. of the 4th Ann. A CM Syrup. on Parallel Algorithms and Architectures, pp. 41-48, 1992. Google ScholarDigital Library
- 9.T. Hagerup, C. Rfib. A guided tour of Chernoff bounds. Information Processing Letters, 33:305-308, 1989/90. Google ScholarDigital Library
- 10.A. Karlin and E. Upfal. Parallel hashing # an efficient implementation of shared memory. In Proc. o{ the 18th Ann. ACM Syrup. on Theory of Computing, pp. 160- 168, 1986. Google ScholarDigital Library
- 11.R. Karp, M. Luby, F. Meyer auf der Heide. Efficient PRAM simulation on distributed memory machine. In Proc. of the 24th Ann. ACM Syrup. on Theory of Computing, pp. 318-326, 1992. Google ScholarDigital Library
- 12.1#. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Ed., pp. 869-932, 1990. Google ScholarDigital Library
- 13.D. J. Kleitman. Families of non-disjoint subsets. J. Combinatorial Theory, 1:153-155, 1966.Google ScholarCross Ref
- 14.C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoret. Cornput. :#ci., 7"1:95-132, 1990. Google ScholarDigital Library
- 15.F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mate, o, 1992. Google ScholarDigital Library
- 16.F. T. Leighton. Methods for packet routing in parallel machines, in Proc. of the 24th Ann. ACM Syrup. on Theory of Computing, pp. 77-96, 1992. Google ScholarDigital Library
- 17.Y. Matias and U. Vishkin. Converting high probability into nearly-constant time- with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Syrup. on Theory of Computing, pp. 307-316, 1991. Google ScholarDigital Library
- 18.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. Google ScholarDigital Library
- 19.F. Meyer auf der Heide. Hashing strategies for simulating shared memory on distributed memory machines. in Proc. of the 1st Heinz Nixdorf Symposium #Para/- lei Architectures and their Efficient Use", Paderborn, Germany, November 1992, Springer LNCS, to appear. Google ScholarDigital Library
- 20.A. G. Ranade. How to emulate shared memory. J. Comput. Syst. Sci., 42:307-326, 1991. Google ScholarDigital Library
- 21.A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their apphcations. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pp. 20-25, 1989. (Revised Version).Google ScholarDigital Library
- 22.E. Upfal. Efficient schemes for parallel communication. 2. Assoc. Comput. Much., 31:507-517, 1984. Google ScholarDigital Library
- 23.E. Upfal, A. Wigderson. How to share memory in a distributed system. J. Assoc. Comput. Mach., 34:116- 12?, 1987. Google ScholarDigital Library
- 24.L. G. Valiant. General purpose parallel architectures. in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Ed., pp. 943-971, 1990. Google ScholarDigital Library
- 25.L. Valiant. A bridging model for parallel computation. Commun&#$ions of the ACM, 33(8):103-111, 1990. Google ScholarDigital Library
Index Terms
- Simple, efficient shared memory simulations
Recommendations
A durable and energy efficient main memory using phase change memory technology
ISCA '09: Proceedings of the 36th annual international symposium on Computer architectureUsing nonvolatile memories in memory hierarchy has been investigated to reduce its energy consumption because nonvolatile memories consume zero leakage power in memory cells. One of the difficulties is, however, that the endurance of most nonvolatile ...
Contention Resolution in Hashing Based Shared Memory Simulations
In this paper we study the problem of simulating shared memory on the distributed memory machine (DMM). Our approach uses multiple copies of shared memory cells, distributed among the memory modules of the DMM via universal hashing. The main aim is to ...
Shared memory multiplexing: a novel way to improve GPGPU throughput
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniquesOn-chip shared memory (a.k.a. local data share) is a critical resource to many GPGPU applications. In current GPUs, the shared memory is allocated when a thread block (also called a workgroup) is dispatched to a streaming multiprocessor (SM) and is ...
Comments