Competitive snoopy caching (Q1103391)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Competitive snoopy caching |
scientific article; zbMATH DE number 4052999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive snoopy caching |
scientific article; zbMATH DE number 4052999 |
Statements
Competitive snoopy caching (English)
0 references
1988
0 references
For a review of the preliminary version of this paper in Discrete algorithms and complexity, Proc. Jap.-US Joint Semin., Kyoto/Jap. 1986, Perspect. Comput. 15, 459-483 (1987), see Zbl 0643.68021.
0 references
multiprocessor system
0 references
snoopy caching
0 references
communication costs
0 references
shared-bus multiprocessors
0 references
amortized analysis
0 references
potential functions
0 references
page replacement
0 references
shared memory
0 references
cache coherence
0 references
