Task scheduling in parallel and distributed systems:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Englewood Cliffs, NJ
Prentice Hall
1994
|
| Schriftenreihe: | Prentice Hall series in innovative technology
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006928833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XIV, 290 S. graph. Darst. |
| ISBN: | 0130992356 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010405317 | ||
| 003 | DE-604 | ||
| 005 | 20060505 | ||
| 007 | t| | ||
| 008 | 951002s1994 xx d||| |||| 00||| engod | ||
| 020 | |a 0130992356 |9 0-13-099235-6 | ||
| 035 | |a (OCoLC)844305869 | ||
| 035 | |a (DE-599)BVBBV010405317 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-703 |a DE-83 |a DE-11 | ||
| 050 | 0 | |a QA76.58 | |
| 082 | 0 | |a 005.2 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a DAT 403f |2 stub | ||
| 084 | |a 68Q22 |2 msc | ||
| 100 | 1 | |a Rewini, Hesham el |e Verfasser |0 (DE-588)129767506 |4 aut | |
| 245 | 1 | 0 | |a Task scheduling in parallel and distributed systems |c Hesham El-Rewini ; Theodore G. Lewis ; Hesham H. Ali |
| 264 | 1 | |a Englewood Cliffs, NJ |b Prentice Hall |c 1994 | |
| 300 | |a XIV, 290 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Prentice Hall series in innovative technology | |
| 650 | 4 | |a Parallelverarbeitung - Multitasking | |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | 1 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Lewis, T. G. |d 1941- |e Verfasser |0 (DE-588)109078675 |4 aut | |
| 700 | 1 | |a Ali, Hesham H. |e Verfasser |4 aut | |
| 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=006928833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006928833 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 95 A 2642 |
|---|---|
| DE-BY-TUM_katkey | 662049 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | 040000148072 |
| _version_ | 1821930903330357248 |
| adam_text |
Preface xi
Foreword xiii
Introduction: A Road Map to Scheduling 1
1 Scheduling Parallel Tasks: A Classical Problem 4
1.1 The Scheduling Problem 5
1.2 Scheduling Taxonomy 6
1.3 An Alternate Scheduling Taxonomy 9
1.3.1 Single Application Versus Multiple Application System 9
1.3.2 Nonpreemptive Versus Preemptive 9
1.3.3 Nonadaptive Versus Adaptive 10
1.4 Task Scheduling Model 10
1.4.1 Target Machine 11
1.4.2 Parallel Program Tasks 11
1.4.3 Execution and Communication Cost 12
1.4.4 The Schedule 13
1.4.5 Performance Measures 14
2 Optimal Scheduling Algorithms 17
2.1 Program and Machine Models 18
2.2 Scheduling Tree Structured Task Graphs 18
2.3 Scheduling Interval Ordered Tasks 21
vii
viii Contents
2.4 Arbitrary Task Graphs On Two Processors 23
2.5 The NP Completeness of the Scheduling Problem 25
3 The Relationship Between Matching and Two Processor
Scheduling 29
3.1 Matching 29
3.2 Definitions 31
3.3 The Matching Scheduling Relationship 31
3.4 The Effect of Communication Delay 34
4 Considering Communication Delay 38
4.1 Communication Cost Models 39
4.2 Augmented Task Graphs 43
4.3 Scheduling Tree Structured Task Graphs with Communication 45
4.4 Scheduling Interval Ordered Tasks with Communication 48
4.4.1 The Algorithm 48
4.4.2 The Optimality of SCHION 50
5 List Scheduling Heuristics 56
5.1 List Scheduling 57
5.2 Communication Issues 59
5.2.1 Parallelism Versus Communication Delay 60
5.2.2 Level Alteration 62
5.3 List Heuristics With Communication 63
5.3.1 Program and Machine Models 63
5.3.2 Terminology 64
5.4 General List Scheduling Heuristic 64
5.5 Insertion Scheduling Heuristic (ISH) 67
5.6 Duplication Scheduling Heuristic (DSH) 71
5.7 Experiment Results 76
6 Advanced Scheduling Heuristics 82
6.1 Clustering Algorithms 83
6.2 General Description of Clustering Algorithms 84
6.3 Clustering Heuristic Algorithms 87
6.3.1 Kim and Brown's Algorithm 87
6.3.2 Sarkar's Algorithm 89
6.3.3 The Dominant Sequence Clustering Algorithm 91
6.3.4 Wu and Gajski's Clustering Algorithm 92
6.4 The Mapping Heuristic (MH) 95
6.5 Routing Tables 97
6.6 Simulation Experiments 101
7 Data Parallel Scheduling 106
7.1 Piece Wise Scheduling 107
7.2 Models and Assumptions 107
Contents jx
7.3 Replicates 109
7.3.1 Programming Replicates 112
7.4 Divide and Conquer Patterns 114
7.4.1 Programming Trees 118
7.5 Nearest Neighbor Meshes 121
7.5.1 Programming Meshes 125
7.6 Composite Task Graphs 126
8 Dynamic Task Scheduling 131
8.1 Nondeterministic Programs 132
8.1.1 Graphs with Cycles 132
8.1.2 Graphs with And/Or Relations 135
8.1.3 Graphs with Variable Size Nodes 136
8.1.4 Graphs with Variable Size Arcs 137
8.2 Approaches to Dynamic Scheduling 139
8.3 Unconstrained FIFO Scheduling 140
8.4 Balance Constrained Scheduling 141
8.5 Cost Constrained Scheduling 144
8.6 Hybrid Scheduling 145
9 Static Scheduling for Conditional Branching 150
9.1 Modeling Conditional Branching 151
9.2 Reducing the Degree of Nondeterminism 156
9.2.1 Similarity in Nondeterministic Task Graphs 156
9.2.2 Reduced Task Graphs 158
9.3 The Multiphase Approach 160
9.3.1 Phase 1: Generate 162
9.3.2 Phase 2: Construct 164
9.3.3 Phase 3: Schedule 164
9.3.4 Phase 4: Merge 165
10 Loop Scheduling on Shared Memory Computers 172
10.1 Scheduling Loop Iterations 173
10.2 Loop Spreading 176
10.2.1 Independent Substatements 176
10.2.2 Dependent Substatements 178
10.2.3 Performance Analysis 182
10.3 Safe Self Scheduling 183
10.3.1 Overview of SSS 184
10.4 The SSS Algorithm 186
10.4.1 Reducing the Total Number of Chores 186
10.4.2 Calculating iCSol 188
10.4.3 Assigning Iterations to Processors at Compile Time 191
10.4.4 The Scheduling Function 191
10.4.5 Calculating Chore Sizes For Subsequent Rounds 193
x Contents
10.5 Extending SSS to General Cases 194
10.6 Experiment Results and Discussions 196
11 Loop Scheduling on Distributed Memory Computers 200
11.1 Task Graph Representation in Loops 201
11.1.1 Loop Task Graph 202
11.2 Loop Unrolling 203
11.3 Replicated Task Graphs 205
11.4 Scheduling Loop Task Graphs 205
11.5 Loop Unrolling Optimization 209
11.5.1 The Problem Formulation 210
11.5.2 The Objective Function 211
11.6 Optimal Loop Unrolling 213
12 Task Partitioning and Grain Packing 218
12.1 What Is Grain Packing? 219
12.2 Grain Packing Through Scheduling 219
12.3 Heuristic for Grain Packing by Scheduling 221
12.4 Grain Packing by Graph Partitioning 222
13 Scheduling CASE Tools 229
13.1 Design and Analysis Tools 230
13.1.1 Parallax—The Tool 231
13.1.2 Analysis of Some Parallel Applications 237
13.2 Code Generation Tools 243
13.2.1 Hypertool 244
13.2.2 PYRROS 250
14 Task Allocation 254
14.1 Introduction 255
14.2 Optimal Algorithms 256
14.2.1 Optimal Task Assignment in Two Processor Systems 256
14.2.2 Optimal Task Assignment in Linear Array Networks 259
14.3 Task Allocation Heuristics 261
14.3.1 An m way Network Flow Algorithm 263
14.3.2 An Approximation Algorithm 267
14.4 The NP Completeness of the Task Allocation Problem 268
14.4.1 Split Graphs 268
14.4.2 The Split Graph Model 269
14.4.3 Minimizing the Total Cost 271
14.4.4 The NP Completeness Proof 272
14.5 Task Allocation and Clique Partitioning 276
Index 287 |
| any_adam_object | 1 |
| author | Rewini, Hesham el Lewis, T. G. 1941- Ali, Hesham H. |
| author_GND | (DE-588)129767506 (DE-588)109078675 |
| author_facet | Rewini, Hesham el Lewis, T. G. 1941- Ali, Hesham H. |
| author_role | aut aut aut |
| author_sort | Rewini, Hesham el |
| author_variant | h e r he her t g l tg tgl h h a hh hha |
| building | Verbundindex |
| bvnumber | BV010405317 |
| 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 200 |
| classification_tum | DAT 403f |
| ctrlnum | (OCoLC)844305869 (DE-599)BVBBV010405317 |
| dewey-full | 005.2 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.2 |
| dewey-search | 005.2 |
| dewey-sort | 15.2 |
| 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>00000nam a2200000 c 4500</leader><controlfield tag="001">BV010405317</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060505</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951002s1994 xx d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0130992356</subfield><subfield code="9">0-13-099235-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844305869</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010405317</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="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</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">005.2</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 403f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q22</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rewini, Hesham el</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)129767506</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Task scheduling in parallel and distributed systems</subfield><subfield code="c">Hesham El-Rewini ; Theodore G. Lewis ; Hesham H. Ali</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Englewood Cliffs, NJ</subfield><subfield code="b">Prentice Hall</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 290 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="490" ind1="0" ind2=" "><subfield code="a">Prentice Hall series in innovative technology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallelverarbeitung - Multitasking</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">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</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="700" ind1="1" ind2=" "><subfield code="a">Lewis, T. G.</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109078675</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ali, Hesham H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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=006928833&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-006928833</subfield></datafield></record></collection> |
| id | DE-604.BV010405317 |
| illustrated | Illustrated |
| indexdate | 2025-01-11T10:43:33Z |
| institution | BVB |
| isbn | 0130992356 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006928833 |
| oclc_num | 844305869 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-703 DE-83 DE-11 |
| owner_facet | DE-91 DE-BY-TUM DE-703 DE-83 DE-11 |
| physical | XIV, 290 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Prentice Hall |
| record_format | marc |
| series2 | Prentice Hall series in innovative technology |
| spellingShingle | Rewini, Hesham el Lewis, T. G. 1941- Ali, Hesham H. Task scheduling in parallel and distributed systems Parallelverarbeitung - Multitasking Scheduling (DE-588)4179449-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| subject_GND | (DE-588)4179449-7 (DE-588)4075860-6 |
| title | Task scheduling in parallel and distributed systems |
| title_auth | Task scheduling in parallel and distributed systems |
| title_exact_search | Task scheduling in parallel and distributed systems |
| title_full | Task scheduling in parallel and distributed systems Hesham El-Rewini ; Theodore G. Lewis ; Hesham H. Ali |
| title_fullStr | Task scheduling in parallel and distributed systems Hesham El-Rewini ; Theodore G. Lewis ; Hesham H. Ali |
| title_full_unstemmed | Task scheduling in parallel and distributed systems Hesham El-Rewini ; Theodore G. Lewis ; Hesham H. Ali |
| title_short | Task scheduling in parallel and distributed systems |
| title_sort | task scheduling in parallel and distributed systems |
| topic | Parallelverarbeitung - Multitasking Scheduling (DE-588)4179449-7 gnd Parallelverarbeitung (DE-588)4075860-6 gnd |
| topic_facet | Parallelverarbeitung - Multitasking Scheduling Parallelverarbeitung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006928833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT rewiniheshamel taskschedulinginparallelanddistributedsystems AT lewistg taskschedulinginparallelanddistributedsystems AT aliheshamh taskschedulinginparallelanddistributedsystems |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 95 A 2642 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |