Sciweavers

122 search results - page 22 / 25
» Memory models for open-nested transactions
Sort
View
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
14 years 2 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
LCPC
2009
Springer
14 years 5 days ago
Fastpath Speculative Parallelization
Abstract. We describe Fastpath, a system for speculative parallelization of sequential programs on conventional multicore processors. Our system distinguishes between the lead thre...
Michael F. Spear, Kirk Kelsey, Tongxin Bai, Luke D...
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
13 years 12 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
IPPS
2008
IEEE
14 years 2 months ago
A deterministic multi-way rendezvous library for haskell
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
Nalini Vasudevan, Satnam Singh, Stephen A. Edwards
HOTOS
2007
IEEE
13 years 11 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell