118 search results - page 18 / 24 » Verifying Correctness of Transactional Memories |
PPOPP
2012
ACM
12 years 2 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...
STORAGESS
2005
ACM
14 years 27 days ago
2005
ACM
Improper access of data buffers is one of the most common errors in programs written in assembler, C, C++, and several other languages. Existing programs and OSs frequently acces...
SOSP
2007
ACM
14 years 4 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
SSS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...