13 search results - page 2 / 3 » TMBean: Optimistic Concurrency in Application Servers Using ... |
SMALLTALK
2007
Springer
13 years 11 months ago
2007
Springer
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
ASPLOS
2008
ACM
13 years 6 months ago
2008
ACM
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
PPOPP
2012
ACM
12 years 9 days 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...
OOPSLA
2007
Springer
13 years 11 months ago
2007
Springer
We present the TIC (Transactions with Isolation and Cooperation) model for concurrent programming. TIC adds to standard transactional memory the ability for a transaction to obser...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...