744 search results - page 78 / 149 » Software Transactional Memory on Relaxed Memory Models |
121
click to vote
HPCC
2009
Springer
15 years 1 months ago
2009
Springer
Domain-partition (DP) model is a general model for reliability maximization problem under given redundancy. In this paper, an improved DP model is used to formulate a reconfigurati...
164
click to vote
ASPLOS
2008
ACM
15 years 5 months ago
2008
ACM
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...
124
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
148
Voted
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
140
Voted
ANSS
2007
IEEE
15 years 10 months ago
2007
IEEE
New approaches are considered for performance enhancement of discrete-event simulation software. Instead of taking a purely algorithmic analysis view, we supplement algorithmic co...