Competitive snoopy caching

DOI10.1007/BF01762111zbMath0645.68034WikidataQ56140916 ScholiaQ56140916MaRDI QIDQ1103391

B. George

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

potential functions; shared memory; communication costs; page replacement; multiprocessor system; cache coherence; amortized analysis; shared-bus multiprocessors; snoopy caching

Mathematics Subject Classification ID

68N25: Theory of operating systems

Related Items

ON THE k-TRUCK SCHEDULING PROBLEM, Preemptive multiprocessor scheduling with rejection, Online algorithms for page replication in rings, Online paging and file caching with expiration times, An optimal online algorithm for scheduling two machines with release times, On the Bahncard problem, Scheduling in the dark, The weighted list update problem and the lazy adversary, On-line algorithms for 2-coloring hypergraphs via chip games, Randomized online interval scheduling, Unfair problems and randomized algorithms for metrical task systems, Preemptive on-line scheduling for two uniform processors, On the power of randomization in on-line algorithms, Randomized competitive algorithms for the list update problem, On-line algorithms for locating checkpoints, A new measure for the study of on-line algorithms, Competitive randomized algorithms for nonuniform problems, Competitive \(k\)-server algorithms, Methods for message routing in parallel machines, MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling, The list update problem and the retrieval of sets, Competitive algorithms for the weighted server problem, Paging more than one page, Connection caching: Model and algorithms., More on weighted servers or FIFO is better than LRU., Competitive distributed file allocation., Online companion caching, New results for online page replication, The CNN problem and other \(k\)-server variants, Competitive distributed decision-making