Fault-tolerant task scheduling in multiprocessor systems:
Abstract: "Minimizing the finish time of a set of independent tasks executed on a multiprocessor system, where no faults occur, is a well-known NP-complete problem. However, an approximated schedule can be found efficiently by means of the so called Largest Processing Time (LPT) rule. The above...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,16 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Minimizing the finish time of a set of independent tasks executed on a multiprocessor system, where no faults occur, is a well-known NP-complete problem. However, an approximated schedule can be found efficiently by means of the so called Largest Processing Time (LPT) rule. The above scheduling problem extended to faulty environments may seem daunting. However, this paper shows how to extend the LPT rule in a fault-tolerant Non-Uniform-Memory-Access (NUMA) multiprocessor employing a primary copy and a backup copy for each task in order to handle processor failures. The notion of expected schedule length is also introduced to evaluate the performance of the resulting schedule in case of processor failures Simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. |
| Beschreibung: | 20 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848350 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)27332714 | ||
| 035 | |a (DE-599)BVBBV010848350 | ||
| 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 Fault-tolerant task scheduling in multiprocessor systems |c A. A. Bertossi ; L. V. Mancini |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 20 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,16 | |
| 520 | 3 | |a Abstract: "Minimizing the finish time of a set of independent tasks executed on a multiprocessor system, where no faults occur, is a well-known NP-complete problem. However, an approximated schedule can be found efficiently by means of the so called Largest Processing Time (LPT) rule. The above scheduling problem extended to faulty environments may seem daunting. However, this paper shows how to extend the LPT rule in a fault-tolerant Non-Uniform-Memory-Access (NUMA) multiprocessor employing a primary copy and a backup copy for each task in order to handle processor failures. The notion of expected schedule length is also introduced to evaluate the performance of the resulting schedule in case of processor failures | |
| 520 | 3 | |a Simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. | |
| 650 | 4 | |a Fault-tolerant computing | |
| 650 | 4 | |a Multiprocessors | |
| 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,16 |w (DE-604)BV010841375 |9 1991,16 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250964 | ||
Datensatz im Suchindex
| _version_ | 1804125334342205440 |
|---|---|
| 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 | BV010848350 |
| ctrlnum | (OCoLC)27332714 (DE-599)BVBBV010848350 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01898nam a2200325 cb4500</leader><controlfield tag="001">BV010848350</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)27332714</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848350</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">Fault-tolerant task scheduling in multiprocessor 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 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,16</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Minimizing the finish time of a set of independent tasks executed on a multiprocessor system, where no faults occur, is a well-known NP-complete problem. However, an approximated schedule can be found efficiently by means of the so called Largest Processing Time (LPT) rule. The above scheduling problem extended to faulty environments may seem daunting. However, this paper shows how to extend the LPT rule in a fault-tolerant Non-Uniform-Memory-Access (NUMA) multiprocessor employing a primary copy and a backup copy for each task in order to handle processor failures. The notion of expected schedule length is also introduced to evaluate the performance of the resulting schedule in case of processor failures</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm.</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">Multiprocessors</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,16</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,16</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250964</subfield></datafield></record></collection> |
| id | DE-604.BV010848350 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250964 |
| oclc_num | 27332714 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 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 Fault-tolerant task scheduling in multiprocessor systems A. A. Bertossi ; L. V. Mancini Pisa 1991 20 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,16 Abstract: "Minimizing the finish time of a set of independent tasks executed on a multiprocessor system, where no faults occur, is a well-known NP-complete problem. However, an approximated schedule can be found efficiently by means of the so called Largest Processing Time (LPT) rule. The above scheduling problem extended to faulty environments may seem daunting. However, this paper shows how to extend the LPT rule in a fault-tolerant Non-Uniform-Memory-Access (NUMA) multiprocessor employing a primary copy and a backup copy for each task in order to handle processor failures. The notion of expected schedule length is also introduced to evaluate the performance of the resulting schedule in case of processor failures Simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. Fault-tolerant computing Multiprocessors Mancini, Luigi V. Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,16 (DE-604)BV010841375 1991,16 |
| spellingShingle | Bertossi, Alan A. Mancini, Luigi V. Fault-tolerant task scheduling in multiprocessor systems Fault-tolerant computing Multiprocessors |
| title | Fault-tolerant task scheduling in multiprocessor systems |
| title_auth | Fault-tolerant task scheduling in multiprocessor systems |
| title_exact_search | Fault-tolerant task scheduling in multiprocessor systems |
| title_full | Fault-tolerant task scheduling in multiprocessor systems A. A. Bertossi ; L. V. Mancini |
| title_fullStr | Fault-tolerant task scheduling in multiprocessor systems A. A. Bertossi ; L. V. Mancini |
| title_full_unstemmed | Fault-tolerant task scheduling in multiprocessor systems A. A. Bertossi ; L. V. Mancini |
| title_short | Fault-tolerant task scheduling in multiprocessor systems |
| title_sort | fault tolerant task scheduling in multiprocessor systems |
| topic | Fault-tolerant computing Multiprocessors |
| topic_facet | Fault-tolerant computing Multiprocessors |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT bertossialana faulttoleranttaskschedulinginmultiprocessorsystems AT manciniluigiv faulttoleranttaskschedulinginmultiprocessorsystems |