Distributed paging for general networks

Distributed pagingdeals with the dynamic allocation of copies of files in a distributed network as to minimize the total communication cost over a sequence of read and write requests.Most previous work deals with thefile allocationproblem, where infinite nodal memory capacity is assumed. In contrast the distributed paging problem makes the more realistic assumption that nodal memory capacity is limited. Former work on distributed paging deals with the problem only in the case of a uniform network topology.This paper gives the first distributed paging algorithm forgeneralnetworks. The algorithm is competitive in storage and communication. The competitive rates are poly-logarithmic in the total number of network nodes and the diameter of the network.

[1]  Jeffery R. Westbrook,et al.  Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems , 1993, WADS.

[2]  W DowdyLawrence,et al.  Comparative Models of the File Assignment Problem , 1982 .

[3]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[4]  Monica S. Lam,et al.  A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..

[5]  Donald Yeung,et al.  THE MIT ALEWIFE MACHINE: A LARGE-SCALE DISTRIBUTED-MEMORY MULTIPROCESSOR , 1991 .

[6]  Cynthia Dwork,et al.  A theory of competitive analysis for distributed algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[9]  Tom Kilburn,et al.  One-Level Storage System , 1962, IRE Trans. Electron. Comput..

[10]  James W. Stamos,et al.  Static grouping of small objects to enhance performance of a paged virtual memory , 1984, TOCS.

[11]  Amos Fiat,et al.  Heat and Dump: competitive distributed paging , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[13]  Andrew A. Chien,et al.  The J-Machine: A Fine Grain Concurrent Computer , 1989 .

[14]  Anoop Gupta,et al.  The directory-based cache coherence protocol for the DASH multiprocessor , 1990, ISCA '90.

[15]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[16]  Paul R. Wilson,et al.  Effective “static-graph” reorganization to improve locality in garbage-collected systems , 1991, PLDI '91.

[17]  Baruch Awerbuch,et al.  Concurrent Online Tracking of Mobile Users , 1991, SIGCOMM.

[18]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[19]  J. T. Robinson,et al.  Data cache management using frequency-based replacement , 1990, SIGMETRICS '90.

[20]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[21]  Susanne Albers,et al.  Page Migration with Limited Local Memory Capacity , 1995, WADS.

[22]  K. Cooper.  Using Compiler Technology to Drive Advanced Microprocessors , 1992 .

[23]  Prabhakar Raghavan,et al.  Memory versus randomization in on-line algorithms , 1994, IBM J. Res. Dev..

[24]  Susanne Albers,et al.  New On-Line Algorithms for the Page Replication Problem , 1994, SWAT.

[25]  Kirk L. Johnson.  The impact of communication locality on large-scale multiprocessor performance , 1992, ISCA '92.

[26]  PelegDavid,et al.  Online tracking of mobile users , 1995 .

[27]  Hisashi Koga,et al.  Randomized On-line Algorithms for the Page Replication Problem , 1993, ISAAC.

[28]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[29]  Lawrence A. Rowe,et al.  Cache consistency and concurrency control in a client/server DBMS architecture , 1991, SIGMOD '91.

[30]  Stanley B. Zdonik,et al.  Fido: A Cache That Learns to Fetch , 1991, VLDB.

[31]  Jeffery R. Westbrook.  Randomized Algorithms for Multiprocessor Page Migration , 1994, SIAM J. Comput..

[32]  David L. Black,et al.  Competitive algorithms for replication and migration problems , 1989 .

[33]  Carsten Lund,et al.  On-Line Distributed Data Management , 1994, ESA.

[34]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[35]  Amos Fiat,et al.  Competitive distributed file allocation , 1993, STOC '93.

[36]  Olivia R. Liu Sheng.  Dynamic file migration in distributed computer systems , 1990, CACM.