Sciweavers

173 search results - page 16 / 35
» The Atomos transactional programming language
Sort
View
ASPLOS
2008
ACM
14 years 11 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
ACMMSP
2006
ACM
250views Hardware» more  ACMMSP 2006»
15 years 3 months ago
What do high-level memory models mean for transactions?
Many people have proposed adding transactions, or atomic blocks, to type-safe high-level programming languages. However, researchers have not considered the semantics of transacti...
Dan Grossman, Jeremy Manson, William Pugh
FCCM
2007
IEEE
108views VLSI» more  FCCM 2007»
15 years 4 months ago
Configurable Transactional Memory
Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programmi...
Christoforos Kachris, Chidamber Kulkarni
ECOOP
1999
Springer
15 years 1 months ago
Providing Persistent Objects in Distributed Systems
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic...
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul ...
83
Voted
PPOPP
2009
ACM
15 years 10 months 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