Sciweavers

42 search results - page 6 / 9
» Asynchronous parallel disk sorting
Sort
View
PVM
2007
Springer
14 years 1 months ago
(Sync|Async)+ MPI Search Engines
We propose a parallel MPI search engine that is capable of automatically switching between asynchronous message passing and bulk-synchronous message passing modes of operation. Whe...
Mauricio Marín, Veronica Gil Costa
ICDCS
2002
IEEE
14 years 23 days ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
SPAA
1997
ACM
14 years 7 hour ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
LCR
2000
Springer
172views System Software» more  LCR 2000»
13 years 11 months ago
Achieving Robust, Scalable Cluster I/O in Java
We present Tigris, a high-performance computation and I/O substrate for clusters of workstations that is implemented entirely in Java. Tigris automatically balances resource load a...
Matt Welsh, David E. Culler
BMCBI
2010
189views more  BMCBI 2010»
13 years 8 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...