Recirculation Sorter-Memory Architecture
Original Publication Date: 1987-Apr-01
Included in the Prior Art Database: 2005-Feb-01
A previously described sorting scheme [*] uses fixed length sorters to sort a long vector of data into a series of short but sorted vectors of data. These sorted vectors are then merged together to complete the sorting process. Recirculation architecture places the length of the sorted segments as a function of the randomness of the data. (Image Omitted) The vector of data to be sorted resides in memory. Reads made from memory to the sorter (push) repeat until the first element of data leaves the sorter to go to the holding cell. The memory recirculation selection will now write the data from the holding cell back to the source address of first element of data pushed into the sorter.