B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, pages 22--31, October 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....on line algorithms for this problem. 1 Introduction Many on line problems of great practical importance arise in distributed data management. As a result, there has recently been a lot of research interest in problems such as page migration, page replication and distributed paging, see e.g. [BS89, W91, BFR92, ABF93a, ABF93b, K93, AK94, LRWY94]. In page migration and replication problems, a set of memory pages must be distributed in a network of processors, each of which has its local memory, so that a sequence of memory accesses can be processed efficiently. Specifically, the goal is to minimize the communication cost. If a processor p ....

....p wants to access a page, this page must be brought into p s local memory, provided the page is not present at p yet. Loosely speaking, the goal is to minimize the number of times at which a requested page is not present in the corresponding local memory. Bartal et al. BFR92] and Awerbuch et al. [ABF93b] studied the allocation version of this problem, when multiple copies of one page may exist. In this paper we examine the migration version of the distributed paging problem; i.e. only one copy of each page may exist. For the allocation version of this problem, Bartal et al. presented an ....

[Article contains additional citation context not shown here]

B. Awerbuch, Y. Bartal and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22-32, 1993.

....one another s requests as well as in storage decisions. A number of recent studies have discussed the benefits of cooperative caching for distributed file systems and large scale information systems such as digital libraries and the World Wide Web. These studies include analytical results (e.g. [3, 22]) simulation experiments (e.g. 8, 16, 17, 28] and prototypes and products (e.g. Harvest [9, 11] xFS [1] The widely deployed and studied Harvest cache system [9] employs a hierarchical arrangement of object caches to improve access performance. In the Squid cache system [30] which is a ....

....The placement component determines where to place the copies of the objects. The search component directs each request to an appropriate copy of the requested object. Finally, the consistency component maintains the desired level of consistency among the various copies of an object. In [3], Awerbuch, Bartal, and Fiat study a general on line cooperative caching problem on arbitrary networks and present a polylog(n) competitive algorithm, where n is the number of nodes in the network. Their result is impressive in that it addresses the search, placement, and consistency problems in a ....

[Article contains additional citation context not shown here]

B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive distributed paging. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22--31, November 1993.

....on line algorithms for this problem. 1 Introduction Many on line problems of practical significance arise in distributed data management. As a result, there has recently been a lot of research interests in problems such as page migration, page replication and distributed paging, see e.g. [1, 2, 3, 5, 6, 8, 10, 12]. In page migration and replication problems, a set of memory pages must be distributed in a network of processors, each of which has its local memory, so that a sequence of memory accesses can be processed efficiently. Specifically, the goal is to minimize the communication cost. If a processor ....

....can be stored in the entire network. Unfortunately, this competitive ratio is too high to be meaningful in practice. In this paper we study the migration problem under the assumption that every local memory has a fixed finite capacity. More precisely, every local memory consists of k block [1] [2]; k] each of which can hold one page. We assume that the local memories are direct mapped, i.e. each processor uses a hash function in order to locate pages in its local memory. Specifically, all processors use the same hash function h. This implies that whichever local memory a page b ....

[Article contains additional citation context not shown here]

B. Awerbuch, Y. Bartal and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22-32, 1993.

....into the cache. The above work, with the exception of [LYW91, LWY93] is rather pragmatic and experimental in that it relies, to a large extent, on ad hoc heuristics. A more fundamental line of research has been pursued in the area of online algorithms for data migration and replication (e.g. [ABF93a, ABF93b, HuWo94]) However, none of these pa pers considers distributed and hierarchical storage (i.e. matches the distributed caching problem) Furthermore, a common problem with the theoretical work on online algo rithms is the exclusive focus on the asymptotic worst case behavior relative to a fictituous ....

B. Awerbuch, Y. Bartal, A. Fiat: Heat & Dump: Competi- tive Distributed Paging, IEEE Symposium on Foundations of Com- puter Science, 1993

No context found.

B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, pages 22--31, October 1993.

.... of 45 K) for the K server problem in any n point metric space where n K , improving a lower bound from [KRR94] of 12 flog K; log log ng) We note that the improved lower bound for the K server problem also implies an improved lower bound for the distributed paging problem, as shown in [ABF93] The lower bounds for the K server problem follow from a general reduction from MTS on a metric space of K 1 points to the K server problem in the same metric space. The rest of the discussion is therefore in terms of the MTS problem. An observation made in [KRR94, BKRS00, Bar96] that played ....

B. Awerbuch, Y. Bartal, and A. Fiat, Heat & dump: Competitive distributed paging, Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science (Palo Alto, CA), 1993, pp. 22-31.

....work cells upon the request of the operators of these work cells. We assume that the requests are issued at the location of service, and thus there is no central control at which the request is received. Motivated by the fact that the problem is also related to problems of data management [9, 2] (and also mentioned in the context of the mobile user problem [6] and in order to make our discussion more general, we will discuss the costly message (distributed) setting in terms of networks and processors. The requests are issued by the processors, and information is passed by messages over ....

B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, pages 22--31, October 1993.

....algorithm are given in [ABF1] but the question of giving a deterministic counterpart to Theorem SBA is still open. Motivated by the famous [MMS] conjecture, we conjecture that the constrained file allocation problem has a deterministic competitive ratio of O(m) on arbitrary topologies. [ABF2] gives an O(log m) competitive randomized algorithm for the constrained file allocation problem on the uniform network. We hazard the guess that similar results can be obtained by randomized algorithms against oblivious adversaries for other network topologies as well. The question of what ....

B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, pages 22-31, October 1993.

No context found.

B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Competitive distributed paging. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22--31, November 1993.

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