Sciweavers

432 search results - page 51 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
ASPLOS
2008
ACM
15 years 3 months ago
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded...
Michal Wegiel, Chandra Krintz
EUROPAR
2011
Springer
14 years 1 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
BMCBI
2010
134views more  BMCBI 2010»
15 years 2 months ago
R-Gada: a fast and flexible pipeline for copy number analysis in association studies
Background: Genome-wide association studies (GWAS) using Copy Number Variation (CNV) are becoming a central focus of genetic research. CNVs have successfully provided target genom...
Roger Pique-Regi, Alejandro Cáceres, Juan R...
122
Voted
DC
2008
15 years 1 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
131
Voted
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 3 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser