Reactive Synchronization Algorithms for Multiprocessors
Efficient synchronization algorithms are hard to design because their performance depends on run-time factors that are hard to predict. In particular, the designer has a choice of protocols to implement the synchronization operation, and a choice of wait
Main Author: | Lim, Beng-Hong |
---|---|
Other Authors: | Agarwal, Anant |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149806 |
Similar Items
-
Reactive synchronization algorithms for multiprocessors
by: Lim, Beng-Hong
Published: (2007) -
Low-cost Support for Fine-grain Synchronization in Multiprocessors
by: Kranz, David, et al.
Published: (2023) -
Waiting Algorithms for Synchornization in Large-scale Multiprocessors
by: Lim, Beng-Hong, et al.
Published: (2023) -
A complexity-based classification for multiprocessor synchronization
by: Ellen, Faith, et al.
Published: (2021) -
Clocking and synchronization with a fault-tolerant multiprocessor,
by: Krauss, Howard Ronald
Published: (2013)