Co#man, E.G., Denning, P.J.: Operating Systems Theory. Prentice Hall (1973)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....along the same lines as the proof given in [2] for the special case t = n. Remark. There exists an extensive literature on the move to front rule for sorting [1, 2, 5, 11, 13] which corresponds to the case # = 1 and n = t. More general deterministic LRU caches, with # = 1, have been studied in [3, 8]. Although the goal of these papers is usually to estimate the expected computational cost or the expected cache miss ratio, one can learn valuable lessons from these classical works. For instance, in [13] it is suggested to replace the move to front rule with a transposition rule, and Rivest ....

E.G. Co#man, Jr. and P.J. Denning. Operating Systems Theory. Prentice Hall, Englewood Cli#s, NJ, 1973.

....to the next IRR than an IRG to the next IRG. Moreover, it is the recency but not gap information that is used by LRU. An elaborate argument favoring IRR in the context of virtual memory page replacement can be found in [18] Secondly, IRR can be easily dealt with under the LRU stack model [2], on which most popular replacements are based. 2.3 Detection and Adaptation of Access Regularities More recently, researchers take another approach to detect access regularities from the history information by relating the accessing behavior of a block to those of the blocks in its temporal or ....

....to us only consists of logical block numbers, which are unique numbers for accessed blocks. Thus, we only include the UBM experimental results for the traces used in paper [11] which are multi1, multi2, multi3. We also include the results of OPT, an optimal, o# line replacement algorithm [2] for comparisons. 4.2 Performance Evaluation Results We divide the 9 traces into 4 groups based on their access patterns. Traces cs, postgres, and glimpse belong to the looping type, traces cpp and 2 pools belong to the probabilistic type, trace sprite belongs to the temporally clustered type, ....

E. G. Co#man and P. J. Denning, "Operating Systems Theory", Prentice-Hall, 1973

....by: N = A L s mod N s (1) A replacement algorithm decides which line in set N is overwritten by memory line j A Ls k . 2. 2 Caching Policy A caching policy is a mechanism for processing the memory reference string = r 1 ; r 2 ; r t ; resulting from a program execution[Co man et al..1973]. Let Adr(r i : r j ) be the set of di erent data addresses accessed by references r i : r j . The caching policy implemented by cache remapping is as follows: First, the reference string is partitioned into subsequences P 1 P 2 : such that each partition can be stored in ....

E. G. Coman and P. J. Denning. Operating Systems Theory. Prentice Hall, Englewood Clis, 1973.

....distribution of inter request times is tightly related to document popularity. They argued that the probability of referencing an object t units of time after it has been last requested is roughly proportional to 1=t. However, since their work is based on the Independent Reference Model 1 (IRM) [6] their approach is incapable of capturing the temporal correlations in the reference stream. 3. Trace Characteristics In this paper we use traces from DEC [10] and NLANR [17] Some characteristics of these traces are shown in Table 1, including the total unique number of requests and their ....

E. G. Coman and P. J. Denning. Operating systems theory. Prentice-Hall, 1973.

....(MIN) 1] algorithm is the well known o line page replacement algorithm which always choose to evict the page with the largest forward distance under the assumption that whenever the missing is happened, the requested page will be always stored in the fastest memory. The proofs can be found in [3, 4, 11, 12]. However, the traditional OPT algorithm is not an optimal algorithm under our model. A simple example will show that our algorithm in our model is better than OPT algorithm under its assumption. For example, in an 2 level memory hierarchy model, assume that the capacity of the faster level is 2, ....

....are considered to nd the next evicted pages to its parent level memory as shown in Figure 13. 17 p3 p4 p1 p2 1 2 3 4 5 6 2 5 6 4 5 6 1 2 6 3 4 6 3 . 5,6,4,1,2,3,2,1,3,4,5,6, 4,2,1,3,5,6,1,1,6,5,3,2,4, 3,2,4,5,6,3,4,3,6,5, 3,4,2,5,6,3,6,5,3,2,4, current time [3] [3] 1) 3) 1] 5] 3) L L L L L L L 1,1 1,2 1,3 1,4 2,1 2,2 3,1 Figure 12: The multi processor Selectively Keep Take an example of processor p 4 . Page 3 is evicted to L 2;2 by page 5. Not only page 5 is considered to store in L 2;2 , but also page 3. The rest of the ....

