Sciweavers

86 search results - page 11 / 18
» Automatic memory reclamation for lock-free data structures
Sort
View
PODC
1990
ACM
15 years 2 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
112
Voted
CASES
2008
ACM
15 years 14 days ago
Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
Hoseok Chang, Wonyong Sung
108
Voted
PPOPP
2006
ACM
15 years 4 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
CODES
2005
IEEE
15 years 4 months ago
SOMA: a tool for synthesizing and optimizing memory accesses in ASICs
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
Girish Venkataramani, Tiberiu Chelcea, Seth Copen ...
KBSE
2008
IEEE
15 years 4 months ago
Automatic Inference of Frame Axioms Using Static Analysis
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
Zvonimir Rakamaric, Alan J. Hu