Competitive algorithms for replication and migration problems
David Lee Black, Daniel D. Sleator · Figshare · 2018
Abstract: "In this paper we consider problems that arise in a shared memory multiprocessor in which memory is physically distributed among a number of memories local to each processor or cluster of processors. The issue we address is that of deciding which local memories should contain copies of pages of data. In the migration problem we operate under the constraint that a page must be kept in exactly one local memory. In the replication problem we allow a page to be kept in any subset of the local memories, but do not allow a local memory to drop a page once it has it.For interconnection topologies that are complete graphs, or trees we have obtained efficient on-line algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An on-line algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests."
Cited by 96 works. doi:10.1184/r1/6604253 Open-access PDF
Authors
References
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- Fat-trees: Universal networks for hardware-efficient supercomputing
- The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture.
- Competitive snoopy caching
- Competitive algorithms for on-line problems
- Hierarchical cache/bus architecture for shared memory multiprocessors
- Competitive randomized algorithms for non-uniform problems
- Performance Measurements on a 128-Node Butterfly Parallel Processor.
- Competitive management of distributed shared memory
- Dynamic page migration in multiprocessors with distributed global memory