Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A fast, storage-efficient parallel sorting algorithm

Thumbnail Image

Date

1993

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

A parallel sorting algorithm is presented for storage-efficient internal sorting on MIMD machines. The algorithm first sorts the elements within each node using a serial based algorithm, then a two-phase parallel merge. It requires additional storage of order of the square root of the number of elements in each node. Performance of the algorithm on two general-purpose MIMD machines, the Fujitsu AP1000 and the Thinking Machines CM5, is examined. The algorithm is suitable for implementation on special-purpose parallel machines, e.g., parallel database machines.

Description

Keywords

Batcher's merge-exchange sort, distributed memory, Fujitsu AP1000, parallel sorting, sorting, Sparc, Thinking Machines CM5

Citation

URI

https://dspace-test.anu.edu.au/handle/1885/733737605

Collections

DevOps Pure Testing

Source

Type

Conference contribution

Book Title

Entity type

Access Statement

License Rights

DOI

10.1109/ASAP.1993.397158

Restricted until

DSpace software copyright © 2002-2026 LYRASIS