PACKED-MEMORY CO / Bayer / CONCURRENT CO / EXPONENTIAL CO / LOCK-FREE CO / LL/SC / Ge / /
Country
United States / /
Currency
USD / / /
Facility
Massachusetts Institute of Technology / /
IndustryTerm
later search / search tree points / search operation / prior search / static search tree / oblivious static search trees using program instrumentation / overlay networks / search fails / accounting method / search trees / search proceeds / desired insert/search semantics / cache-oblivious search / typical applications / search operations / file systems / lockfree solutions / oblivious search trees / search tree / cache-oblivious algorithms / static cache-oblivious search tree / linearizable search / file-system applications / static-search-tree update / non-blocking algorithms / /
Organization
National Science Foundation / MIT / Singapore-MIT Alliance / Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman Department of Computer Science SUNY Stony Brook Stony Brook / Massachusetts Institute of Technology / Stata Center / Technion / /
Person
Victor Luchangco / Mark Moir / Bradley C. Kuszmaul / Michael A. Bender Jeremy / Maurice Herlihy / Morgan Kaufmann / Seth Gilbert Bradley / /
Position
librarian / cache-oblivious cost model / counting only cache misses / General / /
Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman Department of Computer Science