Sciweavers

1370 search results - page 46 / 274
» Synchronization Transformations for Parallel Computing
Sort
View
PODC
2004
ACM
14 years 2 months ago
Bringing practical lock-free synchronization to 64-bit applications
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems an...
Simon Doherty, Maurice Herlihy, Victor Luchangco, ...
PACT
2009
Springer
14 years 3 months ago
Parallel FFT with Eden Skeletons
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...
PODC
1994
ACM
14 years 25 days ago
A Performance Evaluation of Lock-Free Synchronization Protocols
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
Anthony LaMarca
HPCA
2000
IEEE
14 years 1 months ago
Improving the Throughput of Synchronization by Insertion of Delays
Efficiency of synchronization mechanisms can limit the parallel performance of many shared-memory applications. In addition, the ever increasing performance gap between processor...
Ravi Rajwar, Alain Kägi, James R. Goodman
IPPS
2010
IEEE
13 years 6 months ago
A lock-free, cache-efficient multi-core synchronization mechanism for line-rate network traffic monitoring
Line-rate data traffic monitoring in high-speed networks is essential for network management. To satisfy the line-rate requirement, one can leverage multi-core architectures to par...
Patrick P. C. Lee, Tian Bu, Girish P. Chandranmeno...