Implementing partition on vector computers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Implementing partition on vector computers

Full text

Pdf (635 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 5th international conference on Supercomputing table of contents

Cologne, West Germany

Pages: 304 - 311

Year of Publication: 1991

ISBN:0-89791-434-1

Author

Markus Hegland

Interdisciplinary Project Center for Supercomputing, Swiss Federal Institute of Technology

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 11, Citation Count: 0

Additional Information:

references 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/109025.109100 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.

	1	Selim G. Akl, Parallel Sorting Algorithms, Academic Press, Inc., Orlando, FL, 1990
	2	CRAY RESEARCH, INC., UNICOS Math and Scientific Library Reference Manual SR-2081 5.0, 1989.
	3	Robert W. Floyd , Ronald L. Rivest, Expected time bounds for selection, Communications of the ACM, v.18 n.3, p.165-172, March 1975 [doi>10.1145/360680.360691]
	4	Gaston H. Gonnet, Handbook of Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984
	5	C. A. R. Hoare, Algorithm 63: partition, Communications of the ACM, v.4 n.7, p.321, July 1961 [doi>10.1145/366622.366642]
	6	C. A. R. Hoare, Algorithm 65: find, Communications of the ACM, v.4 n.7, p.321-322, July 1961 [doi>10.1145/366622.366647]
	7	------, Ouicksort, The Computer journal, 5 (1962), pp. 10-15.
	8	~, Proof of a recursive program: Q UICKSORT, Comp. J., 14 (1971), pp. 391-395.
	9	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
	10	R. LOESER, Some performance tests of quicksort, Comm. ACM, 17 (1983), pp. 136-165.
	11	M. J. QUINN, Parallel sorting algorithms for tightly coupled mulliprocessors, Parallel Computing, 6 (1988), pp. 349-357.
	12	M. J. Quinn, Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge, BIT, v.29 n.2, p.239-250, 1989 [doi>10.1007/BF01952679]
	13	W. RONSCH AND H. STRAUSS, Timing results of some inlernal sorting algorithms on vector computers, Parallel Computing, 4 (1987), pp. 49-61.
	14	R. SEDGEWICK, The analysis of quicksort programs, Acta Informatica, 7 (1977), pp. 327-355.
	15	Robert Sedgewick, Implementing Quicksort programs, Communications of the ACM, v.21 n.10, p.847-857, Oct. 1978 [doi>10.1145/359619.359631]
	16	Richard C. Singleton, Algorithm 347: an efficient algorithm for sorting with minimal storage [M1], Communications of the ACM, v.12 n.3, p.185-186, March 1969 [doi>10.1145/362875.362901]
	17	H. STONE, Sorting on STAR, IEEE Trans. Softw. Eng., 4 (1978), pp. 138-146.
	18	N. WIRTH, Algorilhmen und Dalenstrukluren, Teubner, 1975.