Add to ORKGABSTRACT. In this paper we identify techniques that have been employed in the design of sorting and selection algorithms for various interconnection networks. We consider both randomized and deterministic techniques. Interconnection Networks of interest include the mesh, the mesh with fixed and reconfigurable buses, the hypercube family, and the star graph. For the sake of comparisons, we also list PRAM algorithms.
AbstractThe list-ranking problem is considered for parallel computers which communicate through an i...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
A central issue in the design of a general-purpose parallel computer is the choice of an interconne...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
Selection, Routing and Sorting on the Star Graph We consider the problems of selection, routing and ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ar...
Abstract Mesh connected computers have become attractive models of computing because of their varied...
We consider the problems of selection, routing and sorting on an n-star graph (with n! nodes), an in...
SIMD machine architects must choose an interconnection network to provide interprocessor communicati...
The list-ranking problem is considered for parallel computers which communicate through an interconn...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algor...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
In general, sorting networks can be used as interconnection networks in that the inputs are simply s...
AbstractThe list-ranking problem is considered for parallel computers which communicate through an i...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
A central issue in the design of a general-purpose parallel computer is the choice of an interconne...
Abstract. In this paper we present efficient deterministic and randomized algorithms for selection o...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1992. Simultaneously published...
Selection, Routing and Sorting on the Star Graph We consider the problems of selection, routing and ...
Sorting on interconnection networks has been solved `optimally'. However, the `lower-order' terms ar...
Abstract Mesh connected computers have become attractive models of computing because of their varied...
We consider the problems of selection, routing and sorting on an n-star graph (with n! nodes), an in...
SIMD machine architects must choose an interconnection network to provide interprocessor communicati...
The list-ranking problem is considered for parallel computers which communicate through an interconn...
The mesh with optical reconfigurable buses is one of the strongest interconnection networks one ca...
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algor...
This paper provides an overview of lower and upper bounds for mesh-connected processor networks. Mos...
In general, sorting networks can be used as interconnection networks in that the inputs are simply s...
AbstractThe list-ranking problem is considered for parallel computers which communicate through an i...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
A central issue in the design of a general-purpose parallel computer is the choice of an interconne...