tailieunhanh - THE FRACTAL STRUCTURE OF DATA REFERENCE- P29

THE FRACTAL STRUCTURE OF DATA REFERENCE- P29: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. | Index Accessdensity 113 120 123 125 Arrival rate 35 39 Back end I O 15 Backend 12 15 Benchmark 35 42 Binary tree 37 Burst 6 88 CA-ASTEX 14 Cache Analysis Aid 14 Cache visit 13 Camemory 16 22 43-44 51-52 56 59 61-63 66 68 plain vanilla 2 residency time 9 22 26 43-45 47-48 storage control 1-3 8 22 25 51-53 55-56 59 visit 11 Calibration 107 CICS 18 53 89 97 110 Collection threshold 76 Compression 71 103-104 112 Constrained optimization 104-105 108 Contour plot 110 Criterion oftime-in-cache 8 14 52 Cylinder image 86 David-Johnson approximation 38 DB2 18 53 74 89 97 110 Deferred write 74 Deployable applications model 114 120 123-124 Destage 72 74 82-83 Dirty data 82 Disk array 71 DL I 22 Dormitory 74 Driver 35 42 Early demotion 24 55 ECKD 2 Fractal 11 42 Free space collection 71 74 77 83 Front end 12-13 15 87 Front-end miss 23 Garbage collection 71 Generalized LRU 67-68 Generation 75-76 Granularity 11 86 91 96 Heavy-tailed 1 7 85 98 Henley M. 5 Hierarchical reuse model 1 5 7 35 47 56 78 80 87-88 106 Hierarchical storage management 97 99 103- 04 107 110 Hints 53 Hiperpool 55 Hiperspace 55 History dependent 76 81 83 History independent 76 Hit ratio 2 59 Hit 2 52 Homogeneous pattern of updates 77 80 Hyperbolic 7 I O interface 51 53 IMS 22 53 89 97 110 Independent reference model 3 5 69 Interarrival lime 8-9 78 85 87 Level 0 storage 103 Level 1 storage 103 105 112 Level 2 storage 103 Linear model 74 77 80 83 Little s law 13 16 24 79 81 Little . 13 Log structured array 71 Log-structured disk subsystem 71 LRU 2 55 61 63 LRU-K 68 Levy Paul 8 Mandelbrot BenoitB. 7 118 Memory hierarchy 1 5 27 Memoryless 1 3 5 Migration age 105 110-111 132 THE FRACTAL STRUCTURE OF DATA REFERENCE Migration 103 106 Miss ratio 2 16-17 47 66 Miss 2 Moves per write 72 80 MRU 2 Multiple workload hierarchical reuse model 33 47 61 Operational conventions 82 OS 390 environment 2 9 14 23-25 46 103 workload measurements 6 18 27 89 97 110 Pageframe 11 Page 2 Pareto Vilfredo 8 Partitioned memory 63 .

crossorigin="anonymous">
Đã 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.