Validating timing constraints in multiprocessor and distributed real-time systems:
Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time o...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Urbana, Ill.
Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science
1993
|
Schlagworte: | |
Zusammenfassung: | Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This report presents several worst-case bounds and efficient algorithms for determining how late the completion times of independent jobs with arbitrary release times can be in a dynamic multiprocessor or distributed system. The special cases considered here are when the jobs are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable." |
Beschreibung: | 43 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV035647540 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 090727s1993 d||| |||| 00||| eng d | ||
035 | |a (OCoLC)31471029 | ||
035 | |a (DE-599)GBV168783290 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
082 | 0 | |a 510.78 | |
088 | |a UIUCDCS-R-93-1833 | ||
088 | |a UILU-ENG-93-1748 | ||
100 | 1 | |a Ha, Rhan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Validating timing constraints in multiprocessor and distributed real-time systems |c Rhan Ha and Jane W. S. Liu |
246 | 1 | 3 | |a UIUCDCS R 93-1833 |
264 | 1 | |a Urbana, Ill. |b Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1993 | |
300 | |a 43 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
520 | 3 | |a Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This report presents several worst-case bounds and efficient algorithms for determining how late the completion times of independent jobs with arbitrary release times can be in a dynamic multiprocessor or distributed system. The special cases considered here are when the jobs are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable." | |
650 | 4 | |a Real-time data processing | |
700 | 1 | |a Liu, Jane W. S. |e Verfasser |4 aut | |
999 | |a oai:aleph.bib-bvb.de:BVB01-017702203 |
Datensatz im Suchindex
_version_ | 1804139331564077056 |
---|---|
any_adam_object | |
author | Ha, Rhan Liu, Jane W. S. |
author_facet | Ha, Rhan Liu, Jane W. S. |
author_role | aut aut |
author_sort | Ha, Rhan |
author_variant | r h rh j w s l jws jwsl |
building | Verbundindex |
bvnumber | BV035647540 |
ctrlnum | (OCoLC)31471029 (DE-599)GBV168783290 |
dewey-full | 510.78 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510.78 |
dewey-search | 510.78 |
dewey-sort | 3510.78 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01675nam a2200325 c 4500</leader><controlfield tag="001">BV035647540</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090727s1993 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31471029</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV168783290</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</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="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-93-1833</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-93-1748</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ha, Rhan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Validating timing constraints in multiprocessor and distributed real-time systems</subfield><subfield code="c">Rhan Ha and Jane W. S. Liu</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 93-1833</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">43 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="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This report presents several worst-case bounds and efficient algorithms for determining how late the completion times of independent jobs with arbitrary release times can be in a dynamic multiprocessor or distributed system. The special cases considered here are when the jobs are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable."</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">Liu, Jane W. S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017702203</subfield></datafield></record></collection> |
id | DE-604.BV035647540 |
illustrated | Illustrated |
indexdate | 2024-07-09T21:42:23Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017702203 |
oclc_num | 31471029 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 43 S. graph. Darst. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |
record_format | marc |
spelling | Ha, Rhan Verfasser aut Validating timing constraints in multiprocessor and distributed real-time systems Rhan Ha and Jane W. S. Liu UIUCDCS R 93-1833 Urbana, Ill. Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science 1993 43 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This report presents several worst-case bounds and efficient algorithms for determining how late the completion times of independent jobs with arbitrary release times can be in a dynamic multiprocessor or distributed system. The special cases considered here are when the jobs are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable." Real-time data processing Liu, Jane W. S. Verfasser aut |
spellingShingle | Ha, Rhan Liu, Jane W. S. Validating timing constraints in multiprocessor and distributed real-time systems Real-time data processing |
title | Validating timing constraints in multiprocessor and distributed real-time systems |
title_alt | UIUCDCS R 93-1833 |
title_auth | Validating timing constraints in multiprocessor and distributed real-time systems |
title_exact_search | Validating timing constraints in multiprocessor and distributed real-time systems |
title_full | Validating timing constraints in multiprocessor and distributed real-time systems Rhan Ha and Jane W. S. Liu |
title_fullStr | Validating timing constraints in multiprocessor and distributed real-time systems Rhan Ha and Jane W. S. Liu |
title_full_unstemmed | Validating timing constraints in multiprocessor and distributed real-time systems Rhan Ha and Jane W. S. Liu |
title_short | Validating timing constraints in multiprocessor and distributed real-time systems |
title_sort | validating timing constraints in multiprocessor and distributed real time systems |
topic | Real-time data processing |
topic_facet | Real-time data processing |
work_keys_str_mv | AT harhan validatingtimingconstraintsinmultiprocessoranddistributedrealtimesystems AT liujanews validatingtimingconstraintsinmultiprocessoranddistributedrealtimesystems AT harhan uiucdcsr931833 AT liujanews uiucdcsr931833 |