Modeling and analysis of operating systems using extended QN techniques and Petri nets:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English German |
| Veröffentlicht: |
Erlangen
Inst. für Informatik
2001
|
| Schriftenreihe: | Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg
34,9 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Erlangen-Nürnberg, Univ., Diss., 2000. - Enth. Zsfassung in dt. Sprache |
| Beschreibung: | X, 184 S. Ill., graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013878273 | ||
| 003 | DE-604 | ||
| 005 | 20011019 | ||
| 007 | t| | ||
| 008 | 010827s2001 xx ad|| m||| 00||| eng d | ||
| 016 | 7 | |a 963120875 |2 DE-101 | |
| 035 | |a (OCoLC)64650974 | ||
| 035 | |a (DE-599)BVBBV013878273 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng |a ger | |
| 049 | |a DE-29 |a DE-29T |a DE-739 |a DE-12 |a DE-19 |a DE-703 |a DE-91G |a DE-83 |a DE-188 | ||
| 084 | |a ST 260 |0 (DE-625)143632: |2 rvk | ||
| 084 | |a MAT 600d |2 stub | ||
| 084 | |a DAT 516d |2 stub | ||
| 100 | 1 | |a Greiner, Stefan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Modeling and analysis of operating systems using extended QN techniques and Petri nets |c Stefan Greiner |
| 264 | 1 | |a Erlangen |b Inst. für Informatik |c 2001 | |
| 300 | |a X, 184 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg |v 34,9 | |
| 500 | |a Zugl.: Erlangen-Nürnberg, Univ., Diss., 2000. - Enth. Zsfassung in dt. Sprache | ||
| 502 | |a Zugl.: Erlangen, Nürnberg, Univ., Diss., 2001 | ||
| 650 | 7 | |a Hochschulschrift |2 gtt | |
| 650 | 0 | 7 | |a Analyse |0 (DE-588)4122795-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Petri-Netz |0 (DE-588)4045388-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Betriebssystem |0 (DE-588)4006216-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Betriebssystem |0 (DE-588)4006216-8 |D s |
| 689 | 0 | 1 | |a Analyse |0 (DE-588)4122795-5 |D s |
| 689 | 0 | 2 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Betriebssystem |0 (DE-588)4006216-8 |D s |
| 689 | 1 | 1 | |a Analyse |0 (DE-588)4122795-5 |D s |
| 689 | 1 | 2 | |a Petri-Netz |0 (DE-588)4045388-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg |v 34,9 |w (DE-604)BV013391036 |9 34,9 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009494720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009494720 | |
Datensatz im Suchindex
| _version_ | 1820875847401209856 |
|---|---|
| adam_text |
Contents
1 Introduction and Overview 1
1.1 Introduction 1
1.2 Modeling Cycle 1
1.3 Modeling Techniques 3
1.3.1 Reliability and Availability Models 4
1.3.1.1 Reliability Block Diagrams 5
1.3.1.2 Reliability Graphs 5
1.3.1.3 Fault Trees 5
1.3.2 Performance and Functional Models 6
1.3.2.1 Stochastic Process Algebras 6
1.3.2.2 Precedence Graph Models 7
1.3.2.3 Markov Models 8
1.3.2.4 Queueing Network Models 10
1.3.2.5 Performability Models 10
1.3.3 Combined Performance and Performability Models 11
1.3.3.1 PetriNets 11
1.3.3.2 Generalized Stochastic Petri Nets (GSPN) 12
1.4 Solution Techniques 13
1.4.1 Simulation 13
1.4.2 Numerical Solution Techniques 14
1.4.2.1 Solution Methods for Linear Systems of Equations . 15
1.4.2.2 Solution Methods for Differential Systems of Equa¬
tions 17
1.4.3 Analytical Solution Techniques 18
2 New Queueing Network Analysis Techniques 23
2.1 Introduction and Motivation 23
2.2 Queueing Networks with Class Switching 23
2.2.1 The Concept of Chains 24
2.2.1.1 Recurrent and Transient States of a Chain 25
2.2.1.2 Determining the Chains of a Network 27
2.2.1.3 Extension to Class Switching 29
2.3 Queueing Networks with Priorities 32
2.3.1 The Pure PR or HOL Priority Strategy 33
2.3.2 Combination of the PR and HOL Priority Strategy 35
2.4 Class Switching and Mixed Priority Strategies 36
2.4.1 The Concept of Shadow Server 36
2.4.2 Extensions of the Shadow Technique 38
2.4.2.1 Extension of Kaufmann 38
2.4.2.2 Bisection 39
2.4.2.3 Class Switching 40
2.4.2.4 Mixed Strategy and /M/m HOL Priority Node . . 41
i
j
ii CONTENTS
2.4.2.5 Class Switching and Arbitrary Mixed Priorities . 45
2.4.2.6 Extended /M/m Node 50
2.4.3 Shadow Technique and Quota Nodes 54
3 Applications 57
3.1 Modeling and Analysis of Operating Systems 57
3.1.1 Introduction and Motivation 57
3.1.2 The Hierarchical Modeling Approach 58
3.1.3 The Unix Operating System 59
3.1.3.1 Model of a Unix Job 59
3.1.3.2 System Assumptions 60
3.1.3.3 The Monoprocessor Model 62
3.1.3.4 The Master Slave Model 66
3.1.3.5 The Associated Processor Model 68
3.1.3.6 Interpretation of the Results 70
3.1.3.7 Influence of the Priorities 71
3.1.4 The Windows NT Operating System 71
3.1.4.1 History of Windows NT 71
3.1.4.2 System Overview 72
3.1.4.3 Modeling and Analysis of Windows NT 73
3.1.5 The BS2000 Operating System 78
3.1.5.1 The Task Scheduler PRIOR 79
3.1.5.2 Modeling BS2000 with SRN 80
3.1.5.3 Description of the User Context 83
3.1.5.4 Numerical Results 85
3.2 Analysis of Shared Memory Architectures 89
3.2.1 Classification of Hardware Architectures 90
3.2.2 MIMD Architectures 91
3.2.2.1 Shared Memory Architectures 92
3.2.2.2 Message Passing Architectures 95
3.2.3 Caches in Shared Memory Multiprocessor Systems 96
3.2.3.1 Inner Model for Instruction Cache Blocks 97
3.2.3.2 Inner Model for Private Cache Blocks 98
3.2.3.3 Inner Model for Shared Cache Blocks 98
3.2.3.4 Parameters of the Queueing Network 103
3.2.3.5 Numerical Results 105
3.2.4 A NUMA Multiprocessor Model 106
3.2.4.1 Problem Description 106
3.2.4.2 The Basic NUMA Model 107
3.2.4.3 Petri Net Model of the NUMA System 109
3.2.4.4 Integration of Cache Coherence Protocols Ill
3.2.4.5 Computation of Pj 119
4 Summary and Outlook 123
A Analysis Tools 125
A.I The Analysis Tool PEPSY 125
A.I.I Main Structure of PEPSY 125
A.1.1.1 The Input File 125
A.1.1.2 The Output File ' ' 126
A.1.1.3 Control Files 12g
A.I.2 Example of Using PEPSY 127
A.1.3 The Graphical Front End XPEPSY 129
A.2 The Analysis Tool WinPEPSY '.'.'. 130
CONTENTS iii
A.2.1 General Notes to the WinPEPSY GUI 130
A.2.2 Model Specification 132
A.2.2.1 Dialogue Based Specification of a Network 132
A.2.2.2 Graphical Specification of a Network 133
A.2.3 Representation of the Results 134
A.3 The Analysis Tool MOSES 135
A.3.1 The System Description Language MOSEL 135
A.3.1.1 DECLARATION Part 136
A.3.1.2 VECTOR Description Part 136
A.3.1.3 RULES Part 136
A.3.1.4 RESULT Part 137
A.3.1.5 Loops in MOSEL 137
A.3.2 Examples 137
A.3.2.1 Central Server Model 138
A.3.2.2 A Fault Tolerant Multiprocessor System 139
A.4 The Analysis Tool SPNP 141
A.4.1 The CSPL Language 141
A.4.1.1 Parameters Segment 141
A.4.1.2 Net Segment 142
A.4.1.3 Assert Segment 142
A.4.1.4 AcJnit and Ac_reach Segment 143
A.4.1.5 AcJinal Segment 143
A.4.2 The iSPN Environment 143
A.4.3 Simple SPNP Example 145
B Important Distribution Functions 147
B.I Exponential Distribution 147
B.2 Weibull Distribution 148
B.3 Important Characteristics 150
C Simple Applications 151
C.I Numerical Solution Techniques 151
C.I.I Birth Process with Weibull Distributed Rates 151
C.I.2 An Interactive Computer System 153
C.I.2.1 Model Description 153
C.l.2.2 Model Specification 154
C.l.2.3 Results 154
C.2 Analytical Solution Techniques 156
C.2.1 A Wafer Production System 156
C.2.2 Loosely Coupled Multiprocessor without Caches 159
D z Transformed Routing Probability Matrix 161
D.I Example 2.1 161
D.2 Unix Monoprocessor Routing Matrix 166
Bibliography 167
Index 174
Glossary 177
List of Figures
1.1 The modeling cycle 2
1.2 A typical behavior of the availability function 4
1.3 Reliability block diagram of the bridge 5
1.4 Reliability graph of the bridge 6
1.5 A simple precedence graph model a) partition into tasks, b) assigning
to processors, c) overall model 7
1.6 Possible types of stochastic processes 8
1.7 QN model of a simple M/M/2 system 9
1.8 CTMC of the simple M/M/2 system 9
1.9 The central server queueing network model 10
1.10 A simple PN before and after the firing of transition ii 12
1.11 Classification of simulation methods 15
1.12 Principle of the aggregation of a CTMC 16
1.13 Principle of the Multi level algorithm 18
1.14 Overview of algorithms for PFQNs and NPFQNs 19
2.1 Modified routing matrix P 25
2.2 Principle of the transformation technique. 29
2.3 Splitting into HOL and PR classes 35
2.4 Basic principle of the shadow technique 37
2.5 Shadow technique and mixed strategy. 42
2.6 Simple example network , 47
2.7 Reachability graph of the chains 47
2.8 Shadow model 48
2.9 Shadow transformation of a /M/m node 51
2.10 Extended /M/m node (original form) 51
2.11 Extended /M/m node (queue extended form) 52
2.12 Extended /M/m node (complete shadow form) 52
2.13 Generalized extended /M/m node (original form) 53
2.14 Generalized extended /M/m node (complete shadow form) 54
2.15 Transformation of a quota node into a shadow node 55
3.1 Layer model of an operating system 57
3.2 Hierarchical model for a general purpose operating system 59
3.3 Model of a Unix job 59
3.4 Internal behavior for processors in the Unix operating system. . 60
3.5 Original QN model of the monoprocessor system 62
3.6 Transformed QN model of the monoprocessor system 63
3.7 "Reachability graph" of the chain 63
3.8 Original QN model of the master slave system 67
3.9 Transformed QN model of the master slave system 67
3.10 Original QN model of the associated processor system 68
3.11 Transformed QN model of the associated processor system 69
v
vi LIST OF FIGURES
3.12 Throughput for the different Unix models 70
3.13 Windows NT 4.0 architecture 72
3.14 Original model of the Windows NT system 74
3.15 Shadow transformed model of the Windows NT system 75
3.16 Shadow transformed model of the detailed Windows NT system. . . 76
3.17 System throughput as a function of the number of jobs 77
3.18 Context utilizations as a function of the number of jobs 77
3.19 System throughput as a function of snscr 78
3.20 Possible behavior of the priority of a job 80
3.21 Model of a BS2000 job 80
3.22 Linear approximation of the priority mechanism 81
3.23 Petri net model of BS2000 82
3.24 Guard function associated to transition t_arrival 82
3.25 PN model for the user context of BS2000 with two priority classes. 84
3.26 Guard function for transition TS (» = l.n) 84
3.27 Guard functions associated with the transitions T4 and T5 85
3.28 Guard functions associated with the transitions TH1 and TH2. . . 85
3.29 Guards, variable arc functions and transition priority relationship. . 86
3.30 Number of jobs in the queues for the arrival rate 1.0 87
3.31 Variation of the number of CPUs 87
3.32 Percentages, a job spends in the different CPU contexts 88
3.33 Percentages, a job spends in the CPU or 10 88
3.34 Throughput comparison for the arrival rate 0.005 90
3.35 a) SIMD b) MIMD multiprocessor architecture 91
3.36 Subdivision of MIMD architectures 92
3.37 UMA architectures 93
3.38 UMA architectures with caches 93
3.39 NUMA architectures with processor memory pairs 94
3.40 Cache only memory architectures 94
3.41 Message passing architectures (non remote memory access) 95
3.42 Outer system model 97
3.43 CTMC for an instruction cache block (inner model 1) 98
3.44 CTMC for a private cache block (inner model 2) 98
3.45 CTMC for shared cache blocks using the write once protocol (inner
model 3) 99
3.46 CTMC for shared cache blocks using the MESI protocol 101
3.47 QN model of a NUMA multiprocessor system 107
3.48 Path of a memory request 108
3.49 Simplified model of the NUMA multiprocessor system 108
3.50 GSPN model of one processor node 109
3.51 Heavily loaded processor nodes 117
3.52 System throughput with a) Ndf = 2000 b) Ndt = 10000 118
3.53 Throughput as a function of the mean arrival time for class 1 and
class 2 tasks a) class 1 throughput b) class 2 throughput c) overall
throughput 122
A.I Simple queueing network example 127
A.2 Model description file e.example 127
A.3 List of applicable methods presented by the selection program. . . . 128
A.4 Performance measures of the network e_example 128
A.5 The main XPEPSY window 129
A.6 a) Node data dialog box. b) Menu of solution methods 130
A.7 Multi document interface of the WinPEPSY GUI 131
A.8 Dialogue window to choose the type of model specification 131
LIST OF FIGURES vii
A.9 Window for defining the node types 132
A.10 Viewing the overall network specification using a tree structure. . . 133
A.11 Main window of the graphical editor 134
A. 12 Steps when computing performance measures with MOSES 135
A.13 Queueing network model of the central server system 138
A.14 MOSEL implementation of the central server model without loops. 138
A.15 MOSEL implementation of the central server system with loops. . . 139
A. 16 A simple fault tolerant multiprocessor system 139
A. 17 MOSEL implementation of the fault tolerant multiprocessor system 140
A.18 Basic structure of a CSPL input file 141
A.19 The CSPL net segment 142
A.20 Basic structure of iSPN 143
A.21 The iSPN Petri net editor 144
A.22 The iSPN output page 144
A.23 Simple SPN example 145
A.24 CSPL file for the simple SPN 145
B.I Mean number of accumulated failures over time 149
C.I General Markov model of the disk behavior 151
C.2 Simplified Markov model of the disk behavior 152
C.3 Cost associated with the failure of the disk 153
C.4 Model of an interactive computer system 153
C.5 MOSEL specification of the interactive computer system 154
C.6 Number of iterations and corresponding system ticks as a function of
increasing system size 155
C.7 Number of iterations as a function of increasing stiffness 156
C.8 Queueing network model of the wafer production system 157
C.9 Mean response time as a function of the number of machines. . . . 158
CIO Queueing network model of a simple multiprocessor system 159
List of Tables
3 1 Routing probability matrix 61
3.2 Throughput as a function of sUser and variation of pdone 66
3.3 Throughput as a function of suser and variation of pi0 66
3.4 Throughput as a function of suseT and variation of skern 66
3.5 Throughput as a function of suser and variation of pdont 67
3.6 Throughput as a function of suser and variation of piO 68
3.7 Throughput as a function of suser and variation of Skem 68
3.8 Throughput as a function of suser and variation of Pdone 69
3.9 Throughput as a function of suser and variation of pio 69
3.10 Throughput as a function of suser and variation of Sfeern. . 69
3.11 Impact of the priorities {pdone = 0.01) 71
3.12 Routing probability matrix 76
3.13 Service times for the Windows NT model 76
3.14 Parameters for the analysis of the BS2000 operating system 86
3.15 Results for different Erlang distributions 89
3.16 Classification characteristics of MIMD architectures \ . . . 91
3.17 Performance measures for the Write Once protocol with nbus — 1 00 105
3.18 Performance measures for the Write Once protocol with fitus = 1 50. 106
3.19 Parameters for the analysis of different cache protocols 117
3.20 Parameters for the access behavior 117
3.21 System parameters assuming self scheduling 119
3.22 System parameters assuming a fixed task assignment 119
3.23 System parameters assuming a mixed task assignment 120
3.24 Entries of Pj (j = 1,2) for the self scheduling case 120
3.25 Entries of Pj(j = 1,2) for the fixed scheduling case 120
3.26 Entries of Pj (j = 1,2) for the mixed scheduling case 120
B.I Important distribution functions and their characteristics 150
C.I Input parameters for the wafer production system , 158
C.2 Performance measures for a loosely coupled multiprocessor system
with varying number of I/O processors 159
ix |
| any_adam_object | 1 |
| author | Greiner, Stefan |
| author_facet | Greiner, Stefan |
| author_role | aut |
| author_sort | Greiner, Stefan |
| author_variant | s g sg |
| building | Verbundindex |
| bvnumber | BV013878273 |
| classification_rvk | ST 260 |
| classification_tum | MAT 600d DAT 516d |
| ctrlnum | (OCoLC)64650974 (DE-599)BVBBV013878273 |
| discipline | Informatik Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV013878273</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20011019</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">010827s2001 xx ad|| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">963120875</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)64650974</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013878273</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 260</subfield><subfield code="0">(DE-625)143632:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 600d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Greiner, Stefan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modeling and analysis of operating systems using extended QN techniques and Petri nets</subfield><subfield code="c">Stefan Greiner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Erlangen</subfield><subfield code="b">Inst. für Informatik</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 184 S.</subfield><subfield code="b">Ill., 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="490" ind1="1" ind2=" "><subfield code="a">Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg</subfield><subfield code="v">34,9</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Erlangen-Nürnberg, Univ., Diss., 2000. - Enth. Zsfassung in dt. Sprache</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Erlangen, Nürnberg, Univ., Diss., 2001</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Hochschulschrift</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Analyse</subfield><subfield code="0">(DE-588)4122795-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Betriebssystem</subfield><subfield code="0">(DE-588)4006216-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Betriebssystem</subfield><subfield code="0">(DE-588)4006216-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Analyse</subfield><subfield code="0">(DE-588)4122795-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</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">Betriebssystem</subfield><subfield code="0">(DE-588)4006216-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Analyse</subfield><subfield code="0">(DE-588)4122795-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg</subfield><subfield code="v">34,9</subfield><subfield code="w">(DE-604)BV013391036</subfield><subfield code="9">34,9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=009494720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009494720</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013878273 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:22:08Z |
| institution | BVB |
| language | English German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009494720 |
| oclc_num | 64650974 |
| open_access_boolean | |
| owner | DE-29 DE-29T DE-739 DE-12 DE-19 DE-BY-UBM DE-703 DE-91G DE-BY-TUM DE-83 DE-188 |
| owner_facet | DE-29 DE-29T DE-739 DE-12 DE-19 DE-BY-UBM DE-703 DE-91G DE-BY-TUM DE-83 DE-188 |
| physical | X, 184 S. Ill., graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Inst. für Informatik |
| record_format | marc |
| series | Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg |
| series2 | Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg |
| spelling | Greiner, Stefan Verfasser aut Modeling and analysis of operating systems using extended QN techniques and Petri nets Stefan Greiner Erlangen Inst. für Informatik 2001 X, 184 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg 34,9 Zugl.: Erlangen-Nürnberg, Univ., Diss., 2000. - Enth. Zsfassung in dt. Sprache Zugl.: Erlangen, Nürnberg, Univ., Diss., 2001 Hochschulschrift gtt Analyse (DE-588)4122795-5 gnd rswk-swf Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf Petri-Netz (DE-588)4045388-1 gnd rswk-swf Betriebssystem (DE-588)4006216-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Betriebssystem (DE-588)4006216-8 s Analyse (DE-588)4122795-5 s Warteschlangennetz (DE-588)4225823-6 s DE-604 Petri-Netz (DE-588)4045388-1 s Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg 34,9 (DE-604)BV013391036 34,9 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009494720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Greiner, Stefan Modeling and analysis of operating systems using extended QN techniques and Petri nets Arbeitsberichte des Instituts für Informatik, Friedrich-Alexander-Universität Erlangen-Nürnberg Hochschulschrift gtt Analyse (DE-588)4122795-5 gnd Warteschlangennetz (DE-588)4225823-6 gnd Petri-Netz (DE-588)4045388-1 gnd Betriebssystem (DE-588)4006216-8 gnd |
| subject_GND | (DE-588)4122795-5 (DE-588)4225823-6 (DE-588)4045388-1 (DE-588)4006216-8 (DE-588)4113937-9 |
| title | Modeling and analysis of operating systems using extended QN techniques and Petri nets |
| title_auth | Modeling and analysis of operating systems using extended QN techniques and Petri nets |
| title_exact_search | Modeling and analysis of operating systems using extended QN techniques and Petri nets |
| title_full | Modeling and analysis of operating systems using extended QN techniques and Petri nets Stefan Greiner |
| title_fullStr | Modeling and analysis of operating systems using extended QN techniques and Petri nets Stefan Greiner |
| title_full_unstemmed | Modeling and analysis of operating systems using extended QN techniques and Petri nets Stefan Greiner |
| title_short | Modeling and analysis of operating systems using extended QN techniques and Petri nets |
| title_sort | modeling and analysis of operating systems using extended qn techniques and petri nets |
| topic | Hochschulschrift gtt Analyse (DE-588)4122795-5 gnd Warteschlangennetz (DE-588)4225823-6 gnd Petri-Netz (DE-588)4045388-1 gnd Betriebssystem (DE-588)4006216-8 gnd |
| topic_facet | Hochschulschrift Analyse Warteschlangennetz Petri-Netz Betriebssystem |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009494720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV013391036 |
| work_keys_str_mv | AT greinerstefan modelingandanalysisofoperatingsystemsusingextendedqntechniquesandpetrinets |