TAILIEUCHUNG - THE FRACTAL STRUCTURE OF DATA REFERENCE- P2

THE FRACTAL STRUCTURE OF DATA REFERENCE- P2:For purposes of understanding its performance, a computer system is traditionally viewed as a processor coupled to one or more disk storage devices, and driven by externally generated requests (typically called transactions). Over the past several decades, very powerful techniques have become available to the performance analyst attempting to understand, at a high level, the operational behavior of such systems. | Contents List of Figures ix List of Tables xiii Preface xv Acknowledgments xix 1. HIERARCHICAL REUSE MODEL 1 1. Background 2 2. Motivation 3 3. Model Definition 6 4. Visits to Memory 11 5. Two Levels ofCache 25 2. HIERARCHICAL REUSE DAEMON 35 1. Desired Behavior 35 2. Definition of the Synthetic Application 37 3. Analysis of the Synthetic Application 37 4. Empirical Behavior 40 3. USE OF MEMORY BY MULTIPLE WORKLOADS 43 1. Cache Use by Application 44 2. Analysis of the Working Hypothesis 47 4. USE OF MEMORY AT THE I O INTERFACE 51 1. Simulation using Time-in-Cache 52 2. A Case Study 53 3. Expectations for Memory Interaction 56 5. MEMORY MANAGEMENT IN AN LRU CACHE 61 1. The Case for LRU 62 2. Generalized LRU 67 6. FREE SPACE COLLECTION IN A LOG 71 1. The Life Cycle of Logged Data 74 viii THE FRACTAL STRUCTURE OF DATA REFERENCE 2. First-Cut Performance Estimate 75 3. Impact of Transient Data Access 78 4. History Dependent Collection 80 7. TRANSIENT AND PERSISTENT DATA ACCESS 85 1. Transient Access Revisited 87 2. Periods up to 24 hours 91 3. Periods up to One Month 96 8. HIERARCHICAL STORAGE MANAGEMENT 103 1. Simple Model 104 2. A Case Study 110 9. DISK APPLICATIONS A STATISTICAL VIEW 113 1. Deployable Applications Model 115 2. Average Storage Intensity 117 3. Disk Performance Requirements 121 4. Conclusion 124 127 References Index 131 List of Figures Pattern of requests to an individual track. The vertical axis acts as a zoom to separate groups of references that are too closely spaced to distinguish along a single time line. 6 Distribution of track interarrival times. Each curve shows a user or system storage pool at one of 11 surveyed VM installations. 10 Distribution of page frame interarrival times. Each curve shows a user or system storage pool at one of 11 surveyed VM installations. 11 VM user storage pools cache performance as a function of average cache residency time. 18 VM system storage pools cache performance as a func - tion of .

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.