Shear sort - a true two-dimensional sorting technique for VLSI networks

Isaacd, Scherson ; Sandeep, Sen ; Shamir, A. D. (1986) Shear sort - a true two-dimensional sorting technique for VLSI networks International Conference on Parallel Processing . pp. 903-908.

Full text not available from this repository.

Abstract

Given a sequence of numbers which can be mapped into an m x n array, the sorting of rows and columns is shown to yield an overall sorted sequence. This unusually simple procedure is proven to require O(log2m) iterations by analyzing the data movement in the array under successive row and column sorts. An efficient bubble sort network suitable for VLSI implementation with near-optimal area-time-squared performance is a direct application of the row-column sorting technique.

Item Type:Article
Source:Copyright of this article belongs to International Conference on Parallel Processing.
ID Code:90066
Deposited On:04 May 2012 14:27
Last Modified:04 May 2012 14:27

Repository Staff Only: item control page