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 …
Fibonacci cubes-a new interconnection topology
WJ Hsu - IEEE Transactions on Parallel and Distributed …, 1993 - ieeexplore.ieee.org
A novel interconnection topology called the Fibonacci cube is shown to possess attractive
recurrent structures in spite of its asymmetric and relatively sparse interconnections. Since it …
recurrent structures in spite of its asymmetric and relatively sparse interconnections. Since it …
[图书][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 …
[图书][B] Interconnection networks for large-scale parallel processing: theory and case studies
HJ Siegel - 1985 - dl.acm.org
Interconnection networks for large-scale parallel processing: theory and case studies | Guide
books skip to main content ACM Digital Library home ACM corporate logo Google, Inc. (search) …
books skip to main content ACM Digital Library home ACM corporate logo Google, Inc. (search) …
On mapping parallel algorithms into parallel architectures
F Berman, L Snyder - Journal of Parallel and Distributed Computing, 1987 - Elsevier
The mapping problem arises when the communication structure of a parallel algorithm
differs from the interconnection architecture of the intended parallel machine (topological …
differs from the interconnection architecture of the intended parallel machine (topological …
Embedding one interconnection network in another
B Monien, H Sudborough - Computational graph theory, 1990 - Springer
Abstract Embedding one Interconnection Network in Another. We review results on
embedding network and program structures into popular parallel computer architectures …
embedding network and program structures into popular parallel computer architectures …
DIB—a distributed implementation of backtracking
R Finkel, U Manber - ACM Transactions on Programming Languages …, 1987 - dl.acm.org
DIB is a general-purpose package that allows a wide range of applications such as
recursive backtrack, branch and bound, and alpha-beta search to be implemented on a …
recursive backtrack, branch and bound, and alpha-beta search to be implemented on a …
[HTML][HTML] Parameterized problems complete for nondeterministic FPT time and logarithmic space
Let XNLP be the class of parameterized problems such that an instance of size n with
parameter k can be solved nondeterministically in time f (k) n O (1) and space f (k) …
parameter k can be solved nondeterministically in time f (k) n O (1) and space f (k) …
[图书][B] Parallel complexity theory
I Parberry - 1987 - dl.acm.org
Parallel complexity theory | Guide books skip to main content ACM Digital Library home
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …
[PDF][PDF] Deterministic sorting in nearly logarithmic time on the hypercube and related computers
R Cypher, CG Plaxton - Proceedings of the twenty-second annual ACM …, 1990 - dl.acm.org
This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records
on an n processor hypercube, shuffle-exchange or cube-connected cycles in O (log n …
on an n processor hypercube, shuffle-exchange or cube-connected cycles in O (log n …