Back to Results
First PageMeta Content
Computer programming / Ctrie / Data management / Binary trees / Linked lists / Splay tree / Associative arrays / Hashing / Computing


Concurrent Tries with Efficient Non-Blocking Snapshots Aleksandar Prokopec EPFL Nathan G. Bronson
Add to Reading List

Document Date: 2011-12-21 05:00:43

Open Document

File Size: 413,59 KB

Share Result on Facebook

City

New Orleans / Snapshot / /

Company

Cambridge University Press / MIT Press / Database Systems / Kung / Lehman / Intel / /

Country

United States / /

Currency

USD / /

/

Event

Company Expansion / /

Facility

State University of New York / /

IndustryTerm

quad-core processor / Concurrent binary search trees / multicore processors / extensible hash algorithm / software implementation / iterative algorithm / binary search trees / software implementations / binary search tree / i7 processor / multicore processor / /

Organization

Cambridge University / MIT / State University of New York at Oswego / Stanford / /

Person

William Pugh / Doug Lea / Oswego / Eva Darulova / Y. Lev / V / Tihomir Gvero / Nathan G. Bronson / Aleksandar Prokopec / G. L. Steele Jr. / Cliff Click / G. Bronson Phil Bagwell Martin Odersky Stanford / /

Position

Prime Minister / General / /

ProgrammingLanguage

Java / Scala / /

ProvinceOrState

Louisiana / /

PublishedMedium

Journal of the ACM / Communications of the ACM / /

Technology

2.27 GHz processors / existing algorithm / bmp / multicore processor / PageRank algorithm / 1.165 GHz Sun UltraSPARC-T2 processor / Java / extensible hash algorithm / iterative algorithm / caching / multicore processors / i7 processor / Parallel Processing / /

URL

http /

SocialTag