1996
DOI: 10.1006/jpdc.1996.0002
|View full text |Cite
|
Sign up to set email alerts
|

Cache-Based Synchronization in Shared Memory Multiprocessors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1998
1998
2002
2002

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 45 publications
0
5
0
Order By: Relevance
“…Their work combines lock synchronization with the cache coherency protocol, which requires extra states in the cache controller [3]. For instance, the lock variables and the state information of these lock variables have to be kept in the cache lines, which requires a larger cache tag and brings a further complexity in the cache/memory system design.…”
Section: Background and Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…Their work combines lock synchronization with the cache coherency protocol, which requires extra states in the cache controller [3]. For instance, the lock variables and the state information of these lock variables have to be kept in the cache lines, which requires a larger cache tag and brings a further complexity in the cache/memory system design.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Moreover, these different methods cause useful bus cycles to be wasted because of hold cycles. Hold cycles can be described as the cache response time due to simultaneous cache invalidations in case of a lock release [8,7,3]. Therefore, the efficiency of these techniques is dependent on the application program characteristics and the architecture, such as how frequent the locking attempts occur in the application (i.e., how many CSes exist in the program) or whether there are lots of processors making use of locks.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Some researchers have also proposed the cache memory with synchronization [12,14]. However, they are special mechanisms to the mutual exclusion using the lock and the unlock.…”
Section: Rerated Workmentioning
confidence: 98%
“…A large suit of communication mechanisms has been compared for producer-consumer patterns in [71], including prefetching, deliver [41], write-send [40], update-based coherence, selective updates [42], cache-based locks [72,73], and a cache-based message passing scheme called streamline [74]. Streamline is found to perform best on benchmarks with regular communication patterns.…”
Section: Coherent Shared Memory Optimizationsmentioning
confidence: 99%