Avinash Bansal · 2015
Abstract — Sorting network is an abstract mathematical model which can be used as a multiple-input, multiple-output switching network to sort the data in ascending or descending order [1]. Sorting has been one of the most critical applications on parallel computing machines. Many classic textbooks on algorithms like Thomas H. Cormen, therefore consider this problem in great detail and list many sorting network for this purpose [2]. There are many sorting algorithms as the Bubble / Insertion sorter, Odd-Even sorter, Sort the data in O(log2 n)2 time complexity andsome other sorter have O(n2) as time complexity, where n is the number of elements. In this paper we propose a sorting network called “Avi Sorter ” having time complexity O(n log2 n) which isbased on just similar to bubble sort algorithm. This sorting network provides the easy way to understand and manipulate the concept of sorting network.
Cited by 0
Konstantin Cherdantsev, Anton Klad'ko · Transaction of Scientific Papers of the Novosibirsk State Technical University · 2016
Cited by 0Open access
Avinash Bansal · 2012
A sorting network is a mathematical model which can be used as a multiple-input, multiple-output switching network [1]. Sorting network has been one of the most critical applications on parallel computing machines. Many classic textbooks on algorithms like Thomas H. Cormen, therefore considered this problem in great detail and listed many sorting network for this purpose [2]. Sorting networks CLR90, Sav98 turned out to be convenient mean to describe certain parallel sorting algorithms [2]. In this paper we have introduced a new sorting network having time complexity (log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> N) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> of theoretically and practically, where N is the number of elements. This network has a special feature it will always give the data in the required sequence (ascending or descending order) and feed the input from any direction (moving from left to right or from right to left).
Cited by 1
Shay Assaf, Eli Upfal · 2002
A general technique for enhancing the reliability of sorting networks and other comparator-based networks is presented. The technique converts any network that uses unreliable comparators to a fault-tolerant network that produces the correct output with overwhelming probability, even if each comparator is faulty with some probability smaller than 1/2, independently of other comparators. The depth of the fault-tolerant network is only a constant times the depth of the original network, and the width of the network is increased by a logarithmic factor.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 34
Feng Gu, Colin M. Crump, Gary Thomas · Cellular and Molecular Life Sciences · 2001
Cited by 193Open access
Rudolph, Larry · Figshare · 2018
Computer Science Department
Cited by 0Open access
Rudolph, Larry · KiltHub Repository · 2018
Computer Science Department
Cited by 0Open access
G. Panneerselvam, G.A. Jullien, Samiran Bandyopadhyay · Electronics Letters · 1992
A novel systolic, perimeter sorting network is proposed. The total number of comparators required for this network is (3n2 − n)/2 for 2n inputs, which is less than the number required for either nearest neighbour connected odd-even transposition sorting or triangular array sorting networks.
Cited by 0
Jack Dongarra, Piotr Łuszczek, Paul Feautrier et al. · 2011
Cited by 0
Мартинюк, Тетяна Борисівна, Антощук, Світлана Григорівна, Власійчук, Валентина Валеріївна et al. · Repository of Vinnytsia National Technical University (Vinnytsia National Technical University) · 2007
Сортувальна нейромережа містить обчислювальну частину, що складається з двох блоків, причому другі входи першого блока обчислювальної частини з'єднані з входами початкових установчих значень пристрою, виходи першого блока обчислювальної частини з'єднані з входами її другого блока, які є входами вектора підстановки, інформаційні входи другого блока обчислювальної частини з'єднані з входами початкового вектора даних пристрою, а його інформаційні виходи є виходами відсортованого вектора даних пристрою. Додатково містить налаштовувальну частину, яка складається з селектора кодів і аналізатора реакцій, інформаційні входи селектора кодів з'єднані з входами початкового вектора даних пристрою. Його виходи з'єднані з інформаційними входами аналізатора реакцій, виходи якого з'єднані з першими входами першого блока обчислювальної частини, який містить комутатор та пам'ять рангів. Виходи першого блока обчислювальної частини підключені до адресних входів його комутатора та адресних входів селектора кодів налаштовувальної частини. Інформаційні входи комутатора та пам'яті рангів є відповідно першими і другими входами першого блока обчислювальної частини. Виходи комутатора з'єднані попарно з входами інкремента/декремента пам'яті рангів. Вхід скидання пристрою підключений до відповідних входів пам'яті рангів першого блока обчислювальної частини і аналізатора реакцій налаштовувальної частини, який також підключений до шини тактових імпульсів та входів керування відповідно непарними і парними циклами сортування пристрою, останні з'єднані також з відповідними входами комутатора першого блока обчислювальної частини. Аналізатор реакцій налаштовувальної частини має вихід сигналу "Кінець" пристрою, який підключений до входу дозволу зчитування другого блока обчислювальної частини.
Cited by 0Open access
Ralf Hinze, Clare Martin · Journal of Functional Programming · 2018
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Cited by 0
2008
We present a general technique for enhanc-ing the reliability of sorting networks, and other comparator based networks. Our tech-nique converts any network that uses unreli-able comparators to a fault tolerant network that produces the correct output with over-helming probability, even if each comparator is faulty with some probability smaller than 1/2, independent of the other comparators. The depth of the fault tolerant network is only a constant time the depth of the original network, the width of the network is increased by a logarithmic factor. 1.
Cited by 0
M. Dowd, Yehoshua Perl, Larry Rudolph et al. · Journal of the ACM · 1989
A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network, which consists of log n blocks, is introduced. Each block, called a balanced merging block, merges elements on the even input lines with those on the odd input lines. The periodic balanced sorting network sorts n items in O ([log n ] 2 ) time using ( n /2)(log n ) 2 comparators. Although these bounds are comparable to many existing sorting networks, the periodic structure enables a hardware implementation consisting of only one block with the output of the block recycled back as input until the output is sorted. An implementation of our network on the shuffle exchange interconnection model in which the direction of the comparators are all identical and fixed is also presented.
Cited by 96Open access
Kathy J. Liszka, Kenneth E. Batcher · 1993
The bitonic sorting network will sort N-2^m keys in O(log^2N) time with 0(Nlog^2N) comparators. Developments on the sorter enable the network to sort N-pq keys, a composite number. However, there has been no general method for sorting a bitonic sequence of N keys, N a prime, or N a composite that decomposes into primes larger than 3. The oddmerge method removes this constraint while maintaining the same cost and delay, using a uniform and efficient decomposition.
Cited by 30
Michal Bidlo, Zdeněk Vašíček, Karel Slaný · Lecture notes in computer science · 2010
Cited by 4
Maranke I. Koster, Dennis R. Roop · Journal of Investigative Dermatology · 2008
Cited by 10Open access
Wenhong Wei, Wenjun Xiao, Zhen Zhang · 2008
Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we present sorting algorithm on the n processors BSN whose basic network has Hamiltonian path, and if the basic network of BSN is mesh, sorting n unordered elements will complete in time (2n)^1(1/2)+O(n^(3/4)).
Cited by 2
Jaime Davila, Sanguthevar Rajasekaran · International Journal of Foundations of Computer Science · 2005
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamental problems on this architecture. The algorithms presented in this paper are valid for POPS(d,g) where d>g and use randomization. We present an algorithm that solves the problem of sparse enumeration sorting of d ∊ keys in [Formula: see text] time and hence performs better than previous algorithms. We also present algorithms that allow us to do stable sorting of integers in the range [1, log n] and [Formula: see text] in [Formula: see text] time. When g=n ∊ , for any constant 0<∊<½ this allows us to do sorting of integers in the range [1,n] in [Formula: see text] time. We finally use these algorithms to solve the problem of multiple binary search in the case where we have d ∊ keys in [Formula: see text] time and in the case where we have integer keys in the range [1,n] in [Formula: see text] time, when g=n ∊ , for some constant 0<∊<½.
Cited by 0
Raudszus, Henriette · Figshare · 2020
Example sorting task and pathfinder network from one participant. From top to bottom: Sorting task, proximity matrix, pathfinder network.<br>
Cited by 0Open access
Raudszus, Henriette · Figshare · 2017
Example sorting task and pathfinder network from one participant. From top to bottom: Sorting task, proximity matrix, pathfinder network.<br>
Cited by 0Open access