Task scheduling for parallel systems:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley-Interscience
2007
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 296 S. Ill., graph. Darst. |
| ISBN: | 0471735760 9780471735762 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023211688 | ||
| 003 | DE-604 | ||
| 005 | 20180703 | ||
| 007 | t | ||
| 008 | 080313s2007 xxuad|| |||| 00||| eng d | ||
| 010 | |a 2006052157 | ||
| 020 | |a 0471735760 |9 0-471-73576-0 | ||
| 020 | |a 9780471735762 |9 978-0-471-73576-2 | ||
| 035 | |a (OCoLC)72868271 | ||
| 035 | |a (DE-599)BVBBV023211688 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 |a DE-11 | ||
| 050 | 0 | |a QA76.58 | |
| 082 | 0 | |a 004/.35 | |
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a ST 260 |0 (DE-625)143632: |2 rvk | ||
| 100 | 1 | |a Sinnen, Oliver |d 1971- |e Verfasser |0 (DE-588)1014939569 |4 aut | |
| 245 | 1 | 0 | |a Task scheduling for parallel systems |c Oliver Sinnen |
| 264 | 1 | |a Hoboken, NJ |b Wiley-Interscience |c 2007 | |
| 300 | |a XIII, 296 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Multitasking (Computer science) | |
| 650 | 4 | |a Computer scheduling | |
| 650 | 0 | 7 | |a Parallelrechner |0 (DE-588)4173280-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelrechner |0 (DE-588)4173280-7 |D s |
| 689 | 0 | 1 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016397743&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016397743 | ||
Datensatz im Suchindex
| _version_ | 1804137493955608576 |
|---|---|
| adam_text | TASK SCHEDULING FOR PARALLEL SYSTEMS OLIVER SINNEN DEPARTMENT OF
ELECTRICAL AND COMPUTER ENGINEERING THE UNIVERSITY OF AUKLAND NEW
ZEALAND BICENTEN N IA L I * * I ! | 1 8 O 7 WILEY 2 OO 7 BICENTENNIAL
WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION CONTENTS
PREFACE XI ACKNOWLEDGMENTS XIII 1. INTRODUCTION 1 1.1 OVERVIEW 1 1.2
ORGANIZATION 5 2. PARALLEL SYSTEMS AND PROGRAMMING 7 2.1 PARALLEL
ARCHITECTURES 7 2.1.1 FLYNN S TAXONOMY 7 2.1.2 MEMORY ARCHITECTURES 9
2.1.3 PROGRAMMING PARADIGMS AND MODELS 11 2.2 COMMUNICATION NETWORKS 13
2.2.1 STATIC NETWORKS 13 2.2.2 DYNAMIC NETWORKS 18 2.3 PARALLELIZATION
22 2.4 SUBTASK DECOMPOSITION 24 2.4.1 CONCURRENCY AND GRANULARITY 24
2.4.2 DECOMPOSITION TECHNIQUES 25 2.4.3 COMPUTATION TYPE AND PROGRAM
FORMULATION 27 2.4.4 PARALLELIZATION TECHNIQUES 28 2.4.5 TARGET PARALLEL
SYSTEM 28 2.5 DEPENDENCE ANALYSIS 29 2.5.1 DATA DEPENDENCE 29 2.5.2 DATA
DEPENDENCE IN LOOPS 32 2.5.3 CONTROL DEPENDENCE 35 2.6 CONCLUDING
REMARKS 36 2.7 EXERCISES 37 3. GRAPH REPRESENTATIONS 40 3.1 BASIC GRAPH
CONCEPTS 40 VII VUEI CONTENTS 3.1.1 COMPUTER REPRESENTATION OF GRAPHS 43
3.1.2 ELEMENTARY GRAPH ALGORITHMS 46 3.2 GRAPH AS A PROGRAM MODEL 49
3.2.1 COMPUTATION AND COMMUNICATION COSTS 50 3.2.2 COMPARISON CRITERIA
50 3.3 DEPENDENCE GRAPH (DG) 51 3.3.1 ITERATION DEPENDENCE GRAPH 53
3.3.2 SUMMARY 55 3.4 FLOW GRAPH (FG) 56 3.4.1 DATA-DRIVEN EXECUTION
MODEL 60 3.4.2 SUMMARY 61 3.5 TASK GRAPH (DAG) 62 3.5.1 GRAPH
TRANSFORMATIONS AND CONVERSIONS 64 3.5.2 MOTIVATIONS AND LIMITATIONS 68
3.5.3 SUMMARY 69 3.6 CONCLUDING REMARKS 69 3.7 EXERCISES 70 4. TASK
SCHEDULING 74 4.1 FUNDAMENTALS 74 4.2 WITH COMMUNICATION COSTS 76 4.2.1
SCHEDULE EXAMPLE 81 4.2.2 SCHEDULING COMPLEXITY 82 4.3 WITHOUT
COMMUNICATION COSTS 86 4.3.1 SCHEDULE EXAMPLE 87 4.3.2 SCHEDULING
COMPLEXITY 88 4.4 TASK GRAPH PROPERTIES 92 4.4.1 CRITICALPATH 93 4.4.2
NODELEVELS 95 4.4.3 GRANULARITY 101 4.5 CONCLUDING REMARKS 105 4.6
EXERCISES 105 5. FUNDAMENTAL HEURISTICS 108 5.1 LIST SCHEDULING 108
5.1.1 START TIME MINIMIZATION 111 5.1.2 WITH DYNAMIC PRIORITIES 114
5.1.3 NODE PRIORITIES 115 5.2 SCHEDULING WITH GIVEN PROCESSOR ALLOCATION
118 5.2.1 PHASE TWO 119 CONTENTS IX 5.3 CLUSTERING 119 5.3.1 CLUSTERING
ALGORITHMS 121 5.3.2 LINEAR CLUSTERING 124 5.3.3 SINGLE EDGE CLUSTERING
128 5.3.4 LIST SCHEDULING AS CLUSTERING 135 5.3.5 OTHER ALGORITHMS 138
5.4 FROM CLUSTERING TO SCHEDULING 139 5.4.1 ASSIGNING CLUSTERS TO
PROCESSORS 139 5.4.2 SCHEDULING ON PROCESSORS 141 5.5 CONCLUDING REMARKS
141 5.6 EXERCISES 142 6. ADVANCED TASK SCHEDULING 145 6.1 INSERTION
TECHNIQUE 145 6.1.1 LIST SCHEDULING WITH NODE INSERTION 148 6.2 NODE
DUPLICATION 150 6.2.1 NODE DUPLICATION HEURISTICS 153 6.3 HETEROGENEOUS
PROCESSORS 154 6.3.1 SCHEDULING 157 6.4 COMPLEXITY RESULTS 158 6.4.1
A SS Y CLASSIFICATION 158 6.4.2 WITHOUT COMMUNICATION COSTS 165 6.4.3
WITH COMMUNICATION COSTS 165 6.4.4 WITH NODE DUPLICATION 168 6.4.5
HETEROGENEOUS PROCESSORS 170 6.5 GENETIC ALGORITHMS 170 6.5.1 BASICS 171
6.5.2 CHROMOSOMES 172 6.5.3 REPRODUCTION 177 6.5.4 SELECTION,
COMPLEXITY, AND FLEXIBILITY 180 6.6 CONCLUDING REMARKS 182 6.7 EXERCISES
183 7. COMMUNICATION CONTENTION IN SCHEDULING 187 7.1 CONTENTION
AWARENESS 188 7.1.1 END-POINT CONTENTION 189 7.1.2 NETWORK CONTENTION
190 7.1.3 INTEGRATING END-POINT AND NETWORK CONTENTION 192 7.2 NETWORK
MODEL 192 7.2.1 TOPOLOGY GRAPH 192 7.2.2 ROUTING 198 7.2.3 SCHEDULING
NETWORK MODEL 202 X CONTENTS 7.3 EDGE SCHEDULING 203 7.3.1 SCHEDULING
EDGE ON ROUTE 204 7.3.2 THE EDGE SCHEDULING 208 7.4 CONTENTION AWARE
SCHEDULING 209 7.4.1 BASICS 209 7.4.2 NP-COMPLETENESS 211 7.5 HEURISTICS
216 7.5.1 LIST SCHEDULING 216 7.5.2 PRIORI TY SCHEMES*TASK GRAPH
PROPERTIES 219 7.5.3 CLUSTERING 220 7.5.4 EXPERIMENTAL RESULTS 221 7.6
CONCLUDING REMARKS 223 7.7 EXERCISES 224 8. PROCESSOR INVOLVEMENT IN
COMMUNICATION 228 8.1 PROCESSOR INVOLVEMENT*TYPES AND CHARACTERISTICS
229 8.1.1 INVOLVEMENT TYPES 229 8.1.2 INVOLVEMENT CHARACTERISTICS 232
8.1.3 RELATION TO LOGP AND ITS VARIANTS 236 8.2 INVOLVEMENT SCHEDULING
238 8.2.1 SCHEDULING EDGES ON THE PROCESSORS 240 8.2.2 NODE AND EDGE
SCHEDULING 246 8.2.3 TASK GRAPH 247 8.2.4 NP-COMPLETENESS 248 8.3
ALGORITHMIC APPROACHES 250 8.3.1 DIRECT SCHEDULING 251 8.3.2 SCHEDULING
WITH GIVEN PROCESSOR ALLOCATION 254 8.4 HEURISTICS 257 8.4.1 LIST
SCHEDULING 257 8.4.2 TWO-PHASE HEURISTICS 261 8.4.3 EXPERIMENTAL RESULTS
263 8.5 CONCLUDING REMARKS 264 8.6 EXERCISES 265 BIBLIOGRAPHY 269
AUTHORINDEX 281 SUBJECT INDEX 285
|
| adam_txt |
TASK SCHEDULING FOR PARALLEL SYSTEMS OLIVER SINNEN DEPARTMENT OF
ELECTRICAL AND COMPUTER ENGINEERING THE UNIVERSITY OF AUKLAND NEW
ZEALAND BICENTEN N IA L I * * I ! | 1 8 O 7 WILEY 2 OO 7 BICENTENNIAL
WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION CONTENTS
PREFACE XI ACKNOWLEDGMENTS XIII 1. INTRODUCTION 1 1.1 OVERVIEW 1 1.2
ORGANIZATION 5 2. PARALLEL SYSTEMS AND PROGRAMMING 7 2.1 PARALLEL
ARCHITECTURES 7 2.1.1 FLYNN'S TAXONOMY 7 2.1.2 MEMORY ARCHITECTURES 9
2.1.3 PROGRAMMING PARADIGMS AND MODELS 11 2.2 COMMUNICATION NETWORKS 13
2.2.1 STATIC NETWORKS 13 2.2.2 DYNAMIC NETWORKS 18 2.3 PARALLELIZATION
22 2.4 SUBTASK DECOMPOSITION 24 2.4.1 CONCURRENCY AND GRANULARITY 24
2.4.2 DECOMPOSITION TECHNIQUES 25 2.4.3 COMPUTATION TYPE AND PROGRAM
FORMULATION 27 2.4.4 PARALLELIZATION TECHNIQUES 28 2.4.5 TARGET PARALLEL
SYSTEM 28 2.5 DEPENDENCE ANALYSIS 29 2.5.1 DATA DEPENDENCE 29 2.5.2 DATA
DEPENDENCE IN LOOPS 32 2.5.3 CONTROL DEPENDENCE 35 2.6 CONCLUDING
REMARKS 36 2.7 EXERCISES 37 3. GRAPH REPRESENTATIONS 40 3.1 BASIC GRAPH
CONCEPTS 40 VII VUEI CONTENTS 3.1.1 COMPUTER REPRESENTATION OF GRAPHS 43
3.1.2 ELEMENTARY GRAPH ALGORITHMS 46 3.2 GRAPH AS A PROGRAM MODEL 49
3.2.1 COMPUTATION AND COMMUNICATION COSTS 50 3.2.2 COMPARISON CRITERIA
50 3.3 DEPENDENCE GRAPH (DG) 51 3.3.1 ITERATION DEPENDENCE GRAPH 53
3.3.2 SUMMARY 55 3.4 FLOW GRAPH (FG) 56 3.4.1 DATA-DRIVEN EXECUTION
MODEL 60 3.4.2 SUMMARY 61 3.5 TASK GRAPH (DAG) 62 3.5.1 GRAPH
TRANSFORMATIONS AND CONVERSIONS 64 3.5.2 MOTIVATIONS AND LIMITATIONS 68
3.5.3 SUMMARY 69 3.6 CONCLUDING REMARKS 69 3.7 EXERCISES 70 4. TASK
SCHEDULING 74 4.1 FUNDAMENTALS 74 4.2 WITH COMMUNICATION COSTS 76 4.2.1
SCHEDULE EXAMPLE 81 4.2.2 SCHEDULING COMPLEXITY 82 4.3 WITHOUT
COMMUNICATION COSTS 86 4.3.1 SCHEDULE EXAMPLE 87 4.3.2 SCHEDULING
COMPLEXITY 88 4.4 TASK GRAPH PROPERTIES 92 4.4.1 CRITICALPATH 93 4.4.2
NODELEVELS 95 4.4.3 GRANULARITY 101 4.5 CONCLUDING REMARKS 105 4.6
EXERCISES 105 5. FUNDAMENTAL HEURISTICS 108 5.1 LIST SCHEDULING 108
5.1.1 START TIME MINIMIZATION 111 5.1.2 WITH DYNAMIC PRIORITIES 114
5.1.3 NODE PRIORITIES 115 5.2 SCHEDULING WITH GIVEN PROCESSOR ALLOCATION
118 5.2.1 PHASE TWO 119 CONTENTS IX 5.3 CLUSTERING 119 5.3.1 CLUSTERING
ALGORITHMS 121 5.3.2 LINEAR CLUSTERING 124 5.3.3 SINGLE EDGE CLUSTERING
128 5.3.4 LIST SCHEDULING AS CLUSTERING 135 5.3.5 OTHER ALGORITHMS 138
5.4 FROM CLUSTERING TO SCHEDULING 139 5.4.1 ASSIGNING CLUSTERS TO
PROCESSORS 139 5.4.2 SCHEDULING ON PROCESSORS 141 5.5 CONCLUDING REMARKS
141 5.6 EXERCISES 142 6. ADVANCED TASK SCHEDULING 145 6.1 INSERTION
TECHNIQUE 145 6.1.1 LIST SCHEDULING WITH NODE INSERTION 148 6.2 NODE
DUPLICATION 150 6.2.1 NODE DUPLICATION HEURISTICS 153 6.3 HETEROGENEOUS
PROCESSORS 154 6.3.1 SCHEDULING 157 6.4 COMPLEXITY RESULTS 158 6.4.1
A\SS\Y CLASSIFICATION 158 6.4.2 WITHOUT COMMUNICATION COSTS 165 6.4.3
WITH COMMUNICATION COSTS 165 6.4.4 WITH NODE DUPLICATION 168 6.4.5
HETEROGENEOUS PROCESSORS 170 6.5 GENETIC ALGORITHMS 170 6.5.1 BASICS 171
6.5.2 CHROMOSOMES 172 6.5.3 REPRODUCTION 177 6.5.4 SELECTION,
COMPLEXITY, AND FLEXIBILITY 180 6.6 CONCLUDING REMARKS 182 6.7 EXERCISES
183 7. COMMUNICATION CONTENTION IN SCHEDULING 187 7.1 CONTENTION
AWARENESS 188 7.1.1 END-POINT CONTENTION 189 7.1.2 NETWORK CONTENTION
190 7.1.3 INTEGRATING END-POINT AND NETWORK CONTENTION 192 7.2 NETWORK
MODEL 192 7.2.1 TOPOLOGY GRAPH 192 7.2.2 ROUTING 198 7.2.3 SCHEDULING
NETWORK MODEL 202 X CONTENTS 7.3 EDGE SCHEDULING 203 7.3.1 SCHEDULING
EDGE ON ROUTE 204 7.3.2 THE EDGE SCHEDULING 208 7.4 CONTENTION AWARE
SCHEDULING 209 7.4.1 BASICS 209 7.4.2 NP-COMPLETENESS 211 7.5 HEURISTICS
216 7.5.1 LIST SCHEDULING 216 7.5.2 PRIORI TY SCHEMES*TASK GRAPH
PROPERTIES 219 7.5.3 CLUSTERING 220 7.5.4 EXPERIMENTAL RESULTS 221 7.6
CONCLUDING REMARKS 223 7.7 EXERCISES 224 8. PROCESSOR INVOLVEMENT IN
COMMUNICATION 228 8.1 PROCESSOR INVOLVEMENT*TYPES AND CHARACTERISTICS
229 8.1.1 INVOLVEMENT TYPES 229 8.1.2 INVOLVEMENT CHARACTERISTICS 232
8.1.3 RELATION TO LOGP AND ITS VARIANTS 236 8.2 INVOLVEMENT SCHEDULING
238 8.2.1 SCHEDULING EDGES ON THE PROCESSORS 240 8.2.2 NODE AND EDGE
SCHEDULING 246 8.2.3 TASK GRAPH 247 8.2.4 NP-COMPLETENESS 248 8.3
ALGORITHMIC APPROACHES 250 8.3.1 DIRECT SCHEDULING 251 8.3.2 SCHEDULING
WITH GIVEN PROCESSOR ALLOCATION 254 8.4 HEURISTICS 257 8.4.1 LIST
SCHEDULING 257 8.4.2 TWO-PHASE HEURISTICS 261 8.4.3 EXPERIMENTAL RESULTS
263 8.5 CONCLUDING REMARKS 264 8.6 EXERCISES 265 BIBLIOGRAPHY 269
AUTHORINDEX 281 SUBJECT INDEX 285 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Sinnen, Oliver 1971- |
| author_GND | (DE-588)1014939569 |
| author_facet | Sinnen, Oliver 1971- |
| author_role | aut |
| author_sort | Sinnen, Oliver 1971- |
| author_variant | o s os |
| building | Verbundindex |
| bvnumber | BV023211688 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58 |
| callnumber-search | QA76.58 |
| callnumber-sort | QA 276.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 151 ST 230 ST 260 |
| ctrlnum | (OCoLC)72868271 (DE-599)BVBBV023211688 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01676nam a2200457 c 4500</leader><controlfield tag="001">BV023211688</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180703 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080313s2007 xxuad|| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2006052157</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471735760</subfield><subfield code="9">0-471-73576-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780471735762</subfield><subfield code="9">978-0-471-73576-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)72868271</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023211688</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</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="100" ind1="1" ind2=" "><subfield code="a">Sinnen, Oliver</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1014939569</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Task scheduling for parallel systems</subfield><subfield code="c">Oliver Sinnen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley-Interscience</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 296 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="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multitasking (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</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="689" ind1="0" ind2="0"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=016397743&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-016397743</subfield></datafield></record></collection> |
| id | DE-604.BV023211688 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:12:17Z |
| indexdate | 2024-07-09T21:13:11Z |
| institution | BVB |
| isbn | 0471735760 9780471735762 |
| language | English |
| lccn | 2006052157 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016397743 |
| oclc_num | 72868271 |
| open_access_boolean | |
| owner | DE-703 DE-11 |
| owner_facet | DE-703 DE-11 |
| physical | XIII, 296 S. Ill., graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Wiley-Interscience |
| record_format | marc |
| spelling | Sinnen, Oliver 1971- Verfasser (DE-588)1014939569 aut Task scheduling for parallel systems Oliver Sinnen Hoboken, NJ Wiley-Interscience 2007 XIII, 296 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Parallel processing (Electronic computers) Multitasking (Computer science) Computer scheduling Parallelrechner (DE-588)4173280-7 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Parallelrechner (DE-588)4173280-7 s Scheduling (DE-588)4179449-7 s DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016397743&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sinnen, Oliver 1971- Task scheduling for parallel systems Parallel processing (Electronic computers) Multitasking (Computer science) Computer scheduling Parallelrechner (DE-588)4173280-7 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4173280-7 (DE-588)4179449-7 |
| title | Task scheduling for parallel systems |
| title_auth | Task scheduling for parallel systems |
| title_exact_search | Task scheduling for parallel systems |
| title_exact_search_txtP | Task scheduling for parallel systems |
| title_full | Task scheduling for parallel systems Oliver Sinnen |
| title_fullStr | Task scheduling for parallel systems Oliver Sinnen |
| title_full_unstemmed | Task scheduling for parallel systems Oliver Sinnen |
| title_short | Task scheduling for parallel systems |
| title_sort | task scheduling for parallel systems |
| topic | Parallel processing (Electronic computers) Multitasking (Computer science) Computer scheduling Parallelrechner (DE-588)4173280-7 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Parallel processing (Electronic computers) Multitasking (Computer science) Computer scheduling Parallelrechner Scheduling |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016397743&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sinnenoliver taskschedulingforparallelsystems |