Back to Results
First PageMeta Content
Binary trees / Computer programming / R-tree / Trie / B+ tree / T-tree / Linked list / Tree traversal / Distributed data storage / Graph theory / B-tree / Computing


Cache Craftiness for Fast Multicore Key-Value Storage Yandong Mao, Eddie Kohler† , Robert Morris MIT CSAIL, † Harvard University Abstract We present Masstree, a fast key-value database designed for
Add to Reading List

Document Date: 2015-04-29 10:31:18


Open Document

File Size: 260,50 KB

Share Result on Facebook

City

Bern / /

Company

Masstree / AMD / Yahoo! / Intel / /

Country

Switzerland / /

Currency

pence / USD / /

IndustryTerm

search schemes / on many previous systems / storage server / lock-free algorithms / database systems / keys / non-persistent hash table server / network key-value storage server / writer coordination protocols / reader coordination algorithm / 1.90× / sequential algorithms / multicore hardware / binary search / tree modification algorithms / storage systems / request processing / cache coherence protocol / per-core / Linear search / /

NaturalFeature

Shore-MT / /

OperatingSystem

Linux / L3 / /

Organization

Harvard University / MIT / /

Person

Robert Morris / Eddie Kohler / Figure / /

Position

though inefficient / optimistic writer / writer / forward / /

ProgrammingLanguage

NIL / /

Technology

tree modification algorithms / lock-free algorithms / Linux / writer coordination protocols / random access / UDP / shared memory / cache coherence protocol / Ethernet / three chips / 8431 chips / reader coordination algorithm / caching / /

SocialTag