Sciweavers

1499 search results - page 196 / 300
» Chopping Concurrent Programs
Sort
View
PPOPP
2010
ACM
15 years 11 months ago
Leveraging parallel nesting in transactional memory
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
João Barreto, Aleksandar Dragojevic, Paulo ...
166
Voted
POPL
2009
ACM
15 years 9 months ago
Language constructs for transactional memory
Transactional memory (TM) provides a safer, more modular, and more scalable alternative to traditional lock-based synchronization. Implementing high performance TM systems has rec...
Tim Harris
119
Voted
ICPPW
2009
IEEE
15 years 9 months ago
Just-in-Time Renaming and Lazy Write-Back on the Cell/B.E.
— Cell Superscalar (CellSs) provides a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurre...
Pieter Bellens, Josep M. Pérez, Rosa M. Bad...
SPIN
2009
Springer
15 years 9 months ago
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
Abstract. We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread’...
Nicholas Kidd, Peter Lammich, Tayssir Touili, Thom...
98
Voted
TPHOL
2007
IEEE
15 years 8 months ago
Separation Logic for Small-Step cminor
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
Andrew W. Appel, Sandrine Blazy