| Document Date: 2012-02-15 11:38:37
Open Document File Size: 253,54 KBShare Result on Facebook
Company TinySTM / STM / Lehman / Intel / Morgan Kaufmann Publishers Inc. / / / Facility University of Rochester / / IndustryTerm word-based software transactional memory / baseline algorithm / Software transactional memory / energy consumption / speculative search starting / speculative search / given chip / even software / search component / remove algorithm / presents hardware / file systems / tree concurrency control algorithms / tree algorithm / search structures / simpler coarse-grained algorithm / concurrent binary search tree / memory management / concurrent queue algorithms / fine-grained locking algorithm / linear search / / NaturalFeature Niagara / / OperatingSystem Linux / / Organization National Science Foundation / Lingxiang Xiang Michael L. Scott Computer Science Department / University of Rochester / / Person Michael L. Scott / M. Herlihy / V / P. Felber / V / MAX TRY NUM / Xiang Michael / / Position s→head / writer / head / programmer / / ProgrammingLanguage Java / C++ / / PublishedMedium The VLDB Journal / / Technology encryption / two UltraSPARC T2+ chips / remove algorithm / one chip / baseline algorithm / java / two chips / locking protocol / Linux / simpler coarse-grained algorithm / fine-grained locking algorithm / B+ tree concurrency control algorithms / J. Algorithms / tree algorithm / sequential consistency / concurrent queue algorithms / given chip / Parallel Processing / / URL http /
SocialTag |
TRANSACT[removed]MSpec: A Design Pattern for Concurrent Data Structures ∗ Lingxiang Xiang Michael L. Scott