A practical constructive scheme for deterministic shared-memory access

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A practical constructive scheme for deterministic shared-memory access

Full text

Pdf (821 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents

Velen, Germany

Pages: 100 - 109

Year of Publication: 1993

ISBN:0-89791-599-2

Authors

A. Pietracaprina
F. P. Preparata

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165245 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AHMP87	Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Perparata, Deterministic simulation of idealized parallel computers on more realistic ones, SIAM Journal on Computing, v.16 n.5, p.808-835, Oct. 1987 [doi>10.1137/0216053]
	AS90	Y. Aumann and A. Schuster. Improved memory utilization in deterministic PRAM simulations. Manuscript, 1990.
	Gor68	D. Gorenstein. Finite Groups. Harper and Row, New York NY, 1968.
	HB88	K.T. tterley and G. Bilardi. Deterministic simulations of PRAMs on bounded degree networks. Proc. of the P6lh Annual Allerton Conference on Communication, Control and Computation, pages 1084-1093, 1988.
	Her89	K.T. Herley. Efficient simulations of small shared memories on bounded degree networks. Proc. of the 30th IEEE Symp. on Foundations of Comp. Sc., pages 390-395, 1989.
	Her90	K. Herley, Space-efficient representations of shared data for parallel computers, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.407-416, July 02-06, 1990, Island of Crete, Greece [doi>10.1145/97444.97708]
	KLM92	Richard M. Karp , Michael Luby , Friedhelm Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.318-326, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129743]
	KU88	Anna R. Karlin , Eli Upfal, Parallel hashing: an efficient implementation of shared memory, Journal of the ACM (JACM), v.35 n.4, p.876-892, Oct. 1988 [doi>10.1145/48014.350550]
	Kuc77	David J. Kuck, A Survey of Parallel Machine Organization and Programming, ACM Computing Surveys (CSUR), v.9 n.1, p.29-59, March 1977 [doi>10.1145/356683.356686]
	LPP88	Fabrizio Luccio , G. Pucci , I. Pietracaprina, A probabilistic simulation of PRAMs on a bounded degree network, Information Processing Letters, v.28 n.3, p.141-147, July 4, 1988 [doi>10.1016/0020-0190(88)90160-3]
	LPP90	F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5:529-544, 1990.
	Mey92	Friedhelm Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines, Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use, p.20-29, November 11-13, 1992
	Mor91	Moshe Morgenstern, Explicit construction of natural bounded concentrators, Proceedings of the 32nd annual symposium on Foundations of computer science, p.392-397, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185396]
	MV84	Kurt Mehlhorn , Uzi Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Informatica, v.21 n.4, p.339-374, Nov. 1984
	PP93	Andrea Pietracaprina , Franco P. Preparata, On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, p.110-119, February 25-27, 1993
	Ran91	Abhiram G. Ranade, How to emulate shared memory, Journal of Computer and System Sciences, v.42 n.3, p.307-326, June 1991 [doi>10.1016/0022-0000(91)90005-P]
	Tho79	Robert H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems (TODS), v.4 n.2, p.180-209, June 1979 [doi>10.1145/320071.320076]
	UW87	Eli Upfal , Avi Wigderson, How to share memory in a distributed system, Journal of the ACM (JACM), v.34 n.1, p.116-127, Jan. 1987 [doi>10.1145/7531.7926]