J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems. Oct. 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....little spare capacity, we observe that a threshold based prefetching scheme causes response times to increase by a factor of 2 due to interference, whereas prefetching using NPS decreases response times by 25 . 1 Introduction A number of studies have demonstrated the bene ts of web prefetching [12, 17, 24, 25, 32, 33, 42, 52]. And the attractiveness of prefetching appears likely to rise in the future as the falling prices of disk storage [14] and network bandwidth [41] make it increasingly attractive to trade increased consumption of these resources to improve response time and availability and thus reduce human wait ....

....data to predict URLs that will appear during a subsequent window that ends after the w th non image request to the server. Our prototype uses n=2 and w=10. In general, the hint server can be made to use any prediction algorithm. It can be made to use standard algorithms proposed in the literature [17, 18, 24, 42] or others that utilize more service speci c information such as a news site that prefetches stories relating to topics that interest a given user. We explored other alternatives for prefetching in the two connection architecture. We could have used a Java Applet instead of the JavaScript in ....

[Article contains additional citation context not shown here]

J. Grioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

.... a broad range of applications and services such as data backup [29] prefetching [50] enterprise data distribution [20] Internet content distribution [2] and peer to peer storage [16, 43] can trade increased network bandwidth consumption and possibly disk space for improved service latency [15, 18, 26, 32, 38, 50], improved availability [11, 53] increased scalability [2] stronger consistency [53] or support for mobility [28, 41, 47] Many of these services have potentially unlimited bandwidth demands where incrementally more bandwidth consumption provides incrementally better service. For example, a web ....

....the risk of both self interference, where applications hurt their own performance, and cross interference, where applications hurt other applications performance. Often, applications attempt to achieve this balance by setting magic numbers (e.g. the prefetch threshold in prefetching algorithms [18, 26]) that have little obvious relationship to system goals (e.g. availability or latency) or constraints (e.g. current spare network bandwidth) Our goal is for the operating system to manage network resources in order to provide a simple abstraction of zero cost background transfers. A ....

[Article contains additional citation context not shown here]

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....server trace, our system reduces the average demand request response times by 25 in comparison to a prefetching scheme that uses same prediction techniques and traditional techniques for limiting interference. 1 Introduction A number of studies have demonstrated the bene ts of Web prefetching [13, 18, 27, 28, 35, 36, 43, 53]. And the attractiveness of prefetching appears likely to rise in the future as the falling prices of disk storage [15] and network bandwidth [8, 42] make it increasingly attractive to trade increased disk storage and network bandwidth consumption for improved response time and availability. ....

....be made to use any prediction algorithm. It sees a trace of all HTML documents requested by each client (as each client fetches a pflist.html for each HTML document) It can therefore maintain a detailed history of client behaviour and use one of the standard algorithms proposed in the literature [27, 19, 18, 43] or ones using more service speci c info. In our design, servers can chain prediction lists to avoid overwhelming the client with long lists. Servers send small numbers of predictions to clients and wait for clients to request more predictions. Ideally, in a perfectly non interfering ....

[Article contains additional citation context not shown here]

J. Grioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, Oct. 1993.

....CISE grant (CDA9624082) the Texas Advanced Technology Program, the Texas Advanced Research Program, and Tivoli. Dahlin was also supported by an NSF CAREER award (CCR 9733842) and an Alfred P. Sloan Research Fellowship. bandwidth consumption and possibly disk space for improved service latency [15, 18, 26, 32, 38, 50], improved availability [11, 53] increased scalability [2] stronger consistency [53] or support for mobility [28, 41, 47] Many of these services have potentially unlimited bandwidth demands where incrementally more bandwidth consumption provides incrementally better service. For example, a web ....

....the risk of both selfinterference, where applications hurt their own performance, and cross interference, where applications hurt other applications performance. Often, applications attempt to achieve this balance by setting magic numbers (e.g. the prefetch threshold in prefetching algorithms [18, 26]) that have little obvious relationship to system goals (e.g. availability or latency) or constraints (e.g. current spare network bandwidth) Our goal is for the operating system to manage network resources in order to provide a simple abstraction of zero cost background transfers. A ....

