Implementing the multiprefix operation on parallel and vector computers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Implementing the multiprefix operation on parallel and vector computers

Full text

Pdf (1.20 MB)

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: 377 - 386

Year of Publication: 1993

ISBN:0-89791-599-2

Author

Thomas J. Sheffler

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): 2, Downloads (12 Months): 20, 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.166115 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.

	AS89	Edward Anderson , Youcef Saad, Solving sparse triangular linear systems on parallel computers, International Journal of High Speed Computing, v.1 n.1, p.73-95, May 1989 [doi>10.1142/S0129053389000056]
	BBB+91	D. H. Bailey , E. Barszcz , J. T. Barton , D. S. Browning , R. L. Carter , L. Dagum , R. A. Fatoohi , P. O. Frederickson , T. A. Lasinski , R. S. Schreiber , H. D. Simon , V. Venkatakrishnan , S. K. Weeratunga, The NAS parallel benchmarks—summary and preliminary results, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.158-165, November 18-22, 1991, Albuquerque, New Mexico, United States [doi>10.1145/125826.125925]
	BBCS91	D. Bailey, D. Browning, R. Carter, and H. Simon. The NAS parallel benchmarks. Technical Report RNR-91-002, NASA Ames Research Center, August 1991.
	BDH+91	P. C. P. Bhatt , K. Diks , T. Hagerup , V. C. Prasad , T. Radzik , S. Saxena, Improved deterministic parallel integer sorting, Information and Computation, v.94 n.1, p.29-47, Sept. 1991 [doi>10.1016/0890-5401(91)90031-V]
	Ble90	Guy E. Blelloch, Vector models for data-parallel computing, MIT Press, Cambridge, MA, 1990
	CBZ90	Siddhartha Chatterjee , Guy E. Blelloch , Marco Zagha, Scan primitives for vector computers, Proceedings of the 1990 conference on Supercomputing, p.666-675, October 1990, New York, New York, United States
	Chl88	Bogdan S. Chlebus, A parallel bucket sort, Information Processing Letters, v.27 n.2, p.57-61, February 29, 1988 [doi>10.1016/0020-0190(88)90092-0]
	CLR89	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	Coh88	Evan Reid Cohn. The beta operation: A parallel primitive. Technical Report STAN-CS-88-1231, Department of Computer Science, Stanford University, 1988.
	GLR81	A. Gottlieb, B,D Lubachevsky, and L. Rudolph. Coordinating large numbers of processors. In Proc. 1981 international Conference on Parallel Processing, 1981.
	Hag87	Torben Hagerup, Towards optimal parallel bucket sorting, Information and Computation, v.75 n.1, p.39-51, October 1, 1987 [doi>10.1016/0890-5401(87)90062-9]
	Hil85	W D Hillis, The connection machine, MIT Press, Cambridge, MA, 1985
	HJ88	R. W. Hockney , C. R. Jesshope, Parallel Computers Two: Architecture, Programming and Algorithms, IOP Publishing Ltd., Bristol, UK, 1988
	Kan90	Yasusi Kanada, A vectorization technique of hashing and its application to several sorting algorithms, In PARBASE-90, International Conference on Databases, Parallel Architectures, and Their Applications, 1990.
	Knu68	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	KSV	Kenneth S. Kundert and Alberto Sangiovanni-Vincentelli. Sparse 1.3, a sparse linear equation solver. Available from EECS Industrial Liaison Program, University of California, Berkeley, CA 94720.
	MV91	Yossi Matias , Uzi Vishkin, Parallel hashing and integer sorting, Journal of Algorithms, v.12 n.4, p.573-606, Dec. 1991 [doi>10.1016/0196-6774(91)90034-V]
	PMM92	Douglas M. Pase, Tom MacDonald, and Andrew Meltzer. MPP Fortran programming model. Technical report, Cray Research, Inc,, January 1992.
	Ram90	Rajeev Raman, The power of Collision: randomized parallel algorithms for chaining and integer sorting, Proceedings of the tenth conference on Foundations of software technology and theoretical computer science, p.161-175, November 1990, Bangalore, India
	RBJ88	Abhiram G. Ranade , Sandeep N. Bhatt , Lennart S. Johnsson, The fluent abstract machine, Proceedings of the fifth MIT conference on Advanced research in VLSI, p.71-93, January 1988, Cambridge, Massachusetts, United States
	RR89	S. Rajasekaran , J. H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM Journal on Computing, v.18 n.3, p.594-607, June 1989 [doi>10.1137/0218041]
	Saa89	Y. Saad, Krylov subspace methods on supercomputers, SIAM Journal on Scientific and Statistical Computing, v.10 n.6, p.1200-1232, Nov. 1989 [doi>10.1137/0910073]
	SB93	Thomas J. Sheffler and Randal Bryant. An analysis of hashing on parallel and vector computers. In Proceedmgs of the 1993 International Conference on Parallel Processing, 1993.
	SH86	Guy L. Steele Jr. and W, Daniel Hillis. Connection Machine Lisp: Fine-grained parallel symbolic processing. Technical Report 86.16, Thinking Machines Corporation, May 1986.
	Vis83a	Uzi Vishlan. Implementation of simultaneous memory address access in models that forbit it. Journal of Algorithms, 1983.
	Vis83b	Uzi Vishkin. Oh choice of a model of parallel computation. Technical report, Dept. of Computer Science, Courant Institute, New York University, 1983.