[Article contains additional citation context not shown here]

E.G. Coman and P.J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Clis, 1973.

....distribution of documents. The opposite would be true for a request stream whose temporal locality is due mostly to short term temporal correlation of document requests. This point is further explained later in this paper. Reference Interarrival Model: Using an independent reference model [13], Breslau et al. [10] showed that the Zipf like [42] popularity pro le of documents in Web request streams can asymptotically explain other properties (namely, cache eciency and temporal locality) In particular, they showed that the probability of referencing an object t units of time after it has ....

E. G. Coman and P. J. Denning. Operating systems theory. Prentice-Hall, 1973.

.... Aspect of Temporal Locality Being Exploited Cost Size None Recency based Frequency based Both Fixed FIFO,Random LRU LFU LRU K,LFU DA,LRFU Variable LFF,Latency GD,GDS Hybrid LNC W3,GDSF,GDSP,LRV Table 1: Taxonomy of existing Web cache replacement policies Using an independent reference model [12], Breslau et al. [10] showed that the Zipf like popularity distribution of objects in Web request streams can asymptotically explain other properties (namely, cache eciency and temporal locality) In particular, they showed that the probability of referencing an object t units of time after it has ....

E. G. Coman and P. J. Denning. Operating systems theory. Prentice-Hall, 1973.

....make it more sensitive to the variability in object size and retrieval delays. The GreedyDual algorithm [24] was proposed to deal with variable cost (but uniform size) page caching problem. Cao and Irani [9, 15] generalized the 1 Previous studies [7] indicate that the independent reference model [10] explains well the distribution properties of Web access, supporting the use of of frequency based policies. 2 This is in contrast to indirectly inferring popularity through locality of reference or object size. GreedyDual algorithm to deal with the variability in size of Web objects. The ....

E. G. Coman and P. J. Denning. Operating Systems Theory. Prentice-Hall, 1973.

....broadcast algorithm is, in fact, optimal. In the same paper [4] the authors considered the general problem in which arbitrary (but known) number of packets are to be transferred between transmitter receiver pairs. They presented an algorithm based on the well known list scheduling algorithm [5, 7] which produces schedule lengths that are at most twice the optimal length. In this paper, we consider the on line version of the general transmission scheduling problem, which applies to more practical situations that does the o# line version. In on line scheduling, packets arrive at the ....

E. G. Co#man and P. J. Denning, Operating Systems Theory, Englewood Cli#s, NJ: Prentice-Hall, 1973.

No context found.

Co#man, E.G., Denning, P.J.: Operating Systems Theory. Prentice Hall (1973)

No context found.

E. G. Co#man Jr. and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Cli#s, 1973.

No context found.

E. G. Co#man and P. J. Denning. Operating systems theory. Prenticw)X3N1 1973.

No context found.

E. G. Co#man and P. J. Denning. Operating System Theory. Prentice-Hall, 1973.

No context found.

E. G. Co#man and P. J. Denning. Operating System Theory. Prentice-Hall, 1973.

No context found.

E. G. Co#man and P. J. Denning. Operating systems theory. Prentice-Hall, 1973.

No context found.

E. G. Co#man and P. J. Denning. Operating systems theory. Prentice-Hall, 1973.

No context found.

E. Coman and P. Denning. Operating Systems Theory. Prentice-Hall, 1973. 33

No context found.

E. G. Coman and P. J. Denning. Operating Systems Theory. 1973.

No context found.

E.G. Co#man, Jr. and P.J. Denning. Operating Systems Theory. Prentice-hall, Inc., Englewood Cli#s, New Jersey, 1973.

No context found.

E. G. Coman and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Clis, N.J., 1973.

No context found.

E. G. Coman and P. J. Denning. Operating Systems Theory. Prentice-Hall, Englewood Clis, N.J., 1973.

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