Sciweavers

2944 search results - page 377 / 589
» Improving Bound Propagation
Sort
View
ASPLOS
2009
ACM
16 years 7 months ago
Maximum benefit from a minimal HTM
A minimal, bounded hardware transactional memory implementation significantly improves synchronization performance when used in an operating system kernel. We add HTM to Linux 2.4...
Owen S. Hofmann, Christopher J. Rossbach, Emmett W...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
SOSP
2001
ACM
16 years 3 months ago
The Costs and Limits of Availability for Replicated Services
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
Haifeng Yu, Amin Vahdat
ARC
2010
Springer
387views Hardware» more  ARC 2010»
16 years 1 months ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides
SIGGRAPH
2009
ACM
16 years 1 months ago
PCCD: parallel continuous collision detection
We present a novel parallel continuous collision detection (PCCD) method to utilize the widely available multi-core CPU architecture. Our method works with a wide variety of defor...
Duksu Kim, Jae-Pil Heo, Sung-Eui Yoon