A taxonomy of parallel sorting
We propose a taxonomy of parallel sorting that encompasses a broad range of array-and file-
sorting algorithms. We analyze how research on parallel sorting has evolved, from the …
sorting algorithms. We analyze how research on parallel sorting has evolved, from the …
[图书][B] Parallel computation: models and methods
SG Akl - 1997 - dl.acm.org
Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
[图书][B] Designing efficient algorithms for parallel computers
MJ Quinn - 1987 - dl.acm.org
Designing efficient algorithms for parallel computers | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …
The VLSI complexity of sorting
CD Thompson - IEEE Transactions on Computers, 1983 - ieeexplore.ieee.org
The area-time complexity of sorting is analyzed under an updated model of VLSI
computation. The new model makes a distinction between" processing" circuits and" …
computation. The new model makes a distinction between" processing" circuits and" …
[PDF][PDF] FPGA-based Multithreading for In-Memory Hash Joins.
Large relational databases often rely on fast join implementations for good performance.
Recent paradigm shifts in processor architectures has reinvigorated research into how the …
Recent paradigm shifts in processor architectures has reinvigorated research into how the …
Packet routing in fixed-connection networks: A survey
MD Grammatikakis, DF Hsu, M Kraetzl… - Journal of Parallel and …, 1998 - Elsevier
We survey routing problems on fixed-connection networks. We consider many aspects of the
routing problem and provide known theoretical results for various communication models …
routing problem and provide known theoretical results for various communication models …
Routing and sorting on mesh-connected arrays
M Kunde - VLSI Algorithms and Architectures: 3rd Aegean …, 1988 - Springer
The problems of sorting and routing on n 1×...× nr mesh-connected arrays of processors are
studied. A new sorting algorithm for r-dimensional meshes, r≥ 3, is presented. On meshes …
studied. A new sorting algorithm for r-dimensional meshes, r≥ 3, is presented. On meshes …
Parallel sorting in two-dimensional VLSI models of computation
ID Scherson, S Sen - IEEE Transactions on Computers, 1989 - ieeexplore.ieee.org
The gradual refinement of a general approach to two-dimensional sorting, the shear-sort
algorithm, to more sophisticated and specialized sorting algorithms on mesh-connected …
algorithm, to more sophisticated and specialized sorting algorithms on mesh-connected …
Minimizing communication in the bitonic sort
JD Lee, KE Batcher - IEEE Transactions on parallel and …, 2000 - ieeexplore.ieee.org
This paper presents bitonic sorting schemes for special-purpose parallel architectures such
as sorting networks and for general-purpose parallel architectures such as SIMD and/or …
as sorting networks and for general-purpose parallel architectures such as SIMD and/or …
Sorting in constant number of row and column phases on a mesh
JM Marberg, E Gafni - Algorithmica, 1988 - Springer
An algorithm for sorting on a mesh by alternately transforming the rows and columns is
presented. The algorithm runs in a constant number of row-and column-transformation …
presented. The algorithm runs in a constant number of row-and column-transformation …