Back to Results
First PageMeta Content
Binary trees / Graph theory / Parallel computing / Tree traversal / Barrier / Mutual exclusion / Tree / T-tree / Busy waiting / Computing / Concurrency control / Computer programming


Tech. Rep. 429, Computer Science Dept., Univ. of Rochester. Fast, Contention-Free Combining Tree Barriers Michael L. Scott Computer Science Department
Add to Reading List

Document Date: 2011-03-27 18:33:42

Open Document

File Size: 162,07 KB

Share Result on Facebook

City

Abstract Counter / /

Company

Argonne National Laboratory / /

/

Facility

John M. Mellor-Crummey Computer Science Department Rice University / Advanced Computing Research Facility / Contention-Free Combining Tree Barriers Michael L. Scott Computer Science Department University of Rochester Rochester / Rice University / University of Rochester / /

IndustryTerm

saturated memory bank / subsequent search / simplest barrier algorithms / processor-memory interconnection network / busy-wait synchronization algorithms / /

Organization

Rice University / Contention-Free Combining Tree Barriers Michael L. Scott Computer Science Department University of Rochester Rochester / University of Rochester / Univ. of Rochester / National Science Foundation / /

Person

Hill / Michael L. Scott / John M. Mellor-Crummey / /

/

ProgrammingLanguage

C / /

Technology

deterministic ordering If processors / caching / busy-wait synchronization algorithms / shared memory / simplest barrier algorithms / 1992 Abstract Counter-based algorithms / /

SocialTag