82 search results - page 12 / 17 » A Concurrent Calculus with Atomic Transactions |
181
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
POPL
2004
ACM
15 years 3 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
183
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
ASPLOS
2010
ACM
15 years 4 months ago
2010
ACM
With the right techniques, multicore architectures may be able to continue the exponential performance trend that elevated the performance of applications of all types for decades...
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Transactional memory (TM) has recently emerged as an effective tool for extracting fine-grain parallelism from declarative critical sections. In order to make STM systems...