Waiting Algorithms for Synchornization in Large-scale Multiprocessors
Through analysis and experiments, this paper investigates two-phase waiting algorithms to minimize the cost of waiting for synchronization in large-scale multiprocessors. In a two-phase algorithm, a thread first waits by polling a synchronization variable.
Main Authors: | Lim, Beng-Hong, Agarwal, Anant |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149702 |
Similar Items
-
The MIT Alewife Machine: A Large-scale Distributed-memory Multiprocessor
by: Agarwal, Anant, et al.
Published: (2023) -
Low-cost Support for Fine-grain Synchronization in Multiprocessors
by: Kranz, David, et al.
Published: (2023) -
Reactive Synchronization Algorithms for Multiprocessors
by: Lim, Beng-Hong
Published: (2023) -
Reactive synchronization algorithms for multiprocessors
by: Lim, Beng-Hong
Published: (2007) -
Synchornizing Clocks in a Distributed System
by: Lundelius, Jennifer
Published: (2023)