Back to Results
First PageMeta Content
Data / Computing / Binary trees / Databases / Schedule / Lock / Linearizability / Serializability / Skew heap / Transaction processing / Data management / Concurrency control


Automatic Fine-Grain Locking using Shape Properties Guy Golan-Gueta Nathan Bronson Alex Aiken
Add to Reading List

Document Date: 2011-08-21 21:41:00

Open Document

File Size: 768,92 KB

Share Result on Facebook

City

Portland / /

Company

Microsoft / /

Country

United States / /

Currency

USD / /

/

IndustryTerm

software concurrency control / balanced search-trees / balanced search trees / exit site / random binary search tree / search trees / object-oriented software / multi-core processors / entry site / incorrect concurrent algorithm / fine-grain locking protocols / database protocols / search tree / search-tree data structures / binary search tree / i7 processor / proposed protocols / domination locking protocol / /

Organization

Stanford University / Tel Aviv University / Technion / /

Person

Eran Yahav / Nathan Bronson Alex Aiken / Guy Golan-Gueta Nathan / /

Position

General / /

Product

Intel Core2 i7 processor / Intel Core2 i7 / /

ProgrammingLanguage

Java / C++ / /

ProvinceOrState

Oregon / /

SportsLeague

Stanford University / /

Technology

previously proposed protocols / Eager Forest-Locking protocol / Apriori Data-Mining algorithm / Java / locking protocol / database protocols / domination locking protocol / Barnes-Hut algorithm / fine-grain locking protocols / two-phased locking protocol / Core2 i7 processor / shared memory / DDL protocols / incorrect concurrent algorithm / by enforcing the domination locking protocol / /

SocialTag