Parallel computing, Distributed computing, Software transactional memory, Operating system and Transactional memory are his primary areas of study. His Parallel computing study incorporates themes from Algorithm, Scalability and Mutual exclusion. Michael L. Scott interconnects Busy waiting, Transaction processing, Multiprocessing, Throughput and Scheduling in the investigation of issues within Distributed computing.
His Software transactional memory research is multidisciplinary, incorporating perspectives in Computer security, Overhead, Synchronization and Commitment ordering. His Operating system research focuses on subjects like Embedded system, which are linked to Latency, Pipeline burst cache, Superscalar and Sequential access. His Transactional memory research focuses on Cache and how it connects with Concurrency control.
His primary areas of study are Distributed computing, Parallel computing, Shared memory, Operating system and Transactional memory. His work carried out in the field of Distributed computing brings together such families of science as Thread, Cache, Transaction processing, Synchronization and Data structure. His work deals with themes such as Concurrent data structure, Queue, Scalability and Mutual exclusion, which intersect with Parallel computing.
His Shared memory study integrates concerns from other disciplines, such as Computer architecture, Distributed shared memory, Multiprocessing, Computer network and Cache-only memory architecture. His Operating system research focuses on Software in particular. Michael L. Scott has researched Transactional memory in several fields, including Compiler and Concurrency.
Michael L. Scott spends much of his time researching Transactional memory, Parallel computing, Distributed computing, Data structure and Programming language. His Transactional memory research incorporates themes from Software engineering, Scalability, Compiler and Commit. The concepts of his Parallel computing study are interwoven with issues in Queue, Locality, Thread and Persistent data structure.
His Distributed computing study combines topics from a wide range of disciplines, such as Cache, CUDA, Os kernel, Finite-state machine and Scheduling. The Data structure study combines topics in areas such as Correctness, Crash and Software transactional memory. His studies deal with areas such as Memory model and Multi-core processor as well as Programming language.
His primary areas of investigation include Transactional memory, Parallel computing, Distributed computing, Cache and Atomicity. To a larger extent, Michael L. Scott studies Database transaction with the aim of understanding Transactional memory. The various areas that Michael L. Scott examines in his Parallel computing study include Virtual memory, Event and Thread.
In his articles, Michael L. Scott combines various disciplines, including Distributed computing and Fair queuing. The concepts of his Cache study are interwoven with issues in Software versioning and Linearizability. His research investigates the link between Atomicity and topics such as Compiler that cross with problems in Data flow diagram, Object, Software and Computer hardware.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Algorithms for scalable synchronization on shared-memory multiprocessors
John M. Mellor-Crummey;Michael L. Scott.
ACM Transactions on Computer Systems (1991)
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
Maged M. Michael;Michael L. Scott.
principles of distributed computing (1996)
Programming Language Pragmatics
Michael L. Scott.
Advanced contention management for dynamic software transactional memory
William N. Scherer;Michael L. Scott.
principles of distributed computing (2005)
Energy-efficient processor design using multiple clock domains with dynamic voltage and frequency scaling
G. Semeraro;G. Magklis;R. Balasubramonian;D.H. Albonesi.
high-performance computer architecture (2002)
NOrec: streamlining STM by abolishing ownership records
Luke Dalessandro;Michael F. Spear;Michael L. Scott.
acm sigplan symposium on principles and practice of parallel programming (2010)
The Coign automatic distributed partitioning system
Galen C. Hunt;Michael L. Scott.
operating systems design and implementation (1999)
Lowering the Overhead of Nonblocking Software Transactional Memory
Virendra J. Marathe;Michael F. Spear;Christopher Heriot;Athul Acharya.
Adaptive software transactional memory
Virendra J. Marathe;William N. Scherer;Michael L. Scott.
international symposium on distributed computing (2005)
Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors
Maged M. Michael;Michael L. Scott.
Journal of Parallel and Distributed Computing (1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: