Sciweavers

PPOPP
2012
ACM
12 years 7 months ago
A speculation-friendly binary search tree
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...
Tyler Crain, Vincent Gramoli, Michel Raynal
GLVLSI
2011
IEEE
344views VLSI» more  GLVLSI 2011»
13 years 3 months ago
Circuit design of a dual-versioning L1 data cache for optimistic concurrency
This paper proposes a novel L1 data cache design with dualversioning SRAM cells (dvSRAM) for chip multi-processors (CMP) that implement optimistic concurrency proposals. In this n...
Azam Seyedi, Adrià Armejach, Adrián ...
USENIX
1994
14 years 22 days ago
Resolving File Conflicts in the Ficus File System
Ficus is a flexible replication facility with optimistic concurrency control designed to span a wide range of scales and network environments. Optimistic concurrency control provi...
Peter L. Reiher, John S. Heidemann, David Ratner, ...
ISCA
2010
IEEE
189views Hardware» more  ISCA 2010»
14 years 4 months ago
RETCON: transactional repair without replay
Over the past decade there has been a surge of academic and industrial interest in optimistic concurrency, i.e. the speculative parallel execution of code regions that have the se...
Colin Blundell, Arun Raghavan, Milo M. K. Martin