THE FRACTAL STRUCTURE OF DATA REFERENCE- P12 ppt

... independently of any other pools served by the cache. In the first subsection of the chapter, we examine this hypothesis more closely. It leads directly to the needed analysis of cache use by ... is to proceed as though the same were true, not just for the single - reference residency time, but for the average residency time as well. 42 THE FRACTAL STRUCTURE OF...

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

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

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

... 54 THE FRACTAL STRUCTURE OF DATA REFERENCE Table 4.1. Busiest 20 files (data sets) in the case study. Use of Memory at the I/O Interface 53 meant that all memory deployment strategies of interest ... base the analysis on a trace of the logical data requests made by the application, including those requests served in the processor without having to ask for da...

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

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

... probability of further updates is highest shortly afterward. THE FRACTAL STRUCTURE OF DATA REFERENCE IMPACT OF TRANSIENT DATA ACCESS Figure 6.2. also presented in Figure 1.2. Distribution of time ... We should expect its value to be of the same order as the ratio of “dirty” data items in cache, relative to the overall number of data items on disk. The...

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

... s 00 ). At the installation of the case study, the estimate k = .000025 was obtained. While on the subject of calibration, the parameter s 00 should also be dis - cussed. In the installation of the ... seconds, due to the planned use of robotics). A disparity in delay times of this order will lead to relatively light use of primary storage (in the case of t...

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