Deadline assignment in a distributed soft real-time system:
Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an applicat...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1992
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1452 |
| Subjects: | |
| Summary: | Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment." |
| Physical Description: | 25 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009005867 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28470704 | ||
| 035 | |a (DE-599)BVBBV009005867 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Kao, Ben |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Deadline assignment in a distributed soft real-time system |c by Ben Kao and Hector Garcia-Molina |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 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 1452 | |
| 520 | 3 | |a Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment." | |
| 650 | 4 | |a Distributed parameter systems | |
| 650 | 4 | |a Real-time data processing | |
| 700 | 1 | |a Garcia-Molina, Hector |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1452 |w (DE-604)BV008928280 |9 1452 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005952946 | ||
Record in the Search Index
| _version_ | 1804123352767397888 |
|---|---|
| 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 | BV009005867 |
| ctrlnum | (OCoLC)28470704 (DE-599)BVBBV009005867 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01683nam a2200313 cb4500</leader><controlfield tag="001">BV009005867</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28470704</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009005867</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><subfield code="a">DE-91G</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">Deadline assignment in a distributed soft real-time system</subfield><subfield code="c">by Ben Kao and Hector Garcia-Molina</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</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">1452</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed parameter systems</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">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">1452</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1452</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005952946</subfield></datafield></record></collection> |
| id | DE-604.BV009005867 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005952946 |
| oclc_num | 28470704 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Kao, Ben Verfasser aut Deadline assignment in a distributed soft real-time system by Ben Kao and Hector Garcia-Molina Stanford, Calif. 1992 25 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1452 Abstract: "In a distributed environment, tasks often have processing demands on multiple different sites. A distributed task is usually divided up into several subtasks, each one to be executed at some site in order. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. However, the problem of how a global deadline is automatically translated to the deadline of each individual subtask has not been well studied. This paper examines (through simulations) four strategies for subtask deadline assignment in a distributed soft real-time environment." Distributed parameter systems Real-time data processing Garcia-Molina, Hector Verfasser aut Computer Science Department: Report STAN CS Stanford University 1452 (DE-604)BV008928280 1452 |
| spellingShingle | Kao, Ben Garcia-Molina, Hector Deadline assignment in a distributed soft real-time system Distributed parameter systems Real-time data processing |
| title | Deadline assignment in a distributed soft real-time system |
| title_auth | Deadline assignment in a distributed soft real-time system |
| title_exact_search | Deadline assignment in a distributed soft real-time system |
| title_full | Deadline assignment in a distributed soft real-time system by Ben Kao and Hector Garcia-Molina |
| title_fullStr | Deadline assignment in a distributed soft real-time system by Ben Kao and Hector Garcia-Molina |
| title_full_unstemmed | Deadline assignment in a distributed soft real-time system by Ben Kao and Hector Garcia-Molina |
| title_short | Deadline assignment in a distributed soft real-time system |
| title_sort | deadline assignment in a distributed soft real time system |
| topic | Distributed parameter systems Real-time data processing |
| topic_facet | Distributed parameter systems Real-time data processing |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT kaoben deadlineassignmentinadistributedsoftrealtimesystem AT garciamolinahector deadlineassignmentinadistributedsoftrealtimesystem |