Distributed Paging for General Networks

Ajtai, 1994, A theory of competitive analysis for distributed algorithms Awerbuch, 1993, Competitive distributed file allocation Awerbuch, 1993, Heat & dump: Randomized competitive distributed paging Agarwal, Chaken, Johnson, Kranz, Kubiatowicz, Kurihara, Lim, Maa, Nussbaum, The mit-alewife machine: A large-scale distributed memory multiprocessor, Mit/lcs/tm 454, MIT, 1991 Albers, 1994, New on-line algorithms for the page replication problem Albers, 1995, Page migration with limited local memory capacity B. Awerbuch, D. Peleg, On-line tracking of mobile users, TM-410, Laboratory for Computer Science, MIT, August 1989 Awerbuch, 1990, Sparse partitions Awerbuch, 1991, Concurrent online tracking of mobile users Bartal, 1992, Competitive algorithms for distributed data management Borodin, 1987, An optimal on-line algorithm for metrical task systems D. L. Black, D. D. Sleator, Competitive algorithms for replication and migration problems, CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989 Chrobak, 1993, Optimal multiprocessor migration algorithms using work functions, 762 Cooper, 1992, Using compiler technology to drive advanced microprocessors Dally, 1989, The J-machine: A fine-grain concurrent computer Dowdy, 1982, Comparative models of the file assignment problem, Computing Surveys, 14, 10.1145/356876.356883 A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, N. E. Young, Competitive paging algorithms, Carnegie Mellon University, 1988 Gavish, 1990, Dynamic file migration in distributed computer systems, Comm. ACM, 33, 177, 10.1145/75577.75583 Johnson, 1992, The impact of communication locality on large-scale multiprocessor performance Karlin, 1988, Competitive snoopy caching, Algorithmica, 3, 77, 10.1007/BF01762111 Koga, 1993, Randomized on-line algorithms for the page replication problem, 762 Liskov, 1992, Preliminary design of the thor object-oriented database system Lenoski, 1990, The directory-based cache coherence protocol for the dash multiprocessor Lam, 1991, Effective “static-graph” reorganization to improve locality in garbage-collected systems Lund, 1994, On-line distributed data management Lam, 1991, Loop transformation theory and algorithm to maximize parallelism, IEEE Trans. Parallel and Distributed Systems Lam, 1992, Compilation techniques to achieve parallelism and locality Morgan, 1988, Optimal program and data locations in computer networks, CACM, 20, 124 Manasse, 1988, Competitive algorithms for on-line problems Palmer, 1991, Fodi: a cache that learns to fetch Robinson, 1990, Data cache management using frequency-based replacement Raghavan, 1989, Memory versus randomization in on-line algorithms, 372 Sleator, 1985, Amortized efficiency of list update and paging rules Stamos, 1984, Static grouping of small objects to enhance performance of a paged virtual memory, ACM Trans. Computer Systems, 2, 155, 10.1145/190.194 Kilburn, 1962, One-level storage system, IRE Trans. Electronic Computers, 2, 223, 10.1109/TEC.1962.5219356 Westbrook, 1991, Randomized algorithms for multiprocessor page migration Westbrook, 1993, Greedy on-line Steiner tree and generalized Steiner problems, 709 Young, 1991, Competitive paging as cache size varies Yongdong, 1991