Space-efficient representations of shared data for parallel computers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Space-efficient representations of shared data for parallel computers

Full text

Pdf (1.08 MB)

Source

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

Island of Crete, Greece

Pages: 407 - 416

Year of Publication: 1990

ISBN:0-89791-370-1

Author

K. Herley

Department of Computer Science, Cornell University

Sponsors

IEEE-CS : Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
CTI : Computer Technology Inst.
EATCS : European Association for Theoretical Computer Science
Computer Tech Inst. : Computer Technology Institute

Publisher

ACM New York, NY, USA

Bibliometrics

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

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/97444.97708 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]
	AKS83	M. Ajtai , J. Komlós , E. Szemerédi, An 0(n log n) sorting network, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.1-9, December 1983 [doi>10.1145/800061.808726]
	DKM+88	M.Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Hiede, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, White Plains, New York, pages 524-531, Oct 1988.
	HB88	Kieran T. Herley , Gianfranco Bilardi, Deterministic Simulations of PRAMs on Bounded Degree Networks, Cornell University, Ithaca, NY, 1988
	Her89a	K.T. Herley. Efficient simulations of smM1 shared memories on bounded degree networks. In Proceedings of the 30th Annual Symposium on the Foundations o.f Computer Science, Research Triangle Park, North Carloi~a~ pages 390-395~ Oct 1989.
	Her89b	K.T. tIerley. Improved bounds for the token distribution problem. Techllical Report TR 89-1051, Computer Science Depart.ment, Cornell University, October 1989.
	Her90	K. Herley, Deterministic simulation of shared memory on bounded degree networks, Cornell University, Ithaca, NY, 1990
	HP89	S. W. Hornick , F. P. Preparata, Deterministic P-RAM simulation with constant redundancy, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.103-109, June 18-21, 1989, Santa Fe, New Mexico, United States [doi>10.1145/72935.72947]
	KRS85	C.P. Kruskal. L. Rudolph, and M. Snir. The power of parallel prefix. IEEE Tra~sactioT~s on Computers, c-34(10)'965-968, Oct 1985.
	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]
	Lei84	F.T. Leighton. New lower bound techniques for VLSI. Mathematical Sys~,ems Theory, 17:47-70, 1984.
	Lei85	Tom Leighton, Tight bounds on the complexity of parallel sorting, IEEE Transactions on Computers, v.34 n.4, p.344-354, April 1985 [doi>10.1109/TC.1985.5009385]
	LPP87	F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAM's in VLSI. Technical Report S-87-11, Dipartmento di Infonna.tica, Universitg di Pisa., 3une 1987.
	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]
	NMB83	D. Nath, S. N. Maheshwari, and P.C.P. Bhatt. Efficient. VLSI networks for parallel processing based on orthogonal trees. IEEE Transactions on Computers, c- 32(6):569-581, June 1983.
	PU89	David Peleg , Eli Upfal, The token distribution problem, SIAM Journal on Computing, v.18 n.2, p.229-243, April 1989 [doi>10.1137/0218015]
	Ran87	A.G. Ranade. How to emulate shared memory. In Proceedings of the 28th Annual Symposium on. the Foundations of Computer Science, Los Angeles, Califof nia, pages 185-194, Oct 1987.
	Sie89	A. Siegel. On universal classes of fast high-performance hashfunctions, their time-space trade-off, and their applications. In Proceedings of the 30th Annual Symposium oa the Foundalions of Compuling, Research Triangle Park, North Carolina, pages 20-25, Oct 1989.
	Upf84	Eli Upfal, A probabilistic relation between desirable and feasible, models of parallel computation, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.258-265, December 1984 [doi>10.1145/800057.808689]
	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]
	Val88	L.G. Valiant. Optimaly universal parallel computers..Philisophical Transactions of the Royal Society of London, Series A, 326:373-376, 1988.

CITED BY 2

	A. Pietracaprina , F. P. Preparata, A practical constructive scheme for deterministic shared-memory access, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.100-109, June 30-July 02, 1993, Velen, Germany
	Andrea Pietracaprina , Geppino Pucci , Jop F. Sibeyn, Constructive deterministic PRAM simulation on a mesh-connected computer, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.248-256, June 27-29, 1994, Cape May, New Jersey, United States