Abstract
Many options are possible in a cache synchronization (or consistency) scheme for a broadcast system. The authors clarify basic concepts, analyze the handling of shared data, and describe a protocol that is currently being explored. The evolution of options that have been proposed under write-in (or write-back) policy is analyzed. It is shown how the protocol extends this evolution with new methods for efficient busy-wait locking, waiting, and unlocking. The lock scheme allows locking and unlocking to occur in zero time, eliminating the need for test-and-set. The scheme also integrates processor atomic read-modify-write instructions and programmer/compiler busy-wait-synchronized operations under the same mechanism. The wait scheme eliminates all unsuccessful retries from the bus, and allows a process to work while waiting.
Cite
CITATION STYLE
Bitar, P., & Despain, A. M. (1986). MULTIPROCESSOR CACHE SYNCHRONIZATION - ISSUES, INNOVATIONS, EVOLUTION. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 424–433). IEEE. https://doi.org/10.1145/17356.17405
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.