THE FRACTAL STRUCTURE OF DATA REFERENCE- P16 pptx

... 62 THE FRACTAL STRUCTURE OF DATA REFERENCE 1. THE CASE FOR LRU In this section, our objective is to determine the best scheme for managing memory, given that the underlying data conforms to the ... (5.1): THE FRACTAL STRUCTURE OF DATA REFERENCE (5.3) Our game plan will be to compare the total delays implied by (5.3) with the delays occurring in a global c...

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

... 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

... 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

... 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 time scales, we find that ... 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 th...

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

... convincingly by Smith [ 16]. 16 THE FRACTAL STRUCTURE OF DATA REFERENCE But assuming that the placement of interval boundaries falls at random, the average number of interval boundaries crossed ... n tch . We may then estimate To apply the conclusion just stated as a method of trace analysis, we count (1.17) Note that if 6’ is in the general ballpark of the gu...

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

... early demotion of sequential data residing in the cache; the memory for such data is typically freed long before the data would have progressed from the top to the bottom of the LRU list. Storage ... a function of the miss ratios for the two memory technologies 24 THE FRACTAL STRUCTURE OF DATA REFERENCE In moving an application from an older storage co...

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

... (1.27) Since the management of processor buffers is at the level of individual appli - cation records (typically one page in size), we may assume that < 0c. Thus, the behavior of the cache under these ... storage pools: distribution of track interarrival times. Figure 1. 16. IMS storage pools: distribution of record interarrival times. 28 THE FRACTAL STRUCTURE O...

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