M
Michael L. Scott
Researcher at University of Rochester
Publications - 241
Citations - 14363
Michael L. Scott is an academic researcher from University of Rochester. The author has contributed to research in topics: Shared memory & Transactional memory. The author has an hindex of 59, co-authored 239 publications receiving 13906 citations. Previous affiliations of Michael L. Scott include Office of Technology Transfer & Oregon State University.
Papers
More filters
Journal ArticleDOI
Algorithms for scalable synchronization on shared-memory multiprocessors
TL;DR: The principal conclusion is that contention due to synchronization need not be a problemin large-scale shared-memory multiprocessors, and the existence of scalable algorithms greatly weakens the case for costly special-purpose hardware support for synchronization, and provides protection against so-called “dance hall” architectures.
Book
Algorithms for scalable synchronization on shared-memory multiprocessors
TL;DR: In this article, the authors present a scalable algorithm for spin locks that provides reasonable latency in the absence of contention, requires only a constant amount of space per lock, and requires no hardware support other than a swap-with-memory instruction.
Proceedings ArticleDOI
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
TL;DR: Experiments on a 12-node SGI Challenge multiprocessor indicate that the new non-blocking queue consistently outperforms the best known alternatives; it is the clear algorithm of choice for machines that provide a universal atomic primitive (e.g., compare_and_swap or load_linked/store_conditional).
Proceedings ArticleDOI
Energy-efficient processor design using multiple clock domains with dynamic voltage and frequency scaling
Greg Semeraro,Grigorios Magklis,Rajeev Balasubramonian,David H. Albonesi,Sandhya Dwarkadas,Michael L. Scott +5 more
TL;DR: An alternative approach is described, which is called a multiple clock domain (MCD) processor, in which the chip is divided into several clock domains, within which independent voltage and frequency scaling can be performed.
Proceedings ArticleDOI
Advanced contention management for dynamic software transactional memory
TL;DR: This work considers both visible and invisible versions of read access, and benchmarks that vary in complexity, level of contention, tendency toward circular dependence, and mix of reads and writes, and identifies a candidate default policy.