Schedulability tests for real-time uni- and multiprocessor systems: focusing on partitioned approaches
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Uelvesbüll
<<Der>> Andere Verl.
2014
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XXXIV, 270 S. graph. Darst. 25 cm |
| ISBN: | 9783862474394 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042401851 | ||
| 003 | DE-604 | ||
| 005 | 20150330 | ||
| 007 | t | ||
| 008 | 150311s2014 gw d||| m||| 00||| eng d | ||
| 015 | |a 14,N18 |2 dnb | ||
| 015 | |a 14,A35 |2 dnb | ||
| 015 | |a 14,H09 |2 dnb | ||
| 016 | 7 | |a 1050158296 |2 DE-101 | |
| 020 | |a 9783862474394 |c kart. : EUR 69.90 (DE), EUR 71.90 (AT), sfr 95.00 (freier Pr.) |9 978-3-86247-439-4 | ||
| 024 | 3 | |a 9783862474394 | |
| 035 | |a (OCoLC)878977922 | ||
| 035 | |a (DE-599)DNB1050158296 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-SH | ||
| 049 | |a DE-83 | ||
| 082 | 0 | |a 004.33 |2 22/ger | |
| 084 | |a ST 234 |0 (DE-625)143621: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Müller, Dirk |d 1977- |e Verfasser |0 (DE-588)1049764420 |4 aut | |
| 245 | 1 | 0 | |a Schedulability tests for real-time uni- and multiprocessor systems |b focusing on partitioned approaches |c Dirk Müller |
| 264 | 1 | |a Uelvesbüll |b <<Der>> Andere Verl. |c 2014 | |
| 300 | |a XXXIV, 270 S. |b graph. Darst. |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Chemnitz, Techn. Univ., Habil.-Schr., 2014 | ||
| 650 | 0 | 7 | |a Echtzeitsystem |0 (DE-588)4131397-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Planbarkeitsanalyse |0 (DE-588)4740360-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Partition |g Informatik |0 (DE-588)4542600-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Task |0 (DE-588)4135913-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Echtzeitsystem |0 (DE-588)4131397-5 |D s |
| 689 | 0 | 1 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
| 689 | 0 | 2 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | 3 | |a Task |0 (DE-588)4135913-6 |D s |
| 689 | 0 | 4 | |a Planbarkeitsanalyse |0 (DE-588)4740360-3 |D s |
| 689 | 0 | 5 | |a Partition |g Informatik |0 (DE-588)4542600-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=4636874&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 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=027837515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027837515 | |
Datensatz im Suchindex
| _version_ | 1809771254195945472 |
|---|---|
| adam_text |
CONTENTS
LIST OF FIGURES XXIII
LIST OF TABLES XXIX
LIST OF ALGORITHMS XXXI
LIST OF LISTINGS XXXIII
I FOUNDATIONS 1
1 BASIC TERMS AND CONCEPTS 5
1.1 REAL TIME 5
1.1.1 ABSTRACTION AND TIME IN PROGRAMMING LANGUAGES . . 5
1.1.2 TIMING CONSTRAINTS AND DEADLINES 8
1.1.3 SCHEDULING 13
1.1.4 HARD, SOFT AND FIRM DEADLINES; TUFS 14
1.2 BASIC EVENT MODELS: ACTIVATION PATTERNS 19
1.2.1 PERIODIC EVENT MODEL 20
1.2.2 SPORADIC EVENT MODEL 24
1.2.3 APERIODIC EVENT MODEL 24
1.2.4 GENERALIZATIONS: REAL-TIME CALCULUS AND BUSY WINDOW
METHOD 25
1.2.5 IMPLICIT, CONSTRAINED AND ARBITRARY DEADLINES 25
1.3 BASIC TASK MODELS: PRECEDENCE CONSTRAINTS 26
1.3.1 A TASK OF INDEPENDENT JOBS 27
1.3.2 TASK CHAIN: SERIAL JOB ORDER 27
1.3.3 TASK GRAPH: GENERAL JOB ORDER DESCRIPTION 27
HTTP://D-NB.INFO/1050158296
XVI
1.3.4 GENERALIZATIONS 27
1.4 PRIORITIZATION AND PREEMPTION 29
1.4.1 PRIORITIZATION 29
1.4.2 PREEMPTION 31
1.5 RESOURCE USAGE
CONSTRAINTS 32
1.5.1 BLOCKING AND PRIORITY INVERSION 33
1.6 MULTIPROCESSOR 33
1.6.1 THE NUMBER OF PROCESSING UNITS, MULTI- AND MANYCORES 33
1.6.2 IDENTICAL, HOMOGENEOUS AND HETEROGENEOUS MULTIPRO
CESSORS 34
1.6.3 PRIORITIES ON MPS 35
1.6.4 MIGRATION 36
1.6.5 UTILIZATION ON MPS 37
1.6.6 WCRTFE ON MPS UNDER RESOURCE CONFLICTS 37
1.6.7 GLOBAL, PARTITIONED AND SEMI-PARTITIONED SCHEDULING . . 37
1.6.8 VISUALIZATION OF SCHEDULES BY GANTT CHARTS 39
1.7 SCHEDULABILITY, OPTIMALITY AND DOMINANCE 39
1.7.1 SCHEDULABILITY AND SCHEDULABILITY TESTS 39
1.7.2 FEASIBILITY 41
1.7.3 SENSITIVITY 41
1.7.4 UTILIZATION BOUNDS 41
1.7.5 OPTIMALITY 44
1.7.6 DOMINANCE 44
1.7.7 APPROXIMATION RATIO 45
1.8 SUSTAINABILITY 46
1.8.1 SCHEDULABILITY TEST SUSTAINABILITY 47
1.8.2 ACCELERATED TASK SETS 47
1.9 MODELS USED IN THIS THESIS AND STRUCTURE 48
1.9.1 MODELS USED 48
1.9.2 STRUCTURE OF THE THESIS 48
2 UNIPROCESSOR SCHEDULING 51
2.1 NECESSARY SCHEDULABILITY TESTS 51
2.2 STATIC PRIORITIES AND RMS FOR IMPLICIT
DEADLINES 51
2.2.1 EXACT SCHEDULABILITY TESTS 52
2.2.2 SUFFICIENT SCHEDULABILITY TESTS 56
2.3 STATIC PRIORITIES AND DMS FOR CONSTRAINED DEADLINES 74
2.3.1 EXACT TESTS: TDA 74
2.3.2 SUFFICIENT TESTS 75
2.4 DYNAMIC PRIORITIES FIXED ON JOB LEVEL AND EDF 76
2.4.1 EDF WITH CONSTRAINED DEADLINES 77
2.5 COMPARISONS OF EDF AND RMS 80
2.6 FULLY-DYNAMIC PRIORITIES AND LLF 81
2.7 DUAL PRIORITY SCHEDULING 82
2.7.1 RELATIONSHIPS TO OTHER PREEMPTION VARIANTS 82
2.7.2 CHOICE OF PRIORITIES AND PROMOTION POINTS 83
2.7.3 DPS FOR N = 2 TASKS 84
2.8 SUMMARY 86
II A SURVEY OF THE STATE OF THE ART IN MULTIPROCESSOR
SCHEDULING 89
3 GLOBAL SCHEDULING 93
3.1 NECESSARY SCHEDULABILITY TESTS 94
3.1.1 MAXIMUM TOTAL UTILIZATION 94
3.1.2 MAXIMUM INDIVIDUAL UTILIZATION 94
3.1.3 MAXIMUM TOTAL DEMAND 95
3.1.4 MAXIMUM INDIVIDUAL DEMAND 95
3.2 SCHEDULING ANOMALIES 95
3.3 STATIC PRIORITIES 96
3.3.1 RATE-MONOTONIC PRIORITIES AND DHALL'S EFFECT 96
3.3.2 TKC AS LINEAR COMBINATION OF PERIOD AND WCET . 98
3.3.3 UTILIZATION SEPARATION 99
3.3.4 DEADLINE-MONOTONIC PRIORITIES 100
3.3.5 TDA FOR GLOBAL FIXED-PRIORITY SCHEDULING AS A SUFFICIENT
SCHEDULABILITY TEST 100
3.3.6 DENSITY SEPARATION 102
3.3.7 ADAPTIVE DKC 102
3.3.8 SLACK-MONOTONIC WITHOUT AND WITH DENSITY SEPARATION . 102
3.3.9 SIMPLY PERIODIC TASK SETS 103
3.3.10 RELEASE TIME JITTER 103
3.4 DYNAMIC PRIORITIES FIXED ON JOB LEVEL AND GLOBAL EDF 103
3.4.1 CONSTRAINED AND ARBITRARY DEADLINES 104
3.4.2 G-EDF-LIKE SCHEDULING WITH BOUNDED LATENESS AND TAR
DINESS FOR SOFT RT SYSTEMS 105
3.5 FULLY-DYNAMIC PRIORITIES 105
3.5.1 LLF ON MPS 105
3.5.2 PFAIR SCHEDULING 106
3.5.3 T-L-PLANE-BASED RT SCHEDULING 106
3.5.4 EDF WITH TASK SPLITTING AND K PROCESSORS IN A GROUP
(EKG) 107
3.5.5 DP-WRAP 107
3.6 MINIMALLY-DYNAMIC PRIORITIES BASED ON
ZERO LAXITY 107
3.6.1 EARLIEST DEADLINE FIRST UNTIL ZERO LAXITY (EDZL) 108
3.6.2 EARLIEST DEADLINE FIRST UNTIL CRITICAL LAXITY (EDCL) . . . 108
3.6.3 FIXED-PRIORITY UNTIL ZERO LAXITY (FPZL) 108
3.6.4 FIXED PRIORITY UNTIL STATIC LAXITY (FPSL) 109
3.7 SUMMARY 110
PARTITIONED SCHEDULING 111
4.1 NECESSARY SCHEDULABILITY TESTS 112
4.2 UTILIZATION BOUND 112
4.3 PARTITIONED EDF 113
4.3.1 RELATIONSHIP TO BIN PACKING 113
4.3.2 CONSTRAINED DEADLINES 114
4.3.3 ARBITRARY DEADLINES 114
4.3.4 ALLOCATION HEURISTICS 114
4.3.5 PRESORTING 115
4.3.6 UTILIZATION BOUND 115
4.4 PARTITIONED RMS 116
4.4.1 UTILIZATION BOUND 116
4.4.2 RATE-MONOTONIC SMALL TASKS (RMST) AND VARIANTS . . . 117
XIX
4.4.3 R-BOUND-MP 119
4.4.4 FIRST FIT MATCHING PERIODS (FFMP) 121
4.4.5 FC-RATE-MONOTONIC-MATCHING (FC-RMM) 121
4.4.6 ALGORITHMS BASED ON THE EXACT UNIPROCESSOR TEST TDA . 122
4.5 COMPARISON OF SOME UTILIZATION BOUNDS FOR COMMON PARAME
TER SETTINGS 123
4.6 SUMMARY 124
5 HYBRID SCHEDULING APPROACHES 125
5.1 SEMI-PARTITIONED 125
5.1.1 EDF-BASED ALGORITHMS 125
5.1.2 RMS-BASED ALGORITHMS 126
5.2 CLUSTER-BASED APPROACHES 128
5.2.1 PHYSICAL CLUSTERS 128
5.2.2 VIRTUAL CLUSTERS 128
5.3 LESS PREEMPTIONS AND MIGRATIONS BY LESS FAIRNESS 130
5.3.1 RUN: REDUCTION TO A SERIES OF UNIPROCESSOR PROBLEMS . . 130
5.3.2 U-EDF: UNFAIR SCHEDULING ALGORITHM BASED ON EDF . . 131
5.4 SUMMARY 131
6 GENERATING SYNTHETIC TASK SETS 133
6.1 NAIVE INCORRECT AND IMPRACTICAL
APPROACHES FOR UNIPROCESSOR TASK SETS 134
6.1.1 VSCALING 135
6.1.2 UFITTING 136
6.1.3 U UNIFORM 137
6.2 A CORRECT AND FAST APPROACH FOR UNIPROCESSOR: UUNIFAST . . . 138
6.2.1 AN ELEGANT BUT SLOW VARIANT FOR UNIPROCESSOR:
UUNISORT 138
6.3 A CORRECT BUT SOMETIMES SLOW EXTENSION TO MP: UUNIFAST-
DISCARD 138
6.4 A CORRECT AND FAST APPROACH FOR MP:
RANDFIXEDSUM 139
6.5 PERIOD DISTRIBUTION: UNIFORM VS. LOG-UNIFORM 145
6.6 SUMMARY 146
XX
6.6.1 UTILIZATIONS 146
6.6.2 PERIODS 146
6.6.3 WCETFE 146
6.6.4 DEADLINES 147
III NEW RESULTS IN MULTIPROCESSOR SCHEDULING 149
7 EXPLOITING PERIOD COMPATIBILITY FOR IMPROVED PARTITIONED RMS
SCHEDULABILITY TESTS BASED ON RMST 153
7.1 INTRODUCTION 153
7.2 PRESORTING 154
7.2.1 SORTING FOR PERIOD COMPATIBILITY 156
7.3 PRINCIPLES FOR MODIFICATIONS OF THE WORKFLOW STAGES 156
7.3.1 CIRCULAR SIMILARITY MEASURE IN THE PERIOD SPACE 156
7.3.2 RELATION TO THE BEST CASE 160
7.3.3 LOGARITHM BASE FOR PERIOD SIMILARITY 163
7.3.4 ALLOCATION STRATEGY 164
7.4 MODIFICATIONS OF RMST 164
7.4.1 UNIPROCESSOR SCHEDULABILITY TEST 164
7.4.2 ALLOCATION STRATEGY 173
7.4.3 INDEX OFFSET FOR START OF X FIT 174
7.4.4 LOGARITHM BASE FOR PERIOD SIMILARITY 175
7.5 A SYSTEMATIC TERMINOLOGY FOR
RMST-RELATED ALGORITHMS 176
7.6 EVALUATION OF THE PROPOSED RMST MODIFICATIONS 177
7.6.1 UNIPROCESSOR SCHEDULABILITY TEST 177
7.6.2 ALLOCATION STRATEGY 179
7.6.3 INDEX OFFSET FOR START OF X FIT 179
7.6.4 LOGARITHM BASE FOR PERIOD SIMILARITY 180
7.6.5 COMBINATIONS 180
7.7 SUMMARY 182
8 TOTAL UTILIZATION THRESHOLDS FOR PARTITIONED EDF 185
8.1 INTRODUCTION 185
XXI
8.2 THRESHOLDS AND SHARPNESS 186
8.2.1 PHASE TRANSITIONS IN PHYSICS 186
8.2.2 THRESHOLDS AND SHARP THRESHOLDS 187
8.3 SHARP THRESHOLDS OF GRAPH PROPERTIES 188
8.3.1 GRAPHS AND HYPERGRAPHS 189
8.3.2 RANDOM GRAPHS 189
8.3.3 CONNECTIVITY IN RANDOM GRAPHS 191
8.3.4 MORE GRAPH PROPERTIES WITH SHARP THRESHOLDS 192
8.3.5 FRIEDGUT'S THEOREM 192
8.4 SATISFIABILITY PROBLEMS 193
8.4.1 BASIC PROBLEM AND NP-COMPLETENESS 193
8.4.2 SHARP THRESHOLDS OF SAT WHEN CONTROLLED
BY CONSTRAINT
DENSITY 194
8.5 PERCOLATION THEORY 194
8.5.1 PERCOLATION THRESHOLDS OF LATTICES 195
8.5.2 PERCOLATION THRESHOLDS OF GRAPHS 195
8.6 THRESHOLDS FOR UNIPROCESSOR RMS 196
8.6.1 SIMPLY PERIODIC TASK SETS 197
8.7 THRESHOLDS FOR PARTITIONED EDF 197
8.7.1 RECAPITULATING LOWER AND UPPER BOUND 198
8.7.2 BASIC APPROACH OF ESTIMATING PROBABILITY OF
SCHEDULABILITY 198
8.7.3 MONTE CARLO SIMULATION USING FFD 199
8.7.4 NUMERICAL INTEGRATION WITH CONSTRAINT EVALUATION ON A
LATTICE 200
8.7.5 TOWARDS A PARTITIONED-EDF THRESHOLD FORMULA 203
8.7.6 A NEW
PARTITIONED-EDF TEST SCHEMA FOR HARD REAL TIME206
8.8 THRESHOLDS FOR FURTHER SCHEDULING PROBLEMS 206
8.8.1 NON-PREEMPTIVE UNIPROCESSOR SCHEDULING 208
8.8.2 APERIODIC WORKLOAD AND WEB SERVER QOS 208
8.8.3 GLOBAL MP SCHEDULING 209
8.8.4 TWO-TYPE HETEROGENEOUS MP SCHEDULING 210
8.9 SUMMARY 210
XXII
IV DISCUSSION AND OUTLOOK 211
9 DISCUSSION 213
9.1 (META-)PRINCIPLES APPLIED 213
9.1.1 PARTITIONED RMS, ACCELERATED SIMPLY PERIODIC
TASK SETS, AND CIRCULAR PERIOD SIMILARITY 213
9.1.2 PARTITIONED EDF AND SHARP THRESHOLDS 214
9.2 EVALUATION OF NEW APPROACHES BY SYNTHETIC TASK SETS 215
9.3 APPLICABILITY 215
9.4 SOCIETAL RELEVANCE 216
10 OUTLOOK 217
A A BRIEF INTRODUCTION TO CIRCULAR STATISTICS 219
A.L MOTIVATION 219
A.L.L DIRECTION OF VECTORS 221
A.1.2 CASE STUDY: WIND DIRECTION 222
A.2 FIRST ORDER MOMENT: MEAN DIRECTION 224
A.3 SECOND ORDER CENTRAL MOMENT: CIRCULAR DISPERSION, VARIANCE
AND STANDARD DEVIATION 226
A.4 CIRCULAR DISTANCE AND CIRCULAR RANGE 228
A.4.1 CIRCULAR DISTANCE 228
A.4.2 CIRCULAR RANGE 229
A.5 SUMMARY 234
BIBLIOGRAPHY 237 |
| any_adam_object | 1 |
| author | Müller, Dirk 1977- |
| author_GND | (DE-588)1049764420 |
| author_facet | Müller, Dirk 1977- |
| author_role | aut |
| author_sort | Müller, Dirk 1977- |
| author_variant | d m dm |
| building | Verbundindex |
| bvnumber | BV042401851 |
| classification_rvk | ST 234 |
| ctrlnum | (OCoLC)878977922 (DE-599)DNB1050158296 |
| dewey-full | 004.33 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.33 |
| dewey-search | 004.33 |
| dewey-sort | 14.33 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV042401851</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150330</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150311s2014 gw d||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">14,N18</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">14,A35</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">14,H09</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1050158296</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783862474394</subfield><subfield code="c">kart. : EUR 69.90 (DE), EUR 71.90 (AT), sfr 95.00 (freier Pr.)</subfield><subfield code="9">978-3-86247-439-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783862474394</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)878977922</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1050158296</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-SH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.33</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 234</subfield><subfield code="0">(DE-625)143621:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Müller, Dirk</subfield><subfield code="d">1977-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1049764420</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Schedulability tests for real-time uni- and multiprocessor systems</subfield><subfield code="b">focusing on partitioned approaches</subfield><subfield code="c">Dirk Müller</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Uelvesbüll</subfield><subfield code="b"><<Der>> Andere Verl.</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXIV, 270 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Chemnitz, Techn. Univ., Habil.-Schr., 2014</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planbarkeitsanalyse</subfield><subfield code="0">(DE-588)4740360-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Partition</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4542600-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Task</subfield><subfield code="0">(DE-588)4135913-6</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">Echtzeitsystem</subfield><subfield code="0">(DE-588)4131397-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Task</subfield><subfield code="0">(DE-588)4135913-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Planbarkeitsanalyse</subfield><subfield code="0">(DE-588)4740360-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Partition</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4542600-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=4636874&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=027837515&sequence=000001&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-027837515</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042401851 |
| illustrated | Illustrated |
| indexdate | 2024-09-10T01:39:22Z |
| institution | BVB |
| isbn | 9783862474394 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027837515 |
| oclc_num | 878977922 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XXXIV, 270 S. graph. Darst. 25 cm |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | <<Der>> Andere Verl. |
| record_format | marc |
| spelling | Müller, Dirk 1977- Verfasser (DE-588)1049764420 aut Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches Dirk Müller Uelvesbüll <<Der>> Andere Verl. 2014 XXXIV, 270 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Chemnitz, Techn. Univ., Habil.-Schr., 2014 Echtzeitsystem (DE-588)4131397-5 gnd rswk-swf Planbarkeitsanalyse (DE-588)4740360-3 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Partition Informatik (DE-588)4542600-4 gnd rswk-swf Task (DE-588)4135913-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Echtzeitsystem (DE-588)4131397-5 s Mehrprozessorsystem (DE-588)4038397-0 s Scheduling (DE-588)4179449-7 s Task (DE-588)4135913-6 s Planbarkeitsanalyse (DE-588)4740360-3 s Partition Informatik (DE-588)4542600-4 s DE-604 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=4636874&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027837515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Müller, Dirk 1977- Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches Echtzeitsystem (DE-588)4131397-5 gnd Planbarkeitsanalyse (DE-588)4740360-3 gnd Scheduling (DE-588)4179449-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Partition Informatik (DE-588)4542600-4 gnd Task (DE-588)4135913-6 gnd |
| subject_GND | (DE-588)4131397-5 (DE-588)4740360-3 (DE-588)4179449-7 (DE-588)4038397-0 (DE-588)4542600-4 (DE-588)4135913-6 (DE-588)4113937-9 |
| title | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches |
| title_auth | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches |
| title_exact_search | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches |
| title_full | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches Dirk Müller |
| title_fullStr | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches Dirk Müller |
| title_full_unstemmed | Schedulability tests for real-time uni- and multiprocessor systems focusing on partitioned approaches Dirk Müller |
| title_short | Schedulability tests for real-time uni- and multiprocessor systems |
| title_sort | schedulability tests for real time uni and multiprocessor systems focusing on partitioned approaches |
| title_sub | focusing on partitioned approaches |
| topic | Echtzeitsystem (DE-588)4131397-5 gnd Planbarkeitsanalyse (DE-588)4740360-3 gnd Scheduling (DE-588)4179449-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Partition Informatik (DE-588)4542600-4 gnd Task (DE-588)4135913-6 gnd |
| topic_facet | Echtzeitsystem Planbarkeitsanalyse Scheduling Mehrprozessorsystem Partition Informatik Task Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=4636874&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027837515&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT mullerdirk schedulabilitytestsforrealtimeuniandmultiprocessorsystemsfocusingonpartitionedapproaches |