THE FRACTAL STRUCTURE OF DATA REFERENCE- P11 pot

... (2.2). The method of performing the needed random walk can be visualized by thinking of the available tracks as being the leaves of a binary tree, of height H max . The ancestors of any given ... values of the interarrival time, or it may reflect a second - order effect not captured by the approximate method of analysis adopted in the previous section. THE...

Ngày tải lên: 03/07/2014, 08:20

... percent of the tracks. Since the beginning of the sorted list represents the best possible cache contents, we may apply the definition of Ω(l) to obtain the following upper bound on the hit ... 3 the LRU list, other than the requested track, remain linked together in the same order as before. This algorithm has the net effect that the tracks in the list alwa...

Ngày tải lên: 03/07/2014, 08:20

... behavior of λ(t) provides an alternative method of characterizing the hierarchical reuse model, which 34 THE FRACTAL STRUCTURE OF DATA REFERENCE Notes 1 Assumes a track belonging to the 3380 ... background in place, we then propose, and analyze, a method by which it is possible to match this behavior synthetically. Finally, we illustrate the actual behavior of the...

Ngày tải lên: 03/07/2014, 08:20

... 112 THE FRACTAL STRUCTURE OF DATA REFERENCE In addition, the fact that the line of current performance crosses the 95 percent line means that we can reduce costs still further. This ... with, the corresponding back - of - the - envelope calculations presented in the previous section. Differences between the two sets of results are due to the much more comp...

Ngày tải lên: 03/07/2014, 08:20

... range 9 ≤ y ≤ 49, then the factor on the right side of (9.14) is in the range 1.39 ≤ factor 1.6. For “back - of - the - envelope” purposes, then, we can state the result of (9.14) as follows: ... capacity, all of the new disk’s physical capacity must continue to be usable: THE FRACTAL STRUCTURE OF DATA REFERENCE (9.15) or equivalently, (9.16) (with equality...

Ngày tải lên: 03/07/2014, 08:20

... THE FRACTAL STRUCTURE OF DATA REFERENCE Applications to the Memory Hierarchy by Bruce McNutt International Business Machines ... SYSTEMS, Nabil R. A dam, Aryya Gangopadhyay ISBN : 0 - 7923 - 9924 - 2 THE FRACTAL STRUCTURE OF DATA REFERENCE Applications to the Memory Hierarchy eBook ISBN: 0-306-47034-9 Print ISBN: 0-792-37945-4 ©2002 ... LOGIC IN DATA MODELING,...

Ngày tải lên: 03/07/2014, 08:20

... function of average cache residency time. x THE FRACTAL STRUCTURE OF DATA REFERENCE 1.16 IMS storage pools: distribution of record interarrival times. 30 1.17 TSO storage pools: distribution of ... to Memory 11 5. Two Levels of Cache 25 2. HIERARCHICAL REUSE DAEMON 35 1. Desired Behavior 35 2. Definition of the Synthetic Application 37 3. Analysis of the Syn...

Ngày tải lên: 03/07/2014, 08:20

... exploit them to best advantage. The emphasis of the book will be on the practical applications of such results. The focus of the applications examined in this book is on the portion of a computer ... recall. THE FRACTAL STRUCTURE OF DATA REFERENCE Preface xvii The primary audience intended for the book is the large body of workers who endeavor to en...

Ngày tải lên: 03/07/2014, 08:20

... use of a given track to the next reuse. Then we define the hierarchical reuse model of arrivals to the track as the hypothesis that the conditional distribution of the quantity (1.2) does ... widely separated from any other reference to the data. If we now examine the structure of database software, in an effort to account for data reuse at a variety of ti...

Ngày tải lên: 03/07/2014, 08:20

... size. Then we may conclude that the population of tracks currently visiting the cache is given by (1.13): THE FRACTAL STRUCTURE OF DATA REFERENCE Therefore, By contrast, measurements of the ... Let the average duration of the front end be called ∆τ. Thus, the total average duration of the visit as a whole is given by (1.7) Suppose, now, that the cumulative...

Ngày tải lên: 03/07/2014, 08:20