Sciweavers

42 search results - page 4 / 9
» Asynchronous parallel disk sorting
Sort
View
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 7 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
ICPPW
1999
IEEE
13 years 11 months ago
Synchronous and Asynchronous Collaborative Information Space Analysis Tools
The DASHER Project at USC/ISI has focused upon helping organizations with rapid-response mission requirements by providing information analysis tools that help make sense of sets o...
Ke-Thia Yao, Robert Neches, In-Young Ko, Ragy Elei...
IPPS
2010
IEEE
13 years 4 months ago
Out-of-core distribution sort in the FG programming environment
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
Priya Natarajan, Thomas H. Cormen, Elena Riccio St...
PODC
2004
ACM
14 years 13 days ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 7 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt