Results 1  10
of
94
The Bitonic Sort on Transputer Architectures
, 1991
"... The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for machine and compares this with an implementation on T8 networks to see the ..."
Abstract
 Add to MetaCart
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for machine and compares this with an implementation on T8 networks to see
Bitonic Sort on Ultracomputers
, 1979
"... Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time Q(n(log n) 2 ). The method can also be adapted to ultracomputers (Schwar ..."
Abstract
 Add to MetaCart
Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time Q(n(log n) 2 ). The method can also be adapted to ultracomputers
An improvement of bitonic sorting for parallel computing
 in Proceedings of the 9th WSEAS International Conference on Computers, ser. ICCOMP’05. Stevens Point
"... Abstract: In this paper we would like to introduce an efficient variant of Bitonic sorting that can be used with sorting large arrays in distributed computing environment. The problem of sorting a collection of values on a meshconnected distributedmemory computer using our sort algorithm is consi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: In this paper we would like to introduce an efficient variant of Bitonic sorting that can be used with sorting large arrays in distributed computing environment. The problem of sorting a collection of values on a meshconnected distributedmemory computer using our sort algorithm
Improving Bitonic Sorting by Wire Elimination
"... We introduce a technique called wire elimination by which it is possible to remove wires and comparators from (n,m)merging and nsorting circuits such that the resulting circuits are (n′,m′)merging and n ′sorting circuits, resp., with n ′ < n, m ′ < m. By neatly choosing the wires to be remo ..."
Abstract
 Add to MetaCart
comparators less than the classical Bitonic (n,n)merge circuit, but still the same depth. Using the usual sorting by merging technique, we get a variant of Bitonic sort which saves 1 4n(logn − 1) comparators compared to the classical variant. 1
Formal engineering of the bitonic sort using PVS
 In 2nd Irish Workshop on Formal Methods
, 1998
"... In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this wellknown parallel sort. It is based on bitonic lists whose relevant properties can be proven with PVS. To achieve our goal of construc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this wellknown parallel sort. It is based on bitonic lists whose relevant properties can be proven with PVS. To achieve our goal
Abstract Efficient Bitonic Sorting of Large Arrays on the MasPar MP1†
"... The problem of sorting a collection of values on a meshconnected distributedmemory SIMD computer using variants of Batcher's Bitonic sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons ..."
Abstract
 Add to MetaCart
The problem of sorting a collection of values on a meshconnected distributedmemory SIMD computer using variants of Batcher's Bitonic sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons
CommunicationEfficient Bitonic Sort on a Distributed Memory Parallel Computer
, 2001
"... Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized however, a great portion of execution time b consumed due to O(lo$P) time of data exchange of N/P keys where P, N are the number of processors aid keys, respectiv ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized however, a great portion of execution time b consumed due to O(lo$P) time of data exchange of N/P keys where P, N are the number of processors aid keys
Simulating the Bitonic Sort on a 2Dmesh with P Systems
"... Summary. This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log 2 N). When applying it to the 2D mesh architecture, two indexing functions are considered, rowmajor and shuffled rowmajor. Some properties are proved for the later, toge ..."
Abstract
 Add to MetaCart
Summary. This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log 2 N). When applying it to the 2D mesh architecture, two indexing functions are considered, rowmajor and shuffled rowmajor. Some properties are proved for the later
Lecture 3: Scans, Improved Radix Sort, and Batcher's Bitonic Sort 1 Implementation of scans (parallel prefix)
"... binary tree. There is one processor on each node of the tree. The input is stored in the leaf processors, from left to right. Figure 1 illustrates the operation of the algorithm. For convenience, we do not indicate the associative binary operator\Omega . The algorithm works in two phases. In the fi ..."
Abstract
 Add to MetaCart
binary tree. There is one processor on each node of the tree. The input is stored in the leaf processors, from left to right. Figure 1 illustrates the operation of the algorithm. For convenience, we do not indicate the associative binary operator\Omega . The algorithm works in two phases. In the first phase, the computation goes up the tree, and in the second phase values are propagated down. Phase 1 Each leaf passes its value to the parent. Each nonleaf node computes the product of the values received from the children, and sends the result to its parent (if the parent exists). Nonleaf nodes store the value received from the left child into the right link. We can imagine that the identity value is stored on left links. Phase 2 The root sends down the identity value to both children. While going downwards, the value is mutiplied by whatever is already on the links. The process is repeated recursively, as illustrated in the bottom hal
Results 1  10
of
94