Competitive snoopy caching
From MaRDI portal
Publication:1103391
DOI10.1007/BF01762111zbMath0645.68034WikidataQ56140916 ScholiaQ56140916MaRDI QIDQ1103391
Publication date: 1988
Published in: Algorithmica (Search for Journal in Brave)
potential functions; shared memory; communication costs; page replacement; multiprocessor system; cache coherence; amortized analysis; shared-bus multiprocessors; snoopy caching
68N25: Theory of operating systems
Related Items
The weighted list update problem and the lazy adversary, On-line algorithms for 2-coloring hypergraphs via chip games