Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming
Tweet

connect with us

Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming

Josh Triplett, Portland State University

Paul E. McKenney, IBM Linux Technology Center

Jonathan Walpole, Portland State University

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

BibTeX
@inproceedings {266738,
author = {Josh Triplett and Paul E. McKenney and Jonathan Walpole},
title = {Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming},
booktitle = {2011 USENIX Annual Technical Conference (USENIX ATC 11)},
year = {2011},
address = {Portland, OR},
url = {https://www.usenix.org/conference/usenixatc11/resizable-scalable-concurrent-hash-tables-relativistic-programming},
publisher = {USENIX Association},
month = jun,
}
Download

Presentation Video

Presentation Audio

MP3 Download OGG Download

Download Audio

http://www.usenix.org/media/events/atc11/tech/videos/triplett.mp4

Links

Paper: 
http://www.usenix.org/events/atc11/tech/final_files/Triplett.pdf
Paper (HTML): 
http://www.usenix.org/events/atc11/tech/techAbstracts.html#Triplett
Slides: 
http://www.usenix.org/events/atc11/tech/slides/triplett.pdf

© USENIX

  • Privacy Policy
  • Contact Us