Baruch Awerbuch, Yair Bartal, Amos Fiat  Home/Search
Context Related
| math.tau.ac.il/~fiat/distgn.ps berkeley.edu/~yair...extraspaceDP.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~fiat/ (more) From: berkeley.edu/~yairb/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Distributed paging [BFR92, ABF93b, AK95] deals 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 the file allocation problem [BS89, West91, CLRW93, ABF93a, WY93, Koga93, AK94, LRWY94] where infinite nodal memory capacity is assumed. In contrast the distributed paging problem makes the more realistic assumption that nodal memory capacity is limited.... (Update)
Cited by: More
The Distributed k-Server Problem - A Competitive Distributed.. - Bartal, Rosen (1992) (Correct)
Application-oriented Self-organizing Hierarchical.. - Richa, Obraczka, Sen (Correct)
On Approximating Arbitrary Metrics by Tree Metrics - Bartal (1998) (Correct)
Similar documents (at the sentence level):
43.3%: Distributed Paging for General Networks - Awerbuch, Bartal, Fiat (1996) (Correct)
19.3%: Competitive Distributed File Allocation - Awerbuch, Bartal, Fiat (1993) (Correct)
6.0%: Competitive Algorithms for Distributed Data Management - Bartal, Fiat, Rabani (Correct)
Active bibliography (related documents): More All
1.3: Distributively-Competitive Online Paging for.. - Awerbuch, Bartal, Fiat (1994) (Correct)
0.7: Distributed Paging - Bartal (1996) (Correct)
0.4: On Page Migration and Other Relaxed Task Systems - Bartal, Charikar, Indyk (1997) (Correct)
Similar documents based on text: More All
0.2: Heat & Dump: Competitive Distributed Paging - Awerbuch, Bartal, Fiat (1993) (Correct)
0.1: Dump: Competitive Distributed Paging - Awerbuch, Bartal, Fiat (1993) (Correct)
0.1: Competitive Non-Preemptive Call Control - Awerbuch, Bartal, Fiat.. (Correct)
Related documents from co-citation: More All
19: Competitive Algorithms for Distributed Data Management - Bartal, Fiat et al.
18: Competitive Distributed File Allocation - Awerbuch, Bartal et al. - 1993
12: line distributed data management (context) - Lund, Reingold et al. - 1996
BibTeX entry: (Update)
B. Awerbuch, Y. Bartal, and A. Fiat. Distributed Paging for General Networks. In Proc. of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 574-583, January 1996. http://citeseer.ist.psu.edu/awerbuch96distributed.html More
@inproceedings{ awerbuch96distributed,
author = "Awerbuch and Bartal and Fiat",
title = "Distributed Paging for General Networks",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1996",
url = "citeseer.ist.psu.edu/awerbuch96distributed.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
357 The directorybased cache coherence protocol for the dash mul.. (context) - Lenoski, Laundo et al. - 1990
234 Competitive snoopy caching (context) - Karlin, Manasse et al. - 1988
191 The mit-alewife machine: A large-scale distributed memory mu.. - Chaiken, Kranz et al. - 1991
147 Competitive Paging Algorithms - Fiat, Karp et al. - 1988
104 Sparse partitions (context) - Awerbuch, Peleg - 1990
101 Competitive algorithms for distributed data management - Bartal, Fiat et al. - 1992
100 Competitive Algorithms for On-Line Problems (context) - Manasse, McGeoch et al. - 1988
96 Concurrent online tracking of mobile users - Awerbuch, Peleg - 1991
93 Comparative models of the file assignment problem (context) - Dowdy, Foster - 1982
93 Fido:a cache that learns to fetch (context) - Palmer, Zdonik - 1991
88 Data cache management using frequency-based replacement (context) - Robinson, Devarankonda - 1990
75 Machine: A fine-grain concurrent computer (context) - Dally, J- - 1989
73 Competitive distributed file allocation - Awerbuch, Bartal et al. - 1993
72 An Optimal On-Line Algorithm for Metrical Task Systems (context) - Borodin, Linial et al. - 1987
61 Memory versus Randomization in On-Line Algorithms (context) - Raghavan, Snir - 1989
61 Competitive Algorithms for Replication and Migration Problem.. (context) - Black, Sleator - 1989
42 Line Distributed Data Management (context) - Lund, Reingold et al. - 1994
36 The impact of communication locality on large-scale multipro.. - Johnson - 1992
33 Static grouping of small objects to enhance performance of a.. (context) - Stamos - 1984
28 Randomized Algorithms for Multiprocessor Pa ge Migration - Westbrook - 1991
23 A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes et al. - 1994
22 Loop transformation theory and algorithm to maximize paralle.. (context) - Lam, Wolf - 1991
20 New On-line Algorithms for the Page Replication Problem - Albers, Koga - 1994
20 Optimal program and data locations in computer networks (context) - Morgan, Levin - 1988
17 IRE Transactions on Electronic Computers (context) - Kilburn, Edwards et al. - 1962
15 Dynamic File Migration in Distributed Computer Systems (context) - Gavish, Sheng - 1990
14 Optimal Multiprocessor Migration Algorithms Using Work Funct.. (context) - Chrobak, Larmore et al. - 1993
14 Randomized On-line Algorithms for the Page Replication Probl.. (context) - Koga - 1993
11 Preliminary design of the thor object-oriented database syst.. (context) - Liskov - 1992
10 Dump: Randomized competitive distributed paging (context) - Awerbuch, Bartal et al. - 1993
8 Page Migration with Limited Local Memory Capacity - Albers, Koga - 1995
6 Greedy On-Line Steiner Tree and Generalized Steiner Problems (context) - Westbrook, Yan - 1993
4 line tracking of mobile users (context) - Awerbuch, Peleg - 1989
4 Competitive Paging as Cache Size Varies (context) - Young - 1991
3 Compilation techniques to achieve parallelism and locality (context) - Lam, Wolf - 1992
2 Using compiler technology to drive advanced microprocessors - Cooper - 1992
1 static-graph (context) - Lam, Moher et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~fiat/): More
Randomized Robot Navigation Algorithms - Berman, Blum, Fiat, Karloff.. (1996) (Correct)
Packet Routing via Min-Cost Circuit Routing - Awerbuch, Azar, Fiat (1996) (Correct)
Experimental Studies of Access Graph Based Heuristics: Beating.. - Fiat, Rosen (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC