Sciweavers

392 search results - page 56 / 79
» Controlling the Performance Overhead of Component-Based Syst...
Sort
View
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
13 years 9 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
SIGCOMM
2012
ACM
11 years 10 months ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
PPOPP
2010
ACM
14 years 5 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
EUROSYS
2007
ACM
14 years 4 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
ISSRE
2006
IEEE
14 years 1 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski