A source-level tool for predicting deterministic execution times of programs:
Abstract: "A timing tool has been implemented for a subset of C, as an initial experiment in validating a methodology for predicting the deterministic execution times of programs. The tool is based on formal timing schema that are defined for each source level construct (procedures, statements,...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Seattle, Wash.
1989
|
Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
89,9,12 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A timing tool has been implemented for a subset of C, as an initial experiment in validating a methodology for predicting the deterministic execution times of programs. The tool is based on formal timing schema that are defined for each source level construct (procedures, statements, expressions). The tool accepts a program and bounds for each loop, and produces predictions for best and worst case execution times. Within the constraints of the target architecture and compiler, measured execution times for a variety of simple constructs and programs agree with times predicted by our tool The implementation decomposes naturally into a system-independent part, which we believe is determined by the 'timing semantics' of the language, and a lower-level system-dependent portion. The experiments validate our general timing schema approach, but also point out a number of problems and necessary refinements, for example, in defining the appropriate granularity for atomic elements, in accounting for program flow more explicitly, and in dealing with the nondeterminisms of contemporary machines. |
Beschreibung: | 22 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009258305 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1989 |||| 00||| eng d | ||
035 | |a (OCoLC)23476164 | ||
035 | |a (DE-599)BVBBV009258305 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Park, ChangYun |e Verfasser |4 aut | |
245 | 1 | 0 | |a A source-level tool for predicting deterministic execution times of programs |c ChangYun Park and Alan C. Shaw |
264 | 1 | |a Seattle, Wash. |c 1989 | |
300 | |a 22 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 89,9,12 | |
520 | 3 | |a Abstract: "A timing tool has been implemented for a subset of C, as an initial experiment in validating a methodology for predicting the deterministic execution times of programs. The tool is based on formal timing schema that are defined for each source level construct (procedures, statements, expressions). The tool accepts a program and bounds for each loop, and produces predictions for best and worst case execution times. Within the constraints of the target architecture and compiler, measured execution times for a variety of simple constructs and programs agree with times predicted by our tool | |
520 | 3 | |a The implementation decomposes naturally into a system-independent part, which we believe is determined by the 'timing semantics' of the language, and a lower-level system-dependent portion. The experiments validate our general timing schema approach, but also point out a number of problems and necessary refinements, for example, in defining the appropriate granularity for atomic elements, in accounting for program flow more explicitly, and in dealing with the nondeterminisms of contemporary machines. | |
650 | 4 | |a C (Computer program language) | |
650 | 4 | |a Computer programs |x Validation | |
700 | 1 | |a Shaw, Alan C. |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 89,9,12 |w (DE-604)BV008930431 |9 89,9,12 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006160361 |
Datensatz im Suchindex
_version_ | 1804123705563938816 |
---|---|
any_adam_object | |
author | Park, ChangYun Shaw, Alan C. |
author_facet | Park, ChangYun Shaw, Alan C. |
author_role | aut aut |
author_sort | Park, ChangYun |
author_variant | c p cp a c s ac acs |
building | Verbundindex |
bvnumber | BV009258305 |
ctrlnum | (OCoLC)23476164 (DE-599)BVBBV009258305 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02240nam a2200325 cb4500</leader><controlfield tag="001">BV009258305</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23476164</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009258305</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">Park, ChangYun</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A source-level tool for predicting deterministic execution times of programs</subfield><subfield code="c">ChangYun Park and Alan C. Shaw</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">89,9,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A timing tool has been implemented for a subset of C, as an initial experiment in validating a methodology for predicting the deterministic execution times of programs. The tool is based on formal timing schema that are defined for each source level construct (procedures, statements, expressions). The tool accepts a program and bounds for each loop, and produces predictions for best and worst case execution times. Within the constraints of the target architecture and compiler, measured execution times for a variety of simple constructs and programs agree with times predicted by our tool</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The implementation decomposes naturally into a system-independent part, which we believe is determined by the 'timing semantics' of the language, and a lower-level system-dependent portion. The experiments validate our general timing schema approach, but also point out a number of problems and necessary refinements, for example, in defining the appropriate granularity for atomic elements, in accounting for program flow more explicitly, and in dealing with the nondeterminisms of contemporary machines.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">C (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield><subfield code="x">Validation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shaw, Alan C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">89,9,12</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">89,9,12</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160361</subfield></datafield></record></collection> |
id | DE-604.BV009258305 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:34:01Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160361 |
oclc_num | 23476164 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 22 S. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
record_format | marc |
series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
spelling | Park, ChangYun Verfasser aut A source-level tool for predicting deterministic execution times of programs ChangYun Park and Alan C. Shaw Seattle, Wash. 1989 22 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 89,9,12 Abstract: "A timing tool has been implemented for a subset of C, as an initial experiment in validating a methodology for predicting the deterministic execution times of programs. The tool is based on formal timing schema that are defined for each source level construct (procedures, statements, expressions). The tool accepts a program and bounds for each loop, and produces predictions for best and worst case execution times. Within the constraints of the target architecture and compiler, measured execution times for a variety of simple constructs and programs agree with times predicted by our tool The implementation decomposes naturally into a system-independent part, which we believe is determined by the 'timing semantics' of the language, and a lower-level system-dependent portion. The experiments validate our general timing schema approach, but also point out a number of problems and necessary refinements, for example, in defining the appropriate granularity for atomic elements, in accounting for program flow more explicitly, and in dealing with the nondeterminisms of contemporary machines. C (Computer program language) Computer programs Validation Shaw, Alan C. Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 89,9,12 (DE-604)BV008930431 89,9,12 |
spellingShingle | Park, ChangYun Shaw, Alan C. A source-level tool for predicting deterministic execution times of programs C (Computer program language) Computer programs Validation |
title | A source-level tool for predicting deterministic execution times of programs |
title_auth | A source-level tool for predicting deterministic execution times of programs |
title_exact_search | A source-level tool for predicting deterministic execution times of programs |
title_full | A source-level tool for predicting deterministic execution times of programs ChangYun Park and Alan C. Shaw |
title_fullStr | A source-level tool for predicting deterministic execution times of programs ChangYun Park and Alan C. Shaw |
title_full_unstemmed | A source-level tool for predicting deterministic execution times of programs ChangYun Park and Alan C. Shaw |
title_short | A source-level tool for predicting deterministic execution times of programs |
title_sort | a source level tool for predicting deterministic execution times of programs |
topic | C (Computer program language) Computer programs Validation |
topic_facet | C (Computer program language) Computer programs Validation |
volume_link | (DE-604)BV008930431 |
work_keys_str_mv | AT parkchangyun asourceleveltoolforpredictingdeterministicexecutiontimesofprograms AT shawalanc asourceleveltoolforpredictingdeterministicexecutiontimesofprograms |