Grioen, J., Appleton, R.: "Reducing le system latency using predictive approach ", USENIX Technical Conference Cambridge, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....notion of semantic distance [5] which models the anity between two les. The Seer hoarding system [6] used semantic distance to cluster related les, predicting usage from the clusters recently accessed by the user. 2 Grioen and Appleton applied modeled le accesses using a probability graph [1], much like our algorithm discussed in Section 4.1.1. Our algorithm can be seen as an application of a Markov Chain formalism [2] to this work. Kroeger and Long applied multi order context modeling to le prefetching [3] Our second algorithm, described in Section 4.1.2, is an adaptation of this ....

....drawing inferences about likely future accesses. We explored two approaches to achieving this. The rst, the Markov Model, is C A B A A B A B C A B C .66 .33 1.0 0.0 1.0 0. 0 File chain and transition matrix for specified access string Figure 1: Markov Model similar to the work done in [1], and the second, the Partitioned Context Model (PCM) is based on the work done in [3] Both these models are used to store statistical information on the behavior of the access stream and making probabilistic conclusions about the future behavior. 4.1.1 The Markov Chain Model In this model, the ....

J. Grioen and R. Appleton. Reducing le system latency using a predictive approach. Technical Report CS247-94, University of Kentucky, June 1994.

....sparse. In practice, they can be distributed among many redistribution servers for scalability. Mechanisms to support this redistribution have been developed, but are not the focus of this paper. Using Hidden Markov Models has several bene ts over the systems evaluated in previous projects ([1, 2, 4, 5, 7]) Each of these projects attempted to measure pairwise relationships among les. This model, while simple and somewhat intuitive, does not take advantage of the intuition that le accesses are caused by some hidden task, which our two layer model attempts to detect. The rst advantage of HMM s, ....

J. Grioen and R. Appleton. Reducing le system latency using a predictive approach. Technical Report CS247-94, University of Kentucky, June 1994.

....writes can be completed, since available memory resources for bu ering such data are nite. Prefetching and Prewriting. Another use of free bandwidth is for anticipatory disk activities such as prefetching and prewriting. Prefetching is wellunderstood to o er signi cant performance enhancements [44, 9, 25, 36, 54]. Free bandwidth prefetching should increase performance further by avoiding interference with foreground requests and by minimizing the opportunity cost of aggressive predictions. As one example, the sequence shown in Figure 1(b) shows one way that the prefetching common in disk rmware could be ....

James Grioen and Randy Appleton. Reducing le system latency using a predictive approach. Summer USENIX Technical Conference (Boston, June 1994), pages 197-207. USENIX, June 1994.

No context found.

Grioen, J., Appleton, R.: "Reducing le system latency using predictive approach ", USENIX Technical Conference Cambridge, 1994.

No context found.

J. Grioen and R. Appleton. Reducing le system latency using a predictive approach. Summer USENIX Technical Conference (Boston, June 1994.

No context found.

J. Grioen and R. Appleton. Reducing le system latency using a predictive approach. In Proceedings of the USENIX Summer Technical Conference, 1994.

No context found.

Grioen, J., Appleton, R.: "Reducing le system latency using predictive approach ", USENIX Technical Conference Cambridge, 1994.

No context found.

James Grioen and Randy Appleton. Reducing le system latency using a predictive approach. Summer USENIX Technical Conference (Boston, MA, June 1994.

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