Bitonic sorters of minimal depth
نویسندگان
چکیده
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 dlog(n)e − blog(n)c.
منابع مشابه
High performance Parallel Linear Sorter Core Design
Hardware sorters exploit inherent concurrency to improve the performance of sequential, softwarebased sorting algorithms. They are often based on Batcher’s odd-even or bitonic merging networks to attenuate the areagreedy hardware solutions. In this paper, a new hardware sorter architecture is presented. It is composed of smaller sorter circuits inspired on insertion sorting algorithms that cont...
متن کاملSome Topological Properties of Bitonic Sorters
This paper proves some topological properties of bitonic sorters, which have found applications in constructing, along with banyan networks, internally nonblocking switching fabrics in future broadband networks. The states of all the sorting elements of an N N bitonic sorter are studied for four different input sequences ai i N ; @ =1, bi i N ; @ =1, ci i N ; @ =1, and di i N ; @ =1, where ai...
متن کاملΝmos-based Sorters for Multiplier Implementations
The capabilities of the conceptual link between threshold gates and sorting networks are explored by implementing a which uses a sorter as the main building block. Traditional disadvantages of binary sorters such as their hardware intensive nature are avoided by using νMOS circuits which allow to improve previous results for multipliers based on a similar architecture.
متن کاملKnitting Sort: A Novel Stable and Inplace Sorting Technique (An Extension of Exchange Sorting with Bitonic Sorting Network)
One of the most frequent operations performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Linear Search, Quadratic search[1], but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and eff...
متن کاملThe Design of Sorters Based on DNA for Bio-Computers
In the past few years, several articles have been devoted to the study of molecular computing based on DNA in order to implement algorithms for solving some NP-complete problems and simulate logic gates in silicon-based computers. A great deal of effort has been made on using DNA to implement simple logic gates, such as simple 1-bit comparators and simple adders, or to solve NP-complete problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011