Thumbnail
Access Restriction
Subscribed

Author Shell, Donald L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Optimum dispersion algorithm ♦ Dispersion algorithms ♦ Polyphase sorting ♦ Repetition operator ♦ Sorting
Abstract Various dispersion algorithms for the polyphase sorting procedure are examined. The optimum algorithm based on minimizing the total number of unit strings read is displayed. The logic of this algorithm is rather complicated; hence, several other new dispersion algorithms with more straightforward logic are presented. Of the simple dispersion algorithms discussed, the Horizontal is best. It does approximately one-fourth to one and one-half percent less reading and writing than most algorithms in use today. An additional two and one-fourth to three percent improvement can be achieved by utilizing the Modified Optimum Algorithm. This algorithm is relatively straightforward, but it requires a fairly close estimate of the total number of unit strings before the dispersion begins.
Description Affiliation: General Electric Company, Schenectady, NY (Shell, Donald L.)
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 14
Issue Number 11
Page Count 7
Starting Page 713
Ending Page 719


Open content in new tab

   Open content in new tab
Source: ACM Digital Library