| < Free Open Study > |
|
Page table entries (PTEs), 366
Paging
LINUX, 364
Windows ME, 370
Performance
evaluation, 342-43
evaluation parameters, 311-14
network, tests, 315-19
scheduling algorithm relationship to, 135-37
variables, 327
Performance evaluation, 22-38
criteria, 36-38
methods, 24-36
need for, 22-23
role, in computer engineering, 23-24
Performance measures, 107-26
analysis questions, 122-23
case study, 124-25
events, 110-12
independence, 117-18
intervals, 115-16
missionability, 121
model development, 119-23
predictability, 121
problems, 119-23
productivity, 121
randomness, 118
responsiveness, 116-17, 121
sampling, 112-15
summary, 125-26
system-oriented, 107, 108
time, 109-10
use level, 121
user-oriented, 107
workloads, 119, 124
Performance metrics, 124, 337-42
availability, 341
cost vs. performance ratio, 342
criteria, 36-38
efficiency, 340-41
reliability, 341
response time, 337-38, 338-39
throughput, 338, 339-40
types of, 337-38
usefulness vs., 342
utilization, 338, 341-42
Peripheral device management, 78-79
defined, 78
device, 78, 79
file management integration, 79
I/O, 78, 79
Peripheral devices, 8, 50-54
Permutations, 143, 144
Petri nets (PNs), 279-303
allocated resource, 287
analysis, 358-60
arcs, 280
central server, 349
classical, 284-94
colored, 300-301
components, 280
component to test conditions, 290, 291, 292
deadlocked, 294
defined, 279
describing, 281
enabled transitions, 285
example illustration, 281
firing, 286
firing cycle, 285, 291
flexibility and, 333
generalized, 300, 301-2
graph, 281
indicating reachability/reversibility, 293
with inhibitor, 288, 291
introduction, 279
inverse, 283
k-place bounded, 294
marked, 284
model for multiprocessor system, 359
modeling concurrency, 292
modeling conflict, 291
modeling confusion, 293
models, 282
moving from state to state, 284
as multigraphs, 283
multipath arcs, 283
multiple disk example, 349
mutual exclusion, 294
new state, 286
notation, 279-84
perpetual motion example, 280
places, 280
places, marking of, 280
priority-based, 298-99
reachability graphs, 289-90
reachability set, 288-89
reachable state, 288
resource sharing, 287
state, 283
summary, 302-3
timed, 294-98
tokens, 280
tokens, placement of, 280
transitions, 280, 282
Pipelining, 317
Poisson distribution, 166-68
arrival, 254-55
defined, 166
mean, 166
for time between arrivals, 312
variance, 167-68
See also Probability distributions
Poisson process, 184-86
defined, 184
fundamental properties, 186
memoryless property support, 186
modeling, 190
property processing, 184
See also Stochastic processes
Priority-based Petri nets, 298-99
defined, 298
illustrated, 298
timed and, 299
See also Petri nets
Probability, 139-77
axioms of, 146
combinations, 144
computing, 142-43
conditional, 142, 146-48
fundamental tenet of, 140
independence and, 141
measures, 143
permutations, 143, 144
state transition diagram, 356
state transition matrix, 193
theory, 139, 141, 145
transition, 194, 195-96
value of, 140
weighting factors, 145
Probability densities, 130, 152-55
conditional, 154, 155
defined, 152
for discrete functions, 153
distributed, 154
Erlang, 176
exponential, 174
joint, 154
marginal, 155
Poisson, 166
Probability distributions, 128-30, 150-52
binominal, 164-66
continuous, 151
defined, 128
discrete, 151
Erlang, 176-77
example, 151, 163-77
exponential, 130, 173-76
Gaussian, 168-73
illustrated, 128
joint, 152
marginal, 152
Poisson, 166-68
for random selection, 143
representation, 150
uniform, 130, 163-64
variance, 129, 131, 159
See also Distributions
Process creation workload, 399-400
CPU use and memory utilization, 399, 400
experiment results, 402
observations, 399-400
response time, 399
See also Operating systems analysis
Processes
Bernoulli, 182-83
birth-death, 187-92
counting, 180
defined, 67
flow, 70
Markov, 179, 192-200
movement, 69
Poisson, 184-86
ready state, 68
running state, 69
scheduling, 70-71
states, 68-69
stochastic, 179-200
termination state, 69
waiting state, 69
Process management, 67-72
deadlock detection, 71-72
memory allocation service, 71
scheduling, 70-71
tasks, 67-68
See also Operating systems architecture
Process Manager, Windows NT, 368-69
Processors
distributed, 19
events, 477
host, 467
See also Multiprocessor systems
Product form, 236
Protection, 77-78
access control, 78
authentication, 77
authorization, 77
defined, 77, 80
Windows ME, 370
Protocols, 471-74
defined, 471
function performance, 471
functions, 471
implementation, 472
ISO standard, 472
See also Local area networks (LANs);
Networks
Prototype testbeds, 305, 306
| < Free Open Study > |
|