Introduction to scheduling:
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boca Raton, FLa. [u.a.]
CRC Press, Taylor & Francis Group
2010
|
| Schriftenreihe: | Chapman & Hall / CRC computational science series
|
| Schlagworte: | |
| Online-Zugang: | http://scans.hebis.de/HEBCGI/show.pl?21832368_toc.pdf Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XX, 313 S. graph. Darst. |
| ISBN: | 9781420072730 1420072730 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV039585676 | ||
| 003 | DE-604 | ||
| 005 | 20111011 | ||
| 007 | t | ||
| 008 | 110916s2010 d||| |||| 00||| eng d | ||
| 010 | |a 2009032786 | ||
| 020 | |a 9781420072730 |9 978-1-4200-7273-0 | ||
| 020 | |a 1420072730 |9 1-4200-7273-0 | ||
| 035 | |a (OCoLC)608791713 | ||
| 035 | |a (DE-599)GBV608160156 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 245 | 1 | 0 | |a Introduction to scheduling |c ed. by Yves Robert ... |
| 264 | 1 | |a Boca Raton, FLa. [u.a.] |b CRC Press, Taylor & Francis Group |c 2010 | |
| 300 | |a XX, 313 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Chapman & Hall / CRC computational science series | |
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Grid Computing |0 (DE-588)4743648-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 Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | 1 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
| 689 | 0 | 2 | |a Grid Computing |0 (DE-588)4743648-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Robert, Yves |d 1939- |0 (DE-588)132096617 |4 edt | |
| 856 | 4 | 2 | |m V:DE-605 |q application/pdf |u http://scans.hebis.de/HEBCGI/show.pl?21832368_toc.pdf |
| 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=024436875&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024436875 | ||
Datensatz im Suchindex
| _version_ | 1804148418833022976 |
|---|---|
| adam_text | Titel: Introduction to scheduling
Autor: Robert, Yves
Jahr: 2010
Contents
Preface................................... xi
Acknowledgments............................ xvii
List of Contributors........................... xix
1 On the Complexity of Scheduling 1
Peter Brucker and Sigrid Knust
1.1 Introduction............................ 1
1.2 Scheduling Models........................ 2
1.3 Processor (Machine) Scheduling................. 6
1.4 Easy and Hard Problems .................... 11
1.5 Complexity Classification of Scheduling Problems....... 18
References................................ 20
2 Approximation Algorithms for Scheduling Problems 23
Jean-Claude Konig and Rodolphe Giroudeau
2.1 Introduction............................ 23
2.1.1 Approximation Algorithms............... 24
2.1.2 Definitions . ....................... 25
2.1.3 Absolute Approximation Algorithms (Case pinf = psup) 26
2.2 A Fully Polynomial-Time Approximation Scheme....... 28
2.3 Introduction of Precedence Constraints............. 31
2.3.1 Unbounded Number of Processors........... 31
2.3.2 Bounded Number of Processors............. 31
2.4 Introduction of Communication Delays............. 32
2.4.1 Introduction....................... 32
2.4.2 Unbounded Number of Processors........... 33
2.4.3 Limited Number of Processors............. 37
2.4.4 Introduction of Duplication............... 42
2.4.5 Large Communication Delays.............. 44
2.5 Conclusion ............................ 47
References................................ 48
3 Online Scheduling 51
Susanne Albers
3.1 Introduction............................ 51
3.2 Classical Scheduling Problems.................. 52
3.2.1 Makespan Minimization................. 52
3.2.2 Flow Time Objectives...................57
3.2.3 Load Balancing...................... 60
3.3 Energy-Efficient Scheduling................... 62
3.3.1 Power-Down Mechanisms................ 63
3.3.2 Dynamic Speed Scaling................. 67
3.4 Conclusion ............................ 73
References................................ 73
Job Scheduling 79
Uwe Schwiegelshohn
4.1 Introduction............................ 79
4.2 Single Machine Problems .................... 82
4.3 Makespan Problems on Parallel Machines........... 86
4.4 Completion Time Problems on Parallel Machines....... 91
4.5 Conclusion............................ 99
References................................ 100
Cyclic Scheduling 103
Claire Hanen
5.1 Introduction............................ 103
5.2 Cyclic Scheduling and Uniform Constraints.......... 104
5.2.1 Common Features of Cyclic Scheduling Problems . . . 104
5.2.2 Uniform Task Systems.................. 106
5.2.3 Questions......................... 108
5.3 Periodic Schedules of Uniform Task Systems.......... 109
5.3.1 Properties of Periodic Schedules ............ 109
5.3.2 Critical Circuit of a Strongly Connected Graph .... 112
5.3.3 Computation of an Optimal Periodic Schedule .... 113
5.4 Earliest Schedule of Uniform Task Systems.......... 116
5.5 Periodic Schedules of Uniform Task Systems with Resource
Constraints............................ 117
5.5.1 Which Periodicity?.................... 117
5.5.2 Complexity and MIP Models.............. 118
5.5.3 Patterns and Iteration Vectors............. 119
5.5.4 Decomposed Software Pipelining: A Generic Approach 121
5.6 Dynamic Schedules........................ 124
5.7 Conclusion ............................ 125
References................................ 126
Cyclic Scheduling for the Synthesis of Embedded Systems 129
Olivier Marchetti and Alix Munier-Kordon
6.1 Introduction............................ 129
6.2 Problem Formulation and Basic Notations........... 131
6.2.1 Synchronous Dataflow Graphs ............. 131
6.2.2 Timed Weighted Event Graphs............. 132
6.2.3 Problem Formulation .................. 133
vu
6.3 Precedence Relations Induced by a Timed Marked WEG ... 134
6.3.1 Characterization of Precedence Relations....... 134
6.3.2 Timed Event Graphs................... 135
6.3.3 Equivalent Places..................... 135
6.4 Unitary WEGs.......................... 137
6.4.1 Definitions ........................ 138
6.4.2 Normalization of a Unitary WEG............ 139
6.4.3 Expansion of a Unitary Timed Marked WEG..... 141
6.4.4 Relationship between Expansion and Normalization . 145
6.5 Periodic Schedule of a Normalized Timed Marked WEG . . . 147
6.5.1 Periodic Schedules.................... 148
6.5.2 Properties of Periodic Schedules ............ 148
6.5.3 Existence of Periodic Schedules............. 150
6.5.4 Optimal Periodic Schedule................ 152
6.6 Conclusion ............................ 154
References................................ 154
Steady-State Scheduling 159
Olivier Beaumont and Loris Marchal
7.1 Introduction............................ 159
7.2 Problem Formulation....................... 161
7.2.1 Platform Model...................... 161
7.2.2 Applications ....................... 162
7.3 Compact Description of a Schedule............... 163
7.3.1 Definition of the Allocations............... 164
7.3.2 Definition of Valid Patterns............... 166
7.4 From Allocations and Valid Patterns to Schedules ...... 167
7.4.1 Conditions and Weak Periodic Schedules........ 167
7.4.2 Weak Periodic Schedules and Cyclic Scheduling .... 169
7.5 Problem Solving in the General Case.............. 172
7.5.1 Existence of a Compact Solution............ 173
7.5.2 Resolution with the Ellipsoid Method......... 175
7.5.3 Separation in the Dual Linear Program........ 176
7.6 Toward Compact Linear Programs............... 178
7.6.1 Introduction ....................... 178
7.6.2 Efficient Computation of Valid Patterns under the Bidi-
rectional One-Port Model................ 179
7.6.3 Efficient Computation of Allocations.......... 182
7.7 Conclusion ............................ 184
References................................ 185
Divisible Load Scheduling 187
Matthieu Gallet, Yves Robert, and Frederic Vivien
8.1 Introduction............................ 187
8.1.1 Motivating Example................... 188
8.1.2 Classical Approach.................... 188
8.2 Divisible Load Approach..................... 191
8.2.1 Bus-Shaped Network................... 192
8.2.2 Star-Shaped Network .................. 195
8.3 Extensions of the Divisible Load Model ............ 201
8.3.1 Introducing Latencies.................. 201
8.3.2 Multi-Round Strategies................. 204
8.3.3 Return Messages..................... 214
8.4 Conclusion ............................ 216
References................................ 217
Multi-Objective Scheduling 219
Pierre-Francois Dutot, Krzysztof Rzadca, Erik Saule, and Denis Trystram
9.1 Motivation............................ 220
9.1.1 Once Upon a Time.................... 220
9.1.2 Diversity of Objectives.................. 221
9.1.3 Motivating Problems................... 222
9.1.4 Summary of Results on Single Objective Problems . . 223
9.1.5 Beyond the Scope of This Chapter........... 223
9.1.6 Chapter Organization.................. 224
9.2 What Is Multi-Objective Optimization?............ 225
9.3 Overview of the Various Existing Approaches......... 228
9.3.1 Algorithms Building One Trade-off Solution ...... 228
9.3.2 Complexity Issues.................... 230
9.4 Zenith Approximation on MaxAndSum ........... 233
9.5 Pareto Set Approximation on EfficientReliable ..... 235
9.5.1 Motivation........................ 235
9.5.2 Definition of Pareto Set Approximation........ 236
9.5.3 The Thresholding Approach............... 237
9.6 Fairness as Multi-Objective Optimization........... 241
96.1 The Meaning of Fairness................. 241
9.6.2 Axiomatic Theory of Fairness.............. 242
9.6.3 Application to TwoAgentMinSum.......... 243
9.6.4 Problems with Different Objective Functions..... 245
9.6.5 Aggregative Fairness................... 246
9.7 Conclusion ............................ 247
References................................. 248
10 Comparisons of Stochastic Task-Resource Systems 253
Bruno Gaujal and Jean-Marc Vincent
10.1 Motivation ............................ 253
10.2 Task-Resource Models...................... 255
10.2.1 Static Systems...................... 255
10.2.2 Dynamic Systems .................... 256
10.3 Stochastic Orders......................... 257
10.3.1 Orders for Real Random Variables........... 258
10.3.2 Orders for Multidimensional Random Variables .... 263
10.3.3 Association........................ 264
10.4 Applications to Static Problems................. 265
10.4.1 The 1|| £Cj Problem, Revisited............ 266
10.4.2 PERT Graphs ...................... 267
10.5 Applications to Dynamic Systems ............... 268
10.5.1 Single Queues....................... 269
10.5.2 Networks of Queues................... 272
10.5.3 Stochastic Comparisons and Simulation Issues .... 275
References................................ 279
11 The Influence of Platform Models on Scheduling Techniques 281
Lionel Eyraud-Dubois and Arnaud Legrand
11.1 Introduction............................ 281
11.2 Platform Modeling........................ 282
11.2.1 Modeling the Topology ................. 282
11.2.2 Modeling Point-to-Point Communication Time .... 284
11.2.3 Heterogeneity....................... 288
11.2.4 Modeling Concurrent Communications......... 289
11.2.5 Interaction between Communication and Computation 291
11.3 Scheduling Divisible Load.................... 292
11.3.1 Single Round....................... 293
11.3.2 Multi-Round....................... 296
11.4 Iterative Algorithms on a Virtual Ring............. 298
11.4.1 Problem Statement.................... 299
11.4.2 Complete Homogeneous Platform............ 299
11.4.3 Complete Heterogeneous Platform........... 300
11.4.4 Arbitrary Heterogeneous Platform........... 301
11.5 Data Redistribution....................... 302
11.5.1 The Matching Approach................. 304
11.5.2 The Elastic Flows Approach............... 306
11.6 Conclusion ............................ 307
References................................ 307
Index 311
|
| any_adam_object | 1 |
| author2 | Robert, Yves 1939- |
| author2_role | edt |
| author2_variant | y r yr |
| author_GND | (DE-588)132096617 |
| author_facet | Robert, Yves 1939- |
| building | Verbundindex |
| bvnumber | BV039585676 |
| classification_rvk | ST 151 |
| ctrlnum | (OCoLC)608791713 (DE-599)GBV608160156 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01711nam a2200421zc 4500</leader><controlfield tag="001">BV039585676</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111011 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110916s2010 d||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009032786</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781420072730</subfield><subfield code="9">978-1-4200-7273-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1420072730</subfield><subfield code="9">1-4200-7273-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)608791713</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV608160156</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</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="245" ind1="1" ind2="0"><subfield code="a">Introduction to scheduling</subfield><subfield code="c">ed. by Yves Robert ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, FLa. [u.a.]</subfield><subfield code="b">CRC Press, Taylor & Francis Group</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 313 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">Chapman & Hall / CRC computational science series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Grid Computing</subfield><subfield code="0">(DE-588)4743648-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">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">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</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">Grid Computing</subfield><subfield code="0">(DE-588)4743648-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">Robert, Yves</subfield><subfield code="d">1939-</subfield><subfield code="0">(DE-588)132096617</subfield><subfield code="4">edt</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">V:DE-605</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://scans.hebis.de/HEBCGI/show.pl?21832368_toc.pdf</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=024436875&sequence=000002&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-024436875</subfield></datafield></record></collection> |
| id | DE-604.BV039585676 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:06:49Z |
| institution | BVB |
| isbn | 9781420072730 1420072730 |
| language | English |
| lccn | 2009032786 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024436875 |
| oclc_num | 608791713 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XX, 313 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | CRC Press, Taylor & Francis Group |
| record_format | marc |
| series2 | Chapman & Hall / CRC computational science series |
| spelling | Introduction to scheduling ed. by Yves Robert ... Boca Raton, FLa. [u.a.] CRC Press, Taylor & Francis Group 2010 XX, 313 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Chapman & Hall / CRC computational science series Includes bibliographical references and index Grid Computing (DE-588)4743648-7 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Scheduling (DE-588)4179449-7 s Mehrprozessorsystem (DE-588)4038397-0 s Grid Computing (DE-588)4743648-7 s DE-604 Robert, Yves 1939- (DE-588)132096617 edt V:DE-605 application/pdf http://scans.hebis.de/HEBCGI/show.pl?21832368_toc.pdf HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024436875&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Introduction to scheduling Grid Computing (DE-588)4743648-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4743648-7 (DE-588)4038397-0 (DE-588)4179449-7 |
| title | Introduction to scheduling |
| title_auth | Introduction to scheduling |
| title_exact_search | Introduction to scheduling |
| title_full | Introduction to scheduling ed. by Yves Robert ... |
| title_fullStr | Introduction to scheduling ed. by Yves Robert ... |
| title_full_unstemmed | Introduction to scheduling ed. by Yves Robert ... |
| title_short | Introduction to scheduling |
| title_sort | introduction to scheduling |
| topic | Grid Computing (DE-588)4743648-7 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Grid Computing Mehrprozessorsystem Scheduling |
| url | http://scans.hebis.de/HEBCGI/show.pl?21832368_toc.pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024436875&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT robertyves introductiontoscheduling |