Sciweavers

21 search results - page 4 / 5
» A Deadlock-Free Semantics for Shared Memory Concurrency
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Transactions in the jungle
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
Rachid Guerraoui, Thomas A. Henzinger, Michal Kapa...
BIRTHDAY
2004
Springer
15 years 5 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
CACM
2010
179views more  CACM 2010»
14 years 11 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
DATE
2010
IEEE
137views Hardware» more  DATE 2010»
15 years 4 months ago
Deterministic, predictable and light-weight multithreading using PRET-C
—We present a new language called Precision Timed C, for predictable and lightweight multithreading in C. PRET-C supports synchronous concurrency, preemption, and a high-level co...
Sidharta Andalam, Partha S. Roop, Alain Girault
PPOPP
2009
ACM
16 years 4 days ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha