Analyzing computer system performance with Perl: PDQ: with 59 tables
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXIII, 436 S. graph. Darst. |
| ISBN: | 3540208658 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019438308 | ||
| 003 | DE-604 | ||
| 005 | 20180809 | ||
| 007 | t | ||
| 008 | 041020s2005 gw d||| |||| 00||| eng d | ||
| 015 | |a 04,N31,0016 |2 dnb | ||
| 016 | 7 | |a 971707952 |2 DE-101 | |
| 020 | |a 3540208658 |c Gb. : EUR 58.80 (freier Pr.), CHF 97.50 (freier Pr.) |9 3-540-20865-8 | ||
| 024 | 3 | |a 9783540208655 | |
| 028 | 5 | 2 | |a 10969335 |
| 035 | |a (OCoLC)314553426 | ||
| 035 | |a (DE-599)BVBBV019438308 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-739 |a DE-20 |a DE-91G |a DE-29T |a DE-706 | ||
| 082 | 0 | |a 004.24 | |
| 082 | 0 | |a 004 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 366f |2 stub | ||
| 084 | |a DAT 254f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 280f |2 stub | ||
| 100 | 1 | |a Gunther, Neil J. |d 1950- |e Verfasser |0 (DE-588)173080030 |4 aut | |
| 245 | 1 | 0 | |a Analyzing computer system performance with Perl: PDQ |b with 59 tables |c Neil J. Gunther |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
| 300 | |a XXIII, 436 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Leistungsbewertung |0 (DE-588)4167271-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Open Source |0 (DE-588)4548264-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Systemverwaltung |0 (DE-588)4257084-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Perl |g Programmiersprache |0 (DE-588)4307836-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lastteilung |0 (DE-588)4323960-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Systemverwaltung |0 (DE-588)4257084-0 |D s |
| 689 | 0 | 2 | |a Lastteilung |0 (DE-588)4323960-2 |D s |
| 689 | 0 | 3 | |a Open Source |0 (DE-588)4548264-0 |D s |
| 689 | 0 | 4 | |a Perl |g Programmiersprache |0 (DE-588)4307836-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 1 | 1 | |a Leistungsbewertung |0 (DE-588)4167271-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012891856&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-012891856 | ||
Datensatz im Suchindex
| _version_ | 1804132900197629952 |
|---|---|
| adam_text | CONTENTS
PREFACE
........................................................
VII
PART I THEORY OF SYSTEM PERFORMANCE ANALYSIS
1 TIME*THE ZEROTH PERFORMANCE METRIC
....................
3
1.1 INTRODUCTION .......................................... 3
1.2 WHATISTIME?........................................ 4
1.2.1 PHYSICALTIME................................. 5
1.2.2 SYNCHRONIZATIONANDCAUSALITY .................. 5
1.2.3 DISCRETEANDCONTINUOUSTIME .................. 6
1.2.4 TIMESCALES................................... 6
1.3 WHATISA CLOCK?...................................... 8
1.3.1 PHYSICALCLOCKS ............................... 8
1.3.2 DISTRIBUTEDPHYSICALCLOCKS..................... 9
1.3.3 DISTRIBUTEDPROCESSING ......................... 9
1.3.4 BINARY PRECEDENCE . . ........................... 10
1.3.5 LOGICALCLOCKS ................................ 10
1.3.6 CLOCKTICKS................................... 12
1.3.7 VIRTUALCLOCKS ................................ 13
1.4 REPRESENTATIONSOFTIME................................ 14
1.4.1 INTHEBEGINNING .............................. 14
1.4.2 MAKINGA DATEWITHPERL....................... 15
1.4.3 HIGH-RESOLUTIONTIMING........................ 17
1.4.4 BENCHMARKTIMERS ............................ 18
1.4.5 CROSSINGTIMEZONES........................... 19
1.5 TIMEDISTRIBUTIONS .................................... 21
1.5.1 GAMMADISTRIBUTION........................... 22
1.5.2 EXPONENTIALDISTRIBUTION ....................... 22
1.5.3 POISSONDISTRIBUTION ........................... 24
1.5.4 SERVER RESPONSETIMEDISTRIBUTION .............. 25
XVI CONTENTS
1.5.5 NETWORKRESPONSETIMEDISTRIBUTION ............ 26
1.6 TIMINGCHAINSANDBOTTLENECKS ......................... 28
1.6.1 BOTTLENECKSANDQUEUES ........................ 30
1.6.2 DISTRIBUTEDINSTRUMENTATION .................... 30
1.6.3 DISKTIMINGCHAINS ........................... 31
1.6.4 LIFEANDTIMESOFANNFSOPERATION............. 32
1.7 FAILING BIG TIME . . . ................................... 33
1.7.1 HARDWARE AVAILABILITY . . . ....................... 34
1.7.2 TYRANNYOFTHENINES .......................... 34
1.7.3 HARDWARE RELIABILITY ........................... 35
1.7.4 MEANTIMEBETWEEN FAILURES ................... 36
1.7.5 DISTRIBUTEDHARDWARE.......................... 38
1.7.6 COMPONENTSINSERIES .......................... 38
1.7.7 COMPONENTSINPARALLEL ........................ 38
1.7.8 SOFTWARE RELIABILITY . ........................... 39
1.8 METASTABLELIFETIMES................................... 39
1.8.1 MICROSCOPIC METASTABILITY ...................... 40
1.8.2 MACROSCOPIC METASTABILITY ...................... 43
1.8.3 METASTABILITY IN NETWORKS ...................... 43
1.8.4 QUANTUMLIKEPHASETRANSITIONS ................. 45
1.9 REVIEW............................................... 45
EXERCISES ................................................... 46
2 GETTING THE JUMP ON QUEUEING
............................
47
2.1 INTRODUCTION .......................................... 47
2.2 WHATISA QUEUE? ..................................... 48
2.3 THEGROCERYSTORE*CHECKINGITOUT .................... 48
2.3.1 QUEUEINGANALYSISVIEW........................ 49
2.3.2 PERCEPTIONS AND DECEPTIONS . . . .................. 50
2.3.3 THEPOSTOFFICE*SNAILMAIL .................... 51
2.4 FUNDAMENTAL METRIC RELATIONSHIPS . ...................... 51
2.4.1 PERFORMANCEMEASURES ......................... 52
2.4.2 ARRIVALRATE .................................. 53
2.4.3 SYSTEM THROUGHPUT ........................... 55
2.4.4 NODAL THROUGHPUT . . ........................... 56
2.4.5 RELATIVE THROUGHPUT . . . . ....................... 56
2.4.6 SERVICETIME.................................. 57
2.4.7 SERVICEDEMAND............................... 58
2.4.8 UTILIZATION . ................................... 58
2.4.9 RESIDENCETIME ............................... 59
2.5 LITTLE*SLAWMEANSALOT............................... 59
2.5.1 A LITTLEINTUITION.............................. 60
2.5.2 A VISUALPROOF................................ 61
2.5.3 LITTLE*SMICROSCOPICLAW........................ 66
2.5.4 LITTLE*SMACROSCOPICLAW ....................... 66
CONTENTS XVII
2.6 UNLIMITEDREQUEST(OPEN)QUEUES....................... 67
2.6.1 SINGLESERVERQUEUE ........................... 67
2.6.2 MEASURED SERVICEDEMAND...................... 68
2.6.3 QUEUEINGDELAYS .............................. 68
2.6.4 TWINQUEUEINGCENTER ......................... 73
2.6.5 PARALLELQUEUES ............................... 74
2.6.6 DUALSERVERQUEUE*HEURISTICANALYSIS........... 76
2.7 MULTISERVERQUEUE..................................... 79
2.7.1 ERLANG*S
C
FORMULA............................ 80
2.7.2 ACCURACY OFTHEHEURISTICFORMULA............... 82
2.7.3 ERLANG*S
B
FORMULA............................ 83
2.7.4 ERLANGALGORITHMSINPERL ...................... 84
2.7.5 DUALSERVERQUEUE*EXACT ANALYSIS ............. 86
2.8 LIMITEDREQUEST(CLOSED)QUEUES........................ 88
2.8.1 CLOSEDQUEUEINGCENTER........................ 88
2.8.2 INTERACTIVERESPONSETIMELAW ................. 89
2.8.3 REPAIRMANALGORITHMINPERL ................... 90
2.8.4 RESPONSETIMECHARACTERISTIC................... 92
2.8.5 THROUGHPUT CHARACTERISTIC ...................... 93
2.8.6 FINITERESPONSETIMES......................... 94
2.8.7 APPROXIMATINGACLOSEDQUEUES................. 95
2.9 SHORTHANDFORQUEUES.................................. 99
2.9.1 QUEUESCHEMATICS ............................. 99
2.9.2 KENDALLNOTATION..............................100
2.10 COMPARATIVEPERFORMANCE ..............................101
2.10.1 MULTISERVERVERSUSUNISERVER....................102
2.10.2 MULTIQUEUEVERSUSMULTISERVER ..................102
2.10.3 THEENVELOPEPLEASE! ..........................104
2.11 GENERALIZEDSERVERS....................................105
2.11.1 INFINITE CAPACITY (IS) SERVER . . ..................106
2.11.2 EXPONENTIAL(M)SERVER ........................107
2.11.3 DETERMINISTIC(D)SERVER .......................108
2.11.4 UNIFORM(U)SERVER............................108
2.11.5 ERLANG-
K
(
E
K
) SERVER...........................108
2.11.6 HYPOEXPONENTIAL (
HYPO
*
K
) SERVER...............109
2.11.7 HYPEREXPONENTIAL (
H
K
) SERVER...................109
2.11.8 COXIAN (
COX
*
K
)SERVER.........................110
2.11.9 GENERAL(G)SERVER ............................111
2.11.10 POLLACZEK*KHINTCHINE FORMULA ..................112
2.11.11 POLLING SYSTEMS ...............................113
2.12 REVIEW...............................................115
EXERCISES ...................................................116
XVIII CONTENTS
3 QUEUEING SYSTEMS FOR COMPUTER SYSTEMS
..................
119
3.1 INTRODUCTION ..........................................119
3.2 TYPESOFCIRCUITS......................................120
3.3 POISSONPROPERTIES.....................................122
3.3.1 POISSONMERGING...............................122
3.3.2 POISSONBRANCHING.............................123
3.3.3 POISSONPASTA.................................123
3.4 OPEN-CIRCUITQUEUES ..................................124
3.4.1 SERIESCIRCUITS ................................125
3.4.2 FEEDFORWARDCIRCUITS...........................125
3.4.3 FEEDBACKCIRCUITS .............................126
3.4.4 JACKSON*STHEOREM ............................129
3.4.5 PARALLELQUEUESINSERIES .......................131
3.4.6 MULTIPLEWORKLOADSINOPENCIRCUITS ............135
3.5 CLOSED-CIRCUITQUEUES .................................136
3.5.1 ARRIVALTHEOREM ..............................136
3.5.2 ITERATIVEMVAALGORITHM.......................138
3.5.3 APPROXIMATESOLUTION..........................139
3.6 VISIT RATIOS AND ROUTING PROBABILITIES . ..................140
3.6.1 VISITRATIOSANDOPENCIRCUITS..................142
3.6.2 VISITRATIOSANDCLOSEDCIRCUITS.................143
3.7 MULTIPLEWORKLOADSINCLOSEDCIRCUITS ...................144
3.7.1 WORKLOADCLASSES..............................144
3.7.2 BASELINEANALYSIS..............................145
3.7.3 AGGREGATEANALYSIS ............................146
3.7.4 COMPONENTANALYSIS...........................150
3.8 WHENISAQUEUEINGCIRCUITSOLVABLE?....................151
3.8.1 MVAISA STYLEOFTHINKING.....................152
3.8.2 BCMPRULES .................................153
3.8.3 SERVICECLASSES................................154
3.9 CLASSICCOMPUTERSYSTEMS..............................155
3.9.1 TIME-SHARESCHEDULER..........................155
3.9.2 FAIR-SHARESCHEDULER...........................157
3.9.3 PRIORITYSCHEDULING ............................158
3.9.4 THREADSSCHEDULER.............................160
3.10 WHATQUEUEINGMODELSCANNOTDO......................161
3.11 REVIEW...............................................163
EXERCISES ...................................................164
4 LINUX LOAD AVERAGE*TAKE A LOAD OFF !
....................
167
4.1 INTRODUCTION ..........................................167
4.1.1 LOADAVERAGEREPORTING .......................168
4.1.2 WHATISAN*AVERAGE*LOAD? ...................169
4.2 A SIMPLEEXPERIMENT ..................................170
4.2.1 EXPERIMENTALRESULTS ..........................172
CONTENTS XIX
4.2.2 SUBMERGING INTO THE KERNEL . . . ..................173
4.3 LOADCALCULATION......................................174
4.3.1 FIXED-POINTARITHMETIC.........................175
4.3.2 MAGICNUMBERS ...............................176
4.3.3 EMPTYRUN-QUEUE ............................178
4.3.4 OCCUPIED RUN-QUEUE ..........................179
4.3.5 EXPONENTIALDAMPING..........................180
4.4 STEADY-STATEAVERAGES .................................183
4.4.1 TIME-AVERAGEDQUEUELENGTH...................184
4.4.2 LINUXSCHEDULERMODEL.........................184
4.5 LOADAVERAGESANDTRENDVISUALIZATION ..................187
4.5.1 WHATISWRONGWITHLOADAVERAGES .............187
4.5.2 NEWVISUALPARADIGM..........................187
4.5.3 APPLICATIONTOWORKLOADMANAGEMENT ...........189
4.6 REVIEW...............................................190
EXERCISES ...................................................190
5 PERFORMANCE BOUNDS AND LOG JAMS
........................
191
5.1 INTRODUCTION ..........................................191
5.2 OUT OF BOUNDS IN FLORIDA . . . . ...........................191
5.2.1 LOADTESTRESULTS .............................192
5.2.2 BOTTLENECKS AND BOUNDS ........................192
5.3 THROUGHPUT BOUNDS ...................................193
5.3.1 SATURATION THROUGHPUT . . .......................193
5.3.2 UNCONTENDED THROUGHPUT ......................194
5.3.3 OPTIMALLOAD.................................195
5.4 RESPONSE TIME BOUNDS . ...............................196
5.4.1 UNCONTENDED RESPONSETIME....................196
5.4.2 SATURATIONRESPONSETIME......................196
5.4.3 WORST*CASERESPONSEBOUND ...................197
5.5 MEANWHILE, BACK IN FLORIDA
...
..........................198
5.5.1 BALANCED BOUNDS . . . ...........................199
5.5.2 BALANCEDDEMAND .............................199
5.5.3 BALANCED THROUGHPUT . . . .......................199
5.6 THEX*FILES:ENCOUNTERSWITHPERFORMANCEALIENS .........201
5.6.1 X-WINDOWSARCHITECTURE .......................201
5.6.2 PRODUCTIONENVIRONMENT .......................202
5.7 CLOSEENCOUNTERSOFTHEPERFORMANCEKIND................202
5.7.1 CLOSEENCOUNTERSI:RUMORS ....................202
5.7.2 CLOSEENCOUNTERSII:MEASUREMENTS ..............203
5.7.3 CLOSEENCOUNTERSIII:ANALYSIS ..................203
5.8 PERFORMANCEALIENSREVEALED............................205
5.8.1 OUTOFSIGHT,OUTOFMIND......................205
5.8.2 LOG*JAMMED PERFORMANCE . . . . ..................207
5.8.3 TOGETALOGYOUNEEDATREE..................208
XX CONTENTS
5.9 X-WINDOWS SCALABILITY . . ...............................210
5.9.1 MEASURINGSIBLINGX-EVENTS.....................210
5.9.2 SUPERLINEARRESPONSE ..........................211
5.10 REVIEW...............................................212
EXERCISES ...................................................212
PART II PRACTICE OF SYSTEM PERFORMANCE ANALYSIS
6 PRETTY DAMN QUICK (PDQ)*A SLOW INTRODUCTION
.........
215
6.1 INTRODUCTION ..........................................215
6.2 HOWTOBUILDPDQCIRCUITS.............................215
6.3 INPUTS AND OUTPUTS ....................................215
6.3.1 SETTINGUPPDQ ..............................216
6.3.2 SOMEGENERALGUIDELINES.......................218
6.4 SIMPLEANNOTATEDEXAMPLE.............................219
6.4.1 CREATINGTHEPDQMODEL.......................219
6.4.2 READINGTHEPDQREPORT.......................221
6.4.3 VALIDATINGTHEPDQMODEL .....................222
6.5 PERLPDQMODULE .....................................223
6.5.1 PDQDATATYPES..............................223
6.5.2 PDQGLOBALVARIABLES .........................224
6.5.3 PDQFUNCTIONS ...............................225
6.6 FUNCTIONSYNOPSES.....................................225
6.6.1 PDQ::CREATECLOSED............................225
6.6.2 PDQ::CREATEMULTINODE ........................226
6.6.3 PDQ::CREATENODE .............................226
6.6.4 PDQ::CREATEOPEN .............................227
6.6.5 PDQ::CREATESINGLENODE........................228
6.6.6 PDQ::GETLOADOPT ............................228
6.6.7 PDQ::GETQUEUELENGTH.........................229
6.6.8 PDQ::GETRESIDENCETIME .......................229
6.6.9 PDQ::GETRESPONSE ............................230
6.6.10 PDQ::GETTHRUMAX............................231
6.6.11 PDQ::GETTHRUPUT . . ...........................231
6.6.12 PDQ::GETUTILIZATION ...........................232
6.6.13 PDQ::INIT ....................................232
6.6.14 PDQ::REPORT .................................233
6.6.15 PDQ::SETDEBUG ...............................234
6.6.16 PDQ::SETDEMAND .............................235
6.6.17 PDQ::SETTUNIT ...............................236
6.6.18 PDQ::SETVISITS................................236
6.6.19 PDQ::SETWUNIT...............................237
6.6.20 PDQ::SOLVE...................................237
6.7 CLASSICQUEUESINPDQ.................................238
CONTENTS XXI
6.7.1 DELAYNODEINPDQ ...........................238
6.7.2
M/M/
1INPDQ...............................238
6.7.3
M/M/M
INPDQ..............................239
6.7.4
M/M/
1
//N
INPDQ...........................239
6.7.5
M/M/M//N
INPDQ ..........................240
6.7.6 FEEDFORWARDCIRCUITSINPDQ ...................240
6.7.7 FEEDBACKCIRCUITSINPDQ......................242
6.7.8 PARALLELQUEUESINSERIES .......................244
6.7.9 MULTIPLEWORKLOADSINPDQ ....................246
6.7.10 PRIORITYQUEUEINGINPDQ......................252
6.7.11 LOAD-DEPENDENTSERVERSINPDQ ................258
6.7.12 BOUNDS ANALYSIS WITH PDQ . . . ..................263
6.8 REVIEW...............................................264
EXERCISES ...................................................264
7 MULTICOMPUTER ANALYSIS WITH PDQ
........................
267
7.1 INTRODUCTION ..........................................267
7.2 MULTIPROCESSORARCHITECTURES............................268
7.2.1 SYMMETRICMULTIPROCESSORS .....................269
7.2.2 MULTIPROCESSOR CACHES .........................270
7.2.3 CACHEBASHING ................................271
7.3 MULTIPROCESSORMODELS .................................272
7.3.1 SINGLE-BUSMODELS.............................273
7.3.2 PROCESSING POWER..............................274
7.3.3 MULTIPLE-BUSMODELS...........................276
7.3.4 CACHEPROTOCOLS...............................278
7.3.5 IRONLAWOFPERFORMANCE .......................287
7.4 MULTICOMPUTERMODELS .................................289
7.4.1 PARALLELQUERYCLUSTER .........................290
7.4.2 QUERYSATURATIONMETHOD ......................294
7.5 REVIEW...............................................298
EXERCISES ...................................................299
8 HOW TO SCALE AN ELEPHANT WITH PDQ
......................
301
8.1 ANELEPHANTSTORY ....................................301
8.1.1 WHAT IS SCALABILITY? ...........................302
8.1.2 SPECMULTIUSERBENCHMARK ....................303
8.1.3 STEADY-STATEMEASUREMENTS .....................305
8.2 PARTSOFTHEELEPHANT ..................................306
8.2.1 SERVICEDEMANDPART ..........................307
8.2.2 THINKTIMEPART..............................307
8.2.3 USER LOADPART ...............................308
8.3 PDQ SCALABILITY MODEL . . ...............................308
8.3.1 INTERPRETATION.................................311
8.3.2 AMDAHL*SLAW ................................312
XXII CONTENTS
8.3.3 THEELEPHANT*SDIMENSIONS.....................314
8.4 REVIEW...............................................315
EXERCISES ...................................................315
9 CLIENT/SERVER ANALYSIS WITH PDQ
..........................
317
9.1 INTRODUCTION ..........................................317
9.2 CLIENT/SERVERARCHITECTURES.............................318
9.2.1 MULTITIERENVIRONMENTS ........................319
9.2.2 THREE*TIER OPTIONS............................319
9.3 BENCHMARKENVIRONMENT ...............................321
9.3.1 PERFORMANCESCENARIOS .........................322
9.3.2 WORKLOADCHARACTERIZATION .....................322
9.3.3 DISTRIBUTEDWORKFLOW ..........................324
9.4 SCALABILITY ANALYSIS WITH PDQ . . . .......................325
9.4.1 BENCHMARKBASELINE ...........................326
9.4.2 CLIENTSCALEUP ................................333
9.4.3 LOADBALANCERBOTTLENECK ......................334
9.4.4 DATABASESERVERBOTTLENECK.....................334
9.4.5 PRODUCTIONCLIENTLOAD ........................335
9.4.6 SATURATIONCLIENTLOAD.........................336
9.4.7 PER-PROCESS ANALYSIS...........................338
9.5 REVIEW...............................................339
EXERCISES ...................................................339
10 WEB APPLICATION ANALYSIS WITH PDQ
......................
341
10.1 INTRODUCTION ..........................................341
10.2 HTTPPROTOCOL .......................................341
10.2.1 HTTPPERFORMANCE............................346
10.2.2 HTTPANALYSISUSINGPDQ ....................347
10.2.3 FORK-ON-DEMANDANALYSIS ......................348
10.2.4 PREFORKANALYSIS ..............................349
10.3 TWO-TIERPDQMODEL..................................355
10.3.1 DATAANDINFORMATIONARENOTTHESAME .........355
10.3.2 HTTPDPERFORMANCEMEASUREMENTS .............355
10.3.3 JAVAPERFORMANCEMEASUREMENTS ................357
10.4 MIDDLEWAREANALYSISUSINGPDQ ........................357
10.4.1 ACTIVECLIENTTHREADS..........................359
10.4.2 LOADTESTRESULTS .............................359
10.4.3 DERIVEDSERVICEDEMANDS.......................360
10.4.4 NAIVEPDQMODEL.............................360
10.4.5 ADDINGHIDDENLATENCIESINPDQ ...............365
10.4.6 ADDING OVERDRIVEN THROUGHPUT IN PDQ ..........366
10.5 REVIEW...............................................370
EXERCISES ...................................................370
CONTENTS XXIII
PART III APPENDICES
A GLOSSARY OF TERMS
.........................................
373
B A SHORT HISTORY OF BUFFERS
.................................
385
C THANKS FOR NO MEMORIES
..................................
391
C.1 LIFEINTHEMARKOVLANE................................391
C.2 EXPONENTIALINVARIANCE.................................392
C.3 SHAPEPRESERVATION ....................................394
C.4 A COUNTEREXAMPLE.....................................394
D PERFORMANCE MEASUREMENTS AND TOOLS
.....................
397
D.1 PERFORMANCECOUNTERSANDOBJECTS ......................397
D.2 JAVABYTECODEINSTRUMENTATION..........................397
D.3 GENERICPERFORMANCETOOLS .............................398
D.4 DISPLAYINGPERFORMANCEMETRICS .........................398
D.5 STORINGPERFORMANCEMETRICS............................401
D.6 PERFORMANCEPREDICTIONTOOLS...........................401
D.7 HOWACCURATEAREYOURDATA? ..........................402
D.8 AREYOURDATAPOISSONIAN? .............................402
D.9 PERFORMANCEMEASUREMENTSTANDARDS ....................407
E COMPENDIUM OF QUEUEING EQUATIONS
......................
409
E.1 FUNDAMENTAL METRICS . . . ...............................409
E.2 QUEUEINGDELAYS ......................................410
F INSTALLING PDQ AND PERLPROGRAMS
.........................
411
F.1 PERLSCRIPTS...........................................411
F.2 PDQSCRIPTS..........................................412
F.3 INSTALLING THE PDQ MODULE . . ...........................412
G UNITS AND ABBREVIATIONS
...................................
415
G.1 SIPREFIXES............................................415
G.2 TIMESUFFIXES .........................................415
G.3 CAPACITYSUFFIXES......................................415
H SOLUTIONS TO SELECTED EXERCISES
............................
417
BIBLIOGRAPHY
...................................................
421
INDEX
..........................................................
427
|
| any_adam_object | 1 |
| author | Gunther, Neil J. 1950- |
| author_GND | (DE-588)173080030 |
| author_facet | Gunther, Neil J. 1950- |
| author_role | aut |
| author_sort | Gunther, Neil J. 1950- |
| author_variant | n j g nj njg |
| building | Verbundindex |
| bvnumber | BV019438308 |
| classification_rvk | ST 250 |
| classification_tum | DAT 366f DAT 254f DAT 280f |
| ctrlnum | (OCoLC)314553426 (DE-599)BVBBV019438308 |
| dewey-full | 004.24 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.24 004 |
| dewey-search | 004.24 004 |
| dewey-sort | 14.24 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02487nam a2200637 c 4500</leader><controlfield tag="001">BV019438308</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180809 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">041020s2005 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">04,N31,0016</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">971707952</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540208658</subfield><subfield code="c">Gb. : EUR 58.80 (freier Pr.), CHF 97.50 (freier Pr.)</subfield><subfield code="9">3-540-20865-8</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540208655</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">10969335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)314553426</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019438308</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.24</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 366f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 254f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 280f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gunther, Neil J.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173080030</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analyzing computer system performance with Perl: PDQ</subfield><subfield code="b">with 59 tables</subfield><subfield code="c">Neil J. Gunther</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 436 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Open Source</subfield><subfield code="0">(DE-588)4548264-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Systemverwaltung</subfield><subfield code="0">(DE-588)4257084-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Perl</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4307836-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lastteilung</subfield><subfield code="0">(DE-588)4323960-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Systemverwaltung</subfield><subfield code="0">(DE-588)4257084-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Lastteilung</subfield><subfield code="0">(DE-588)4323960-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Open Source</subfield><subfield code="0">(DE-588)4548264-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Perl</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4307836-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012891856&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012891856</subfield></datafield></record></collection> |
| id | DE-604.BV019438308 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T20:00:10Z |
| institution | BVB |
| isbn | 3540208658 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012891856 |
| oclc_num | 314553426 |
| open_access_boolean | |
| owner | DE-739 DE-20 DE-91G DE-BY-TUM DE-29T DE-706 |
| owner_facet | DE-739 DE-20 DE-91G DE-BY-TUM DE-29T DE-706 |
| physical | XXIII, 436 S. graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Springer |
| record_format | marc |
| spelling | Gunther, Neil J. 1950- Verfasser (DE-588)173080030 aut Analyzing computer system performance with Perl: PDQ with 59 tables Neil J. Gunther Berlin [u.a.] Springer 2005 XXIII, 436 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer (DE-588)4070083-5 gnd rswk-swf Leistungsbewertung (DE-588)4167271-9 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Open Source (DE-588)4548264-0 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Systemverwaltung (DE-588)4257084-0 gnd rswk-swf Perl Programmiersprache (DE-588)4307836-9 gnd rswk-swf Lastteilung (DE-588)4323960-2 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Systemverwaltung (DE-588)4257084-0 s Lastteilung (DE-588)4323960-2 s Open Source (DE-588)4548264-0 s Perl Programmiersprache (DE-588)4307836-9 s DE-604 Computer (DE-588)4070083-5 s Leistungsbewertung (DE-588)4167271-9 s Warteschlangentheorie (DE-588)4255044-0 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012891856&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Gunther, Neil J. 1950- Analyzing computer system performance with Perl: PDQ with 59 tables Computer (DE-588)4070083-5 gnd Leistungsbewertung (DE-588)4167271-9 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Open Source (DE-588)4548264-0 gnd Rechnernetz (DE-588)4070085-9 gnd Systemverwaltung (DE-588)4257084-0 gnd Perl Programmiersprache (DE-588)4307836-9 gnd Lastteilung (DE-588)4323960-2 gnd |
| subject_GND | (DE-588)4070083-5 (DE-588)4167271-9 (DE-588)4255044-0 (DE-588)4548264-0 (DE-588)4070085-9 (DE-588)4257084-0 (DE-588)4307836-9 (DE-588)4323960-2 |
| title | Analyzing computer system performance with Perl: PDQ with 59 tables |
| title_auth | Analyzing computer system performance with Perl: PDQ with 59 tables |
| title_exact_search | Analyzing computer system performance with Perl: PDQ with 59 tables |
| title_full | Analyzing computer system performance with Perl: PDQ with 59 tables Neil J. Gunther |
| title_fullStr | Analyzing computer system performance with Perl: PDQ with 59 tables Neil J. Gunther |
| title_full_unstemmed | Analyzing computer system performance with Perl: PDQ with 59 tables Neil J. Gunther |
| title_short | Analyzing computer system performance with Perl: PDQ |
| title_sort | analyzing computer system performance with perl pdq with 59 tables |
| title_sub | with 59 tables |
| topic | Computer (DE-588)4070083-5 gnd Leistungsbewertung (DE-588)4167271-9 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Open Source (DE-588)4548264-0 gnd Rechnernetz (DE-588)4070085-9 gnd Systemverwaltung (DE-588)4257084-0 gnd Perl Programmiersprache (DE-588)4307836-9 gnd Lastteilung (DE-588)4323960-2 gnd |
| topic_facet | Computer Leistungsbewertung Warteschlangentheorie Open Source Rechnernetz Systemverwaltung Perl Programmiersprache Lastteilung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012891856&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT guntherneilj analyzingcomputersystemperformancewithperlpdqwith59tables |