Snoopy cache test-and-test-and-set without execessive bus contention
- 1 May 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 18 (2) , 25-32
- https://doi.org/10.1145/88237.88240
Abstract
This paper analyzes the burst of bus traffic that occurs when a lock is released that is being waited for in a test-and-test-and-set spinloop. It is typically O ( N ) and can be O ( N 2 ), depending on assumptions about system behaviour, where N is the number of processors. Supporting a single feature in the bus interface, abandoning pending lock requests, reduces this to O (1). Such a feature is already possible on some systems and busses, but has not been applied to synchronization.Keywords
This publication has 4 references indexed in Scilit:
- The performance implications of thread management alternatives for shared-memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient synchronization primitives for large-scale cache-coherent multiprocessorsPublished by Association for Computing Machinery (ACM) ,1989
- Adaptive backoff synchronization techniquesPublished by Association for Computing Machinery (ACM) ,1989
- Dynamic decentralized cache schemes for mimd parallel processorsPublished by Association for Computing Machinery (ACM) ,1984