Skip to Main content Skip to Navigation
Conference papers

A speculation-friendly binary search tree

Tyler Crain 1 Vincent Gramoli 2 Michel Raynal 1
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
2 IT - School of Information Technologies [Sydney]
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-00764358
Contributor : Tyler Crain <>
Submitted on : Wednesday, December 12, 2012 - 7:50:19 PM
Last modification on : Friday, July 10, 2020 - 4:20:34 PM

Identifiers

  • HAL Id : hal-00764358, version 1

Collections

CNRS | INRIA | UNIV-RENNES1 | IRISA | IRISA-D1 | INSTITUT-TELECOM | UR1-UFR-ISTIC | UNIV-RENNES | INSA-RENNES

Citation

Tyler Crain, Vincent Gramoli, Michel Raynal. A speculation-friendly binary search tree. 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2012, 2012, New Orleans, United States. ⟨hal-00764358⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

8533

 

Contact                    Legal Notice                    Personal Data