Thumbnail
Access Restriction
Subscribed

Author Hirschberg, D. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Algorithms ♦ Parallel processing ♦ Bucket sort ♦ Sorting
Abstract A parallel bucket-sort algorithm is presented that requires time O(log n) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort n numbers in time O(k log n) using n1+1/k processors, for k an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.
Description Affiliation: Rice Univ., Houston, TX (Hirschberg, D. S.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 8
Page Count 5
Starting Page 657
Ending Page 661


Open content in new tab

   Open content in new tab
Source: ACM Digital Library