Simplified odd-even sort using multiple shift-register loops |
| |
Authors: | T C Chen K P Eswaran V Y Lum C Tung |
| |
Affiliation: | (1) IBM Research Laboratory, San Jose, California |
| |
Abstract: | By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd-even transposition-sort algorithm to finish in (N + 1)/2 loop times (periods) using (N – 1) comparators. The sorting can be overlapped with input/output; the percentage of unoverlapped sorting times is less than 20% of the total time with a single ladder, less than 6% using two ladders, and is zero with a sufficient number of ladders.Presented at the Second International Magnetic Bubble Conference, Eindhoven, The Netherlands, August 1976. |
| |
Keywords: | Sorting bubbles shift register loops parallel sorting sort engine |
本文献已被 SpringerLink 等数据库收录! |
|