Parallel integer sorting
This paper presents algorithms and experiments for internal (in core) and external (secondary memory) parallel sorting. It concentrates on algorithms appropriate for medium scale MIMD parallel computers, with all experiments being performed on a 128 processor Fujitsu AP1000. Data sizes ranging from a few hundred thousand to a few hundred million elements are considered, with all elements being either 64 bit or 128 bit integers. The internal sorting algorithm is based on earlier work by Andrew...[Show more]
|Collections||ANU Research Publications|
|1583-01.2003-07-03T01:11:23Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-97-10.pdf||276.39 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.