[Article contains additional citation context not shown here]

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....the extra level of cache as a delay server. We reach similar conclusions in the context of Internet caching, leading to our design principle of minimizing the number of hops on a hit or miss. Several studies have examined push caching and prefetching in the context of web workloads [14, 15, 23, 30]. These systems all used more elaborate history information to predict future references than the algorithm we examine. Because large, shared caches do a good job at satisfying references to popular objects, we explore prefetching strategies that will work well for the remaining large number of ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....the extra level of cache as a delay server. We reach similar conclusions in the context of Internet caching, leading to our design principle of minimizing the number of hops on a hit or miss. Several studies have examined push caching and prefetching in the context of web workloads [14, 15, 23, 30]. These systems all used more elaborate history information to predict future references than the algorithm we examine. Because large, shared caches do a good job at satisfying references to popular objects, we explore prefetching strategies that will work well for the remaining large number of ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....set of caches that are near one another and near their clients, but in larger systems where clients are closer to some caches than others, the hash function will prevent the system from exploiting locality. Several studies have examined push caching and prefetching in the context of web workloads [55, 57, 91]. These systems all used more elaborate history information to predict future references than the algorithm we examine. Because large, shared caches do a good job at satisfying references to popular objects, we explore prefetching strategies that will work well for the remaining large number of ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....and advertise Active Name programs before being returned to the client. For the client initiated customizations, clients use Active Names to customize their namespace to Source of Miss Fraction of Requests Available Approaches Client Server Initiated Compulsory 19 30 [47] 45 (ISP) Prefetching [27, 34, 43] either Server replication [49] or push caching [29] server Increase number of clients sharing cache system [10, 18, 26, 47] client Transcoding [22, 3] compression and delta encoding[39] client or either Consistency verify (unmodified) 10 (ISP) 2 7 [18] 4 13 [5] Server driven consistency [36, 55] ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....set of caches that are near one another and near their clients, but in larger systems where clients are closer to some caches than others, the hash function will prevent the system from exploiting locality. Several studies have examined push caching and prefetching in the context of web workloads [19, 20, 30]. These systems all used more elaborate history information to predict future references than the algorithm we examine. Because large, shared caches do a good job at satisfying references to popular objects, we explore prefetching strategies that will work well for the remaining large number of ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....set of caches that are near one another and near their clients, but in larger systems where clients are closer to some caches than others, the hash function will prevent the system from exploiting locality. Several studies have examined push caching and prefetching in the context of web workloads [22, 23, 34]. These systems all used more elaborate history information to predict future references than the algorithm we examine. Because large, shared caches do a good job at satisfying references to popular objects, we explore prefetching strategies that will work well for the remaining large number of ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

....Server Proxy 0 10 20 30 40 2 4 6 8 10 12 15 20 Number of Clients Active Server Proxy (a) Unloaded Server (b) Loaded Server Figure 2: Mobile Distillation Performance. Source of Miss Fraction of Requests Available Approaches Client Server Initiated Compulsory 19 30 [64] 45 (ISP) Prefetching [37, 47, 59] either Server replication [66] or push caching [40] server Increase number of clients sharing cache system [13, 23, 36, 64] client Transcoding [28, 3] compression and delta encoding[53, 8] client or either Consistency verify (unmodified) 10 (ISP) 2 7 [23] 4 13 [7] Server driven consistency [50, ....

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems, October 1993.

No context found.

James Griffioen and Randy Appleton. Automatic Prefetching in a WAN. In Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems, pages 8 -- 12, Oct 1993.

No context found.

J. Griffioen and R. Appleton. Automatic Prefetching in a WAN. In IEEE Workshop on Advances in Parallel and Distributed Systems. Oct. 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