Subtask deadline assignment for complex distributed soft real-time tasks:
Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1491 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated." |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041457 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)31371865 | ||
| 035 | |a (DE-599)BVBBV009041457 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kao, Ben |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Subtask deadline assignment for complex distributed soft real-time tasks |c Ben Kao ; Hector Garcia-Molina |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1491 | |
| 520 | 3 | |a Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated." | |
| 650 | 4 | |a Distributed parameter systems | |
| 700 | 1 | |a Garcia-Molina, Hector |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1491 |w (DE-604)BV008928280 |9 1491 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982781 | ||
Datensatz im Suchindex
| _version_ | 1804123396254990336 |
|---|---|
| any_adam_object | |
| author | Kao, Ben Garcia-Molina, Hector |
| author_facet | Kao, Ben Garcia-Molina, Hector |
| author_role | aut aut |
| author_sort | Kao, Ben |
| author_variant | b k bk h g m hgm |
| building | Verbundindex |
| bvnumber | BV009041457 |
| ctrlnum | (OCoLC)31371865 (DE-599)BVBBV009041457 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01825nam a2200301 cb4500</leader><controlfield tag="001">BV009041457</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31371865</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041457</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kao, Ben</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Subtask deadline assignment for complex distributed soft real-time tasks</subfield><subfield code="c">Ben Kao ; Hector Garcia-Molina</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1491</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed parameter systems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Garcia-Molina, Hector</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1491</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1491</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982781</subfield></datafield></record></collection> |
| id | DE-604.BV009041457 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982781 |
| oclc_num | 31371865 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 25 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Kao, Ben Verfasser aut Subtask deadline assignment for complex distributed soft real-time tasks Ben Kao ; Hector Garcia-Molina Stanford, Calif. 1993 25 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1491 Abstract: "Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated." Distributed parameter systems Garcia-Molina, Hector Verfasser aut Computer Science Department: Report STAN CS Stanford University 1491 (DE-604)BV008928280 1491 |
| spellingShingle | Kao, Ben Garcia-Molina, Hector Subtask deadline assignment for complex distributed soft real-time tasks Distributed parameter systems |
| title | Subtask deadline assignment for complex distributed soft real-time tasks |
| title_auth | Subtask deadline assignment for complex distributed soft real-time tasks |
| title_exact_search | Subtask deadline assignment for complex distributed soft real-time tasks |
| title_full | Subtask deadline assignment for complex distributed soft real-time tasks Ben Kao ; Hector Garcia-Molina |
| title_fullStr | Subtask deadline assignment for complex distributed soft real-time tasks Ben Kao ; Hector Garcia-Molina |
| title_full_unstemmed | Subtask deadline assignment for complex distributed soft real-time tasks Ben Kao ; Hector Garcia-Molina |
| title_short | Subtask deadline assignment for complex distributed soft real-time tasks |
| title_sort | subtask deadline assignment for complex distributed soft real time tasks |
| topic | Distributed parameter systems |
| topic_facet | Distributed parameter systems |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT kaoben subtaskdeadlineassignmentforcomplexdistributedsoftrealtimetasks AT garciamolinahector subtaskdeadlineassignmentforcomplexdistributedsoftrealtimetasks |