Scheduling algorithms for fault-tolerance in hard-real-time systems:
Abstract: "Many time-critical applications require high performance even if the system can suffer failures. This paper considers a distributed system with periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptive scheduling a...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,15 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Many time-critical applications require high performance even if the system can suffer failures. This paper considers a distributed system with periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptive scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. A new class of scheduling algorithms is proposed which is based on a uniform rate strategy. This strategy yields optimal schedules in the absence of failures, and sub-optimal schedules when failures do occur. The performance of the solutions proposed is evaluated in terms of the number of processors and the number of preemptions needed Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms. |
| Beschreibung: | 20, [6] S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848333 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)27332729 | ||
| 035 | |a (DE-599)BVBBV010848333 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bertossi, Alan A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scheduling algorithms for fault-tolerance in hard-real-time systems |c A. A. Bertossi ; L. V. Mancini |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 20, [6] S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,15 | |
| 520 | 3 | |a Abstract: "Many time-critical applications require high performance even if the system can suffer failures. This paper considers a distributed system with periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptive scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. A new class of scheduling algorithms is proposed which is based on a uniform rate strategy. This strategy yields optimal schedules in the absence of failures, and sub-optimal schedules when failures do occur. The performance of the solutions proposed is evaluated in terms of the number of processors and the number of preemptions needed | |
| 520 | 3 | |a Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms. | |
| 650 | 4 | |a Fault-tolerant computing | |
| 650 | 4 | |a Real-time data processing | |
| 700 | 1 | |a Mancini, Luigi V. |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,15 |w (DE-604)BV010841375 |9 1991,15 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250949 | ||
Datensatz im Suchindex
| _version_ | 1804125334324379648 |
|---|---|
| any_adam_object | |
| author | Bertossi, Alan A. Mancini, Luigi V. |
| author_facet | Bertossi, Alan A. Mancini, Luigi V. |
| author_role | aut aut |
| author_sort | Bertossi, Alan A. |
| author_variant | a a b aa aab l v m lv lvm |
| building | Verbundindex |
| bvnumber | BV010848333 |
| ctrlnum | (OCoLC)27332729 (DE-599)BVBBV010848333 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01982nam a2200325 cb4500</leader><controlfield tag="001">BV010848333</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27332729</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848333</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bertossi, Alan A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling algorithms for fault-tolerance in hard-real-time systems</subfield><subfield code="c">A. A. Bertossi ; L. V. Mancini</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20, [6] 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="1" ind2=" "><subfield code="a">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,15</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Many time-critical applications require high performance even if the system can suffer failures. This paper considers a distributed system with periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptive scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. A new class of scheduling algorithms is proposed which is based on a uniform rate strategy. This strategy yields optimal schedules in the absence of failures, and sub-optimal schedules when failures do occur. The performance of the solutions proposed is evaluated in terms of the number of processors and the number of preemptions needed</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mancini, Luigi V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,15</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,15</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250949</subfield></datafield></record></collection> |
| id | DE-604.BV010848333 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250949 |
| oclc_num | 27332729 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20, [6] S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Bertossi, Alan A. Verfasser aut Scheduling algorithms for fault-tolerance in hard-real-time systems A. A. Bertossi ; L. V. Mancini Pisa 1991 20, [6] S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,15 Abstract: "Many time-critical applications require high performance even if the system can suffer failures. This paper considers a distributed system with periodic tasks which can checkpoint their state on some reliable medium in order to handle failures. The problem of preemptive scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. A new class of scheduling algorithms is proposed which is based on a uniform rate strategy. This strategy yields optimal schedules in the absence of failures, and sub-optimal schedules when failures do occur. The performance of the solutions proposed is evaluated in terms of the number of processors and the number of preemptions needed Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms. Fault-tolerant computing Real-time data processing Mancini, Luigi V. Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,15 (DE-604)BV010841375 1991,15 |
| spellingShingle | Bertossi, Alan A. Mancini, Luigi V. Scheduling algorithms for fault-tolerance in hard-real-time systems Fault-tolerant computing Real-time data processing |
| title | Scheduling algorithms for fault-tolerance in hard-real-time systems |
| title_auth | Scheduling algorithms for fault-tolerance in hard-real-time systems |
| title_exact_search | Scheduling algorithms for fault-tolerance in hard-real-time systems |
| title_full | Scheduling algorithms for fault-tolerance in hard-real-time systems A. A. Bertossi ; L. V. Mancini |
| title_fullStr | Scheduling algorithms for fault-tolerance in hard-real-time systems A. A. Bertossi ; L. V. Mancini |
| title_full_unstemmed | Scheduling algorithms for fault-tolerance in hard-real-time systems A. A. Bertossi ; L. V. Mancini |
| title_short | Scheduling algorithms for fault-tolerance in hard-real-time systems |
| title_sort | scheduling algorithms for fault tolerance in hard real time systems |
| topic | Fault-tolerant computing Real-time data processing |
| topic_facet | Fault-tolerant computing Real-time data processing |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT bertossialana schedulingalgorithmsforfaulttoleranceinhardrealtimesystems AT manciniluigiv schedulingalgorithmsforfaulttoleranceinhardrealtimesystems |