|
 |
Авторизация |
|
 |
Поиск по указателям |
|
 |
|
 |
|
 |
 |
|
 |
|
Aven O.I., Coffman E.G., Kogan Y.A. — Stochastic Analysis of Computer Storage |
|
 |
Предметный указатель |
Adaptive control 11
Allocation algorithm 8
Allocation algorithm First-Fit (FF) 8 10 75
Arrival rate 54 197 204
Bellman equation 122 126 128
Brownian motion 80
Brownian motion, reflected 8 82
Brownian motion, with two reflected barriers 9 86
Buffer 5 19 42
Buffer storage 18
Computer system 1
Control Markov chain 125
Conversation principle 7 53
Correlation coefficient 57
Decomposition 156
Decomposition, approximation 162 178 182
demand paging 10
Departure 68
Diffusion approximation 8 83 86
Diffusion equation 88
Disk system with two read/write heads 224
Disk system with two read/write heads, nearer server rule 224
Disk system with two read/write heads, optimal positioning policy 231
Disk-like devices 14 29
Drum like devices 14 202
Eigenvalues 45 46 48 49 50
Eigenvectors 45 46 49 51
Exponential distribution 20
FCFS 54 197 201 202
Fifty-percent rule 77
Finite memory 61
Finite networks 64
Fragmentation 7 70
Generating function 55 72
GI/G/I storage system 81
Idle period 5
Independent reference model (IRM) 12
Infinite-server storage system 71 90
Item 4 18
Item routing 65
Jackson equation 69
Jackson networks 64
Laplace — Steiltjes transform 55
Loading followed by transfer 27 38
Loading protocol 5 18
Loading protocol, non-overflowing 19 25 37
Loading protocol, reflection 19 25 34
Loading protocol, with now-through 18 20 25 31 34 37
Loading with transfer 29 40
Locality 13 105
M/G/l storage process 54
M/M/ queue 71
M/M/c queue 63
Main memory 9
Markov chain 157
Markov chain, approximation of the stationary probability vector 162
Markov chain, nearly decomposable 157
Markov process 2 21
Miss ratio 105
Miss ratio, approximation 180 182
Miss ratio, asymptotic 191
Miss ratio, calculation 181 184 186
Miss ratio, expressions 129
Miss ratio, general properties 139
Model adequacy 105 110 115
Multiple head systems 16
Multiple sources 42
Near-complete decomposition 167
Network 64
Node 65
Normal distribution 92 93
Normalization condition 32 63
| Ornstein — Uhlenbeck process 90
Overflow probability 50
page fault 11
Page fault rate 105
Page two-level memory 94 156
Paging system 10
Performance 1
Performance bounds 139
Performance indexes 104
Poisson process 5
Poisson process, arrival stream 54
primary memory 6 53
Processor-sharing 64
Product form solution 64
Program behavior model 102
Program behavior model Markov 102
Program behavior model partial Markov 103 108 137
Program behavior model, deterministic 102 121
Program behavior model, independent 102
Program behavior model, LRU stack 153
Program behavior model, nearly decomposable 157
Reference string 11
Renewal 103 112
Replacement algorith 121
Replacement algorithm 11 94
Replacement algorithm CLIMB 100 133 138 144
Replacement algorithm demand 96
Replacement algorithm DMIN 154
Replacement algorithm FIFO 12 95 129 131 133 143
Replacement algorithm LRU 95 129 130 135 142
Replacement algorithm M1N 121
Replacement algorithm Markovian 96
Replacement algorithm OPT 121 137
Replacement algorithm partially-preloaded 133
Replacement algorithm PFF 154
Replacement algorithm physically realizable 95
Replacement algorithm RR 95 132
Replacement algorithm self-organizing 97
Replacement algorithm VMIN 154 195
Replacement algorithm WS 95 191
Replacement algorithm 100 101
Residence time 2
Rotational latency 203 209
Scanning disk 196 212
Scheduling policy 14
Scheduling policy FIFO 14
Scheduling policy SCAN 15
Scheduling policy SLF 15 206
Scheduling policy SSTF 15
Secondary storage 14
Set-up time 197
Simplest semi-Markov 103 137
Storage allocation 1 2
storage devices 14
Storage models 4 7
Storage processes 8
storage requirements 20
Storage units 2
Takacs equation 6 31
Transition probability matrix 102 103
Transmission period 5 6
Transmission rate 5
Virtual memory 9
Waiting time 198 218
Wasted space 8 75
With overlapping locaties 159
With strictly disjoint localities 157
Working set 13
Working-set size 107 109
Working-set size, approximation 178
Working-set size, calculation 174 176
Working-set size, distribution 172
[i]-graph 164
|
|
 |
Реклама |
 |
|
|