Distributed paging for general networks

Journal of Algorithms

Volumn 28, Issue 1, 1998, Pages 67-104

  Awerbuch, Baruch ^a,b   Bartal, Yair ^c   Fiat, Amos ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002013494     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0924     Document Type: Article

References (39)

1. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, A theory of competitive analysis for distributed algorithms, in "Proc. of the 35th Ann. IEEE Symp. on Foundations of Computer Science," pp. 401-411, October 1994.
2. B. Awerbuch, Y. Bartal, and A. Fiat, Competitive distributed file allocation, in "Proc. 25th ACM Symp. on Theory of Computing," pp. 164-173, May 1993.
3. B. Awerbuch, Y. Bartal, and A. Fiat, Heat & dump: Randomized competitive distributed paging, in "Proc. 34th IEEE Symp. on Foundations of Computer Science," IEEE, 1993, to appear.
4. Agarwal, Chaken, Johnson, Kranz, Kubiatowicz, Kurihara, Lim, Maa, and Nussbaum, The mit-alewife machine: A large-scale distributed memory multiprocessor, Mit/lcs/tm 454, MIT, 1991.
5. S. Albers and H. Koga, New on-line algorithms for the page replication problem, in "Proceedings of the 4th Scandinavian Workshop on Algorithmic Theory," Aarhus, Denmark, July 1994.
6. S. Albers and H. Koga, Page migration with limited local memory capacity, in "Proc. of the 4th Workshop on Algorithms and Data Structures," August 1995, to appear.
7. B. Awerbuch and D. Peleg, On-line tracking of mobile users, Technical Memo TM-410, Laboratory for Computer Science, MIT, August 1989.
8. B. Awerbuch and D. Peleg, Sparse partitions, in "Proc. 31st IEEE Symp. on Foundations of Computer Science," pp. 503-513, 1990.
9. B. Awerbuch and D. Peleg, Concurrent online tracking of mobile users, in "Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, Zurich, Switzerland," September 1991.
10. Y. Bartal, A. Fiat, and Y. Rabani, Competitive algorithms for distributed data management, in "Proc. 24th ACM Symp. on Theory of Computing," pp. 39-50, 1992.
11. A. Borodin, N. Linial, and M. Saks, An optimal on-line algorithm for metrical task systems, in "Proc. of the 19th Ann. ACM Symp. on Theory of Computing," pp. 373-382, May 1987.
12. D. L. Black and D. D. Sleator, Competitive algorithms for replication and migration problems, Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989.
13. M. Chrobak, L. Larmore, N. Reingold, and J. Westbrook, Optimal multiprocessor migration algorithms using work functions, in "Proc. of the 4th International Symp. on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 762, pp. 406-415, Springer-Verlag, Hong Kong, 1993.
14. K. D. Cooper, Using compiler technology to drive advanced microprocessors, in "DARPA Software Technology Conference," pp. 42-49, April 1992.
15. W. J. Dally et al., The J-machine: A fine-grain concurrent computer, in "Proceedings of the IFIP Congress," (G. X. Ritter, Ed.), pp. 1147+3, North-Holland, Amsterdam, 1989.
16. D. Dowdy and D. Foster, Comparative models of the file assignment problem, Computing Surveys 14(2) (1982).
17. A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young, Competitive paging algorithms, Technical Report, Carnegie Mellon University, 1988.
18. B. Gavish and O. R. L. Sheng, Dynamic file migration in distributed computer systems, Comm. ACM 33(2) (1990), 177-189.
19. K. Johnson, The impact of communication locality on large-scale multiprocessor performance, in "19th International Symposium on Computer Architecture," IEEE, May 1992, to appear.
20. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator, Competitive snoopy caching, Algorithmica 3(1) (1988), 77-119.
21. H. Koga, Randomized on-line algorithms for the page replication problem, in "Proc. of the 4th International Symp. on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 762, pp. 436-445, Springer-Verlag, Hong Kong, 1993.
22. B. Liskov, Preliminary design of the thor object-oriented database system, in "DARPA Software Technology Conference," pp. 50-62, April 1992.
23. L. Lenoski, J. Laundo, K. Gharachorloo, A. Gupta, and J. Hennessy, The directory-based cache coherence protocol for the dash multiprocessor, in "Proc. of 17th Intern. Symp. on Computer Architecture," pp. 148-159, 1990.
24. M. Lam, T. G. Moher, and P. Wilson, Effective "static-graph" reorganization to improve locality in garbage-collected systems, in "Proceedings of ACM SIGPLAN," June 1991, Conference on Programming Language Design and Implementation.
25. C. Lund, N. Reingold, J. Westbrook, and D. Van, On-line distributed data management, in "Proc. of European Symp. on Algorithms," 1994.
26. M. S. Lam and M. E. Wolf, Loop transformation theory and algorithm to maximize parallelism, IEEE Trans. Parallel and Distributed Systems (1991).
27. M. S. Lam and M. E. Wolf, Compilation techniques to achieve parallelism and locality, in "DARPA Software Technology Conference," pp. 150-158, Los Angeles, CA, April 1992.
28. H. L. Morgan and K. D. Levin, Optimal program and data locations in computer networks, CACM 20(5) (1988), 124-130.
29. M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive algorithms for on-line problems, in "Proc. of the 20th Ann. ACM Symp. on Theory of Computing," pp. 322-333, May 1988.
30. M. Palmer and S. B. Zdonik, Fodi: a cache that learns to fetch, in "Proceedings of the 17th International Conference on Very Large Data Bases, Barcelona," pp. 255-264, Sept. 1991.
31. J. T. Robinson and M. V. Devarankonda, Data cache management using frequency-based replacement, in "SIGMETRICS, Boulder, CO," pp. 134-142, May 1990. (Published as "Performance Evaluation Review 18.")
32. P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, in "16th International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 372, pp. 687-703, Springer-Verlag, Berlin/New York, 1989.
33. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28(2) (1985), 202-208.
34. J. W. Stamos, Static grouping of small objects to enhance performance of a paged virtual memory, ACM Trans. Computer Systems 2(2) (1984), 155-180.
35. T. Kilburn, D. Edwards, M. Lanigan, and F. Summer, 05One-level storage system, IRE Trans. Electronic Computers 2 (1962), 223-235.
36. J. Westbrook, Randomized algorithms for multiprocessor page migration, in "Proc. of DIMACS Workshop on On-Line Algorithms," Amer. Math. Soc., Providence, February 1991.
37. J. Westbrook and D. K. Yan, Greedy on-line Steiner tree and generalized Steiner problems, in "Proc. of the 3rd Workshop in Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 709, pp. 622-633, Springer-Verlag, Montréal, 1993.
38. N. E. Young, Competitive paging as cache size varies, in "Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms," January 1991.
39. W. Yongdong and L. A. Rowe, "Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture," SIGMOD Conference, 367-376, 1991.