Sciweavers

1061 search results - page 12 / 213
» Dependently Sorted Logic
Sort
View
SPAA
1995
ACM
14 years 1 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
CGO
2004
IEEE
14 years 1 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 10 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
JEA
1998
133views more  JEA 1998»
13 years 9 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...
JALC
2002
77views more  JALC 2002»
13 years 9 months ago
Local Logics for Traces
A
Igor Walukiewicz