Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms
Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static sc...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1998
|
| Schriftenreihe: | The Springer International Series in Engineering and Computer Science, Real-Time Systems
460 |
| Schlagworte: | |
| Online-Zugang: | BTU01 URL des Erstveröffentlichers |
| Zusammenfassung: | Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. For example, a list of issues to consider includes: preemptive versus non-preemptive tasks, uni-processors versus multi-processors, using EDF at dispatch time versus EDF-based planning, precedence constraints among tasks, resource constraints, periodic versus aperiodic versus sporadic tasks, scheduling during overload, fault tolerance requirements, and providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field |
| Beschreibung: | 1 Online-Ressource (XVI, 273 p) |
| ISBN: | 9781461555353 |
| DOI: | 10.1007/978-1-4615-5535-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045185220 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180912s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461555353 |9 978-1-4615-5535-3 | ||
| 024 | 7 | |a 10.1007/978-1-4615-5535-3 |2 doi | |
| 035 | |a (ZDB-2-ENG)978-1-4615-5535-3 | ||
| 035 | |a (OCoLC)1184390659 | ||
| 035 | |a (DE-599)BVBBV045185220 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 004.6 |2 23 | |
| 100 | 1 | |a Stankovic, John A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Deadline Scheduling for Real-Time Systems |b EDF and Related Algorithms |c by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo |
| 264 | 1 | |a Boston, MA |b Springer US |c 1998 | |
| 300 | |a 1 Online-Ressource (XVI, 273 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a The Springer International Series in Engineering and Computer Science, Real-Time Systems |v 460 | |
| 520 | |a Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. | ||
| 520 | |a Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. | ||
| 520 | |a For example, a list of issues to consider includes: preemptive versus non-preemptive tasks, uni-processors versus multi-processors, using EDF at dispatch time versus EDF-based planning, precedence constraints among tasks, resource constraints, periodic versus aperiodic versus sporadic tasks, scheduling during overload, fault tolerance requirements, and providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field | ||
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Special Purpose and Application-Based Systems | |
| 650 | 4 | |a Processor Architectures | |
| 650 | 4 | |a Computer Communication Networks | |
| 650 | 4 | |a Computer Science, general | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Microprocessors | |
| 650 | 4 | |a Computer communication systems | |
| 650 | 4 | |a Special purpose computers | |
| 650 | 0 | 7 | |a Echtzeitverarbeitung |0 (DE-588)4151002-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Echtzeitprogrammierung |0 (DE-588)4048695-3 |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 Echtzeitverarbeitung |0 (DE-588)4151002-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Echtzeitprogrammierung |0 (DE-588)4048695-3 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Spuri, Marco |4 aut | |
| 700 | 1 | |a Ramamritham, Krithi |4 aut | |
| 700 | 1 | |a Buttazzo, Giorgio C. |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461375302 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-5535-3 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-ENG | ||
| 940 | 1 | |q ZDB-2-ENG_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030574398 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1007/978-1-4615-5535-3 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178874850869248 |
|---|---|
| any_adam_object | |
| author | Stankovic, John A. Spuri, Marco Ramamritham, Krithi Buttazzo, Giorgio C. |
| author_facet | Stankovic, John A. Spuri, Marco Ramamritham, Krithi Buttazzo, Giorgio C. |
| author_role | aut aut aut aut |
| author_sort | Stankovic, John A. |
| author_variant | j a s ja jas m s ms k r kr g c b gc gcb |
| building | Verbundindex |
| bvnumber | BV045185220 |
| collection | ZDB-2-ENG |
| ctrlnum | (ZDB-2-ENG)978-1-4615-5535-3 (OCoLC)1184390659 (DE-599)BVBBV045185220 |
| dewey-full | 004.6 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6 |
| dewey-search | 004.6 |
| dewey-sort | 14.6 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-1-4615-5535-3 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05290nmm a2200661zcb4500</leader><controlfield tag="001">BV045185220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461555353</subfield><subfield code="9">978-1-4615-5535-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-5535-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-1-4615-5535-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184390659</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045185220</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="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stankovic, John A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Deadline Scheduling for Real-Time Systems</subfield><subfield code="b">EDF and Related Algorithms</subfield><subfield code="c">by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 273 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">The Springer International Series in Engineering and Computer Science, Real-Time Systems</subfield><subfield code="v">460</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. </subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. </subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">For example, a list of issues to consider includes: preemptive versus non-preemptive tasks, uni-processors versus multi-processors, using EDF at dispatch time versus EDF-based planning, precedence constraints among tasks, resource constraints, periodic versus aperiodic versus sporadic tasks, scheduling during overload, fault tolerance requirements, and providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Special Purpose and Application-Based Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Processor Architectures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Microprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer communication systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Special purpose computers</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitverarbeitung</subfield><subfield code="0">(DE-588)4151002-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeitprogrammierung</subfield><subfield code="0">(DE-588)4048695-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="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">Echtzeitverarbeitung</subfield><subfield code="0">(DE-588)4151002-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Echtzeitprogrammierung</subfield><subfield code="0">(DE-588)4048695-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Spuri, Marco</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ramamritham, Krithi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Buttazzo, Giorgio C.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461375302</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-5535-3</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030574398</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4615-5535-3</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045185220 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:10:55Z |
| institution | BVB |
| isbn | 9781461555353 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030574398 |
| oclc_num | 1184390659 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XVI, 273 p) |
| psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer US |
| record_format | marc |
| series2 | The Springer International Series in Engineering and Computer Science, Real-Time Systems |
| spelling | Stankovic, John A. Verfasser aut Deadline Scheduling for Real-Time Systems EDF and Related Algorithms by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo Boston, MA Springer US 1998 1 Online-Ressource (XVI, 273 p) txt rdacontent c rdamedia cr rdacarrier The Springer International Series in Engineering and Computer Science, Real-Time Systems 460 Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling, rate monotonic scheduling and fixed schedules created by off-line scheduling techniques such as dynamic programming, heuristic search, and simulated annealing. However, for many real-time systems, static scheduling algorithms are quite restrictive and inflexible. For example, highly automated agile manufacturing, command, control and communications, and distributed real-time multimedia applications all operate over long lifetimes and in highly non-deterministic environments. Dynamic real-time scheduling algorithms are more appropriate for these systems and are used in such systems. Many of these algorithms are based on earliest deadline first (EDF) policies. There exists a wealth of literature on EDF-based scheduling with many extensions to deal with sophisticated issues such as precedence constraints, resource requirements, system overload, multi-processors, and distributed systems. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms aims at collecting a significant body of knowledge on EDF scheduling for real-time systems, but it does not try to be all-inclusive (the literature is too extensive). The book primarily presents the algorithms and associated analysis, but guidelines, rules, and implementation considerations are also discussed, especially for the more complicated situations where mathematical analysis is difficult. In general, it is very difficult to codify and taxonomize scheduling knowledge because there are many performance metrics, task characteristics, and system configurations. Also, adding to the complexity is the fact that a variety of algorithms have been designed for different combinations of these considerations. In spite of the recent advances there are still gaps in the solution space and there is a need to integrate the available solutions. For example, a list of issues to consider includes: preemptive versus non-preemptive tasks, uni-processors versus multi-processors, using EDF at dispatch time versus EDF-based planning, precedence constraints among tasks, resource constraints, periodic versus aperiodic versus sporadic tasks, scheduling during overload, fault tolerance requirements, and providing guarantees and levels of guarantees (meeting quality of service requirements). Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms should be of interest to researchers, real-time system designers, and instructors and students, either as a focussed course on deadline-based scheduling for real-time systems, or, more likely, as part of a more general course on real-time computing. The book serves as an invaluable reference in this fast-moving field Computer Science Special Purpose and Application-Based Systems Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Special purpose computers Echtzeitverarbeitung (DE-588)4151002-1 gnd rswk-swf Echtzeitprogrammierung (DE-588)4048695-3 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf Scheduling (DE-588)4179449-7 s Echtzeitverarbeitung (DE-588)4151002-1 s 1\p DE-604 Echtzeitprogrammierung (DE-588)4048695-3 s 2\p DE-604 Spuri, Marco aut Ramamritham, Krithi aut Buttazzo, Giorgio C. aut Erscheint auch als Druck-Ausgabe 9781461375302 https://doi.org/10.1007/978-1-4615-5535-3 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Stankovic, John A. Spuri, Marco Ramamritham, Krithi Buttazzo, Giorgio C. Deadline Scheduling for Real-Time Systems EDF and Related Algorithms Computer Science Special Purpose and Application-Based Systems Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Special purpose computers Echtzeitverarbeitung (DE-588)4151002-1 gnd Echtzeitprogrammierung (DE-588)4048695-3 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4151002-1 (DE-588)4048695-3 (DE-588)4179449-7 |
| title | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms |
| title_auth | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms |
| title_exact_search | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms |
| title_full | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo |
| title_fullStr | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo |
| title_full_unstemmed | Deadline Scheduling for Real-Time Systems EDF and Related Algorithms by John A. Stankovic, Marco Spuri, Krithi Ramamritham, Giorgio C. Buttazzo |
| title_short | Deadline Scheduling for Real-Time Systems |
| title_sort | deadline scheduling for real time systems edf and related algorithms |
| title_sub | EDF and Related Algorithms |
| topic | Computer Science Special Purpose and Application-Based Systems Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Special purpose computers Echtzeitverarbeitung (DE-588)4151002-1 gnd Echtzeitprogrammierung (DE-588)4048695-3 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Computer Science Special Purpose and Application-Based Systems Processor Architectures Computer Communication Networks Computer Science, general Computer science Microprocessors Computer communication systems Special purpose computers Echtzeitverarbeitung Echtzeitprogrammierung Scheduling |
| url | https://doi.org/10.1007/978-1-4615-5535-3 |
| work_keys_str_mv | AT stankovicjohna deadlineschedulingforrealtimesystemsedfandrelatedalgorithms AT spurimarco deadlineschedulingforrealtimesystemsedfandrelatedalgorithms AT ramamrithamkrithi deadlineschedulingforrealtimesystemsedfandrelatedalgorithms AT buttazzogiorgioc deadlineschedulingforrealtimesystemsedfandrelatedalgorithms |