Index_M

---

M

Magnetic storage devices, 52-53

Manchester II, 473

Marginal distribution, 152, 155

Markov chains

balance equations for, 357

communication system example, 199-200

definitions, 197-200

discrete time, 193

ergotic, 198, 199

stationary, 197, 298

Markov processes, 179, 192-200, 355

defined, 192

discrete-state, 193

mapping, 192

state transition diagram, 194

transition probabilities, 194, 195-96

transition probability matrix, 194

See also Processes

MATLAB program, 373

defined, 374

LINUX AWESIM model, 382-83

purpose, 374

workload for LINUX 7.2, 374-76

MATLAB workload, 400-402

CPU use and memory utilization, 400, 401, 402

experiment results, 403

matrix operations for, 400

observations, 400-402

See also Operating systems analysis

Maximum likelihood estimation, 229, 230

Mean queue length

defined, 314

illustrated, 315

Mean response time

defined, 314

illustrated, 316

Mean service time

defined, 314

illustrated, 317

Mean value analysis, 241-43

defined, 234, 241

general algorithm, 241

Little's result in, 242

network for, 243

theorem, 241

See also Computational methods

Measurement(s), 107-26, 112-15

efficiency, 340

hardware monitoring, 114

hybrid monitoring, 115

intervals, 115-16

principles, 127-38

probability density, 130

probability distribution, 128-30

real system, 335

response time, 338

software monitoring, 114-15

special facilities, 306

summary, 138

types of, 113

See also Performance measures

Memory

access mechanism, 49

after garbage collection, 75

allocation, 71

allocation methods, 353

architectures, 7, 48-49

compaction, 75-76

deallocation, 74

fragmented, 74

hierarchy, 8, 51, 63, 64

main, 62

management, 72-76

map, 73

marking free blocks in, 75

modules, 353

with paging and segmentation, 76

private local, 55

Simms, 55

speed up for, 358

storage, 48, 50

utilization, 375

virtual, 364

Memory addressing schemes, 7, 47-48

base, 48

direct, 47-48

immediate, 47

index, 48

indirect, 48

two-operand addressing, 48

types of, 47

Memory management, 72-76

IBM DB2, 424-26

Windows ME, 369-70

Windows XP, 366-67

Memory-mapped architectures, 60-61

Message transmissions, 314, 469

Method of moments, 229-30

M/G/I queuing system, 218

Microsoft SQL Server, 427-31

cost/performance comparison, 443-44

defined, 427

dynamic memory allocation, 429-30

Informix vs., 438, 440

instances, 428

locking structure, 430-31

logical tablespace structures, 428

memory allocation/access, 429

memory configuration, 429

Oracle vs., 439, 440

results, 437

special features, 431

SQL, 431

system databases, 428

See also Database systems performance analysis

Mission-oriented systems, 121

M/M/C queuing system, 215-18

defined, 215

illustrated, 215

loss system, 218

state transition diagram, 216

steady-state probabilities, 218

See also Queuing systems

M/M/I/K queuing system, 213-15

defined, 213

state diagram, 213

wait time distribution, 215

See also Queuing systems

M/M/I queuing system, 206-12

arrival rate, 211

birth-death process, 207

defined, 206

in isolation, 227

Little's result, 210-11

model, 206

state transition diagram, 209

steady-state equations, 206-8

See also Queuing systems

Modeling tools, 28, 30-36

analytical, 30-32

availability, 332-33

comparison criteria, 333-34

conducting experiments and, 336-37

cost criteria, 334

evaluation, 342-43

operational analysis as, 35-36

performance metrics, 337-42

Petri nets, 331

selecting, 331-34

selection criteria, 331-34

simulation, 28-29, 32-33

testbeds as, 29, 33-34

time criteria, 332

types of, 331

validation of results, 334-36

Models, 25-26

analytical, 30

configuration, 447

constructing, 26-30

defined, 24

development process, 28

executable, 29

"faithful," 25

inputs, 26

methodology, 26, 27, 28

network, 203-4

Petri net, 282

process illustration, 25

queuing, 202, 203, 447

realizing, 24-25

requirements, 24

scheduling, 447

sensitivity, 28

simulation, 33, 256-61

success, 29-30

system abstraction, 26

validating, 29

verifying, 29

workloads, 322-26, 447

See also Performance evaluation

Modularity, 486

Moments, 158

central, 132, 158-59

nth, 158

Multibank shared memory model, 351

Multiple server computer system, 350-58

multibank shared memory model, 351

multiprocessor model, 350

properties, 354-58

shared memory model, 351

Multiprocessor systems

with central processor, 350

with N=2/M=2, 355

with N=2/M=4, 353

number of states, 354

Petri net model for, 359

See also Processors

Mutual exclusion, 294

---