Predicting program execution times by analyzing static and dynamic program paths:
Abstract: "This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Usin...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Seattle, Wash.
1991
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
91,12,1 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Using powerful user-provided information, dynamic path analysis refines looser predictions by eliminating infeasible paths and decomposing the possible execution behaviors in a pathwise manner. Overall prediction cost is scalable with respect to desired precision, controlling the amount of information provided. We introduce a formal path model for dynamic path analysis, where user execution information is represented by a set of program paths With a well-defined practical high-level interface language, user information can be used in an easy and efficient way. We also introduce a method to verify given user information with known program verification techniques. Initial experiments with a timing tool show that safe and tight predictions are possible for a wide range of programs. The tool can also provide predictions for interesting subsets of program executions. |
| Beschreibung: | 38 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015545 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)29234953 | ||
| 035 | |a (DE-599)BVBBV009015545 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Park, Chan Y. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Predicting program execution times by analyzing static and dynamic program paths |c Chang Yun Park |
| 264 | 1 | |a Seattle, Wash. |c 1991 | |
| 300 | |a 38 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 91,12,1 | |
| 520 | 3 | |a Abstract: "This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Using powerful user-provided information, dynamic path analysis refines looser predictions by eliminating infeasible paths and decomposing the possible execution behaviors in a pathwise manner. Overall prediction cost is scalable with respect to desired precision, controlling the amount of information provided. We introduce a formal path model for dynamic path analysis, where user execution information is represented by a set of program paths | |
| 520 | 3 | |a With a well-defined practical high-level interface language, user information can be used in an easy and efficient way. We also introduce a method to verify given user information with known program verification techniques. Initial experiments with a timing tool show that safe and tight predictions are possible for a wide range of programs. The tool can also provide predictions for interesting subsets of program executions. | |
| 650 | 4 | |a Real-time data processing | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 91,12,1 |w (DE-604)BV008930431 |9 91,12,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961120 | ||
Datensatz im Suchindex
| _version_ | 1804123364827070464 |
|---|---|
| any_adam_object | |
| author | Park, Chan Y. |
| author_facet | Park, Chan Y. |
| author_role | aut |
| author_sort | Park, Chan Y. |
| author_variant | c y p cy cyp |
| building | Verbundindex |
| bvnumber | BV009015545 |
| ctrlnum | (OCoLC)29234953 (DE-599)BVBBV009015545 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02182nam a2200301 cb4500</leader><controlfield tag="001">BV009015545</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29234953</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015545</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, Chan Y.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Predicting program execution times by analyzing static and dynamic program paths</subfield><subfield code="c">Chang Yun Park</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">38 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">91,12,1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Using powerful user-provided information, dynamic path analysis refines looser predictions by eliminating infeasible paths and decomposing the possible execution behaviors in a pathwise manner. Overall prediction cost is scalable with respect to desired precision, controlling the amount of information provided. We introduce a formal path model for dynamic path analysis, where user execution information is represented by a set of program paths</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">With a well-defined practical high-level interface language, user information can be used in an easy and efficient way. We also introduce a method to verify given user information with known program verification techniques. Initial experiments with a timing tool show that safe and tight predictions are possible for a wide range of programs. The tool can also provide predictions for interesting subsets of program executions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</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">91,12,1</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">91,12,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961120</subfield></datafield></record></collection> |
| id | DE-604.BV009015545 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961120 |
| oclc_num | 29234953 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 38 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Park, Chan Y. Verfasser aut Predicting program execution times by analyzing static and dynamic program paths Chang Yun Park Seattle, Wash. 1991 38 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,12,1 Abstract: "This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Using powerful user-provided information, dynamic path analysis refines looser predictions by eliminating infeasible paths and decomposing the possible execution behaviors in a pathwise manner. Overall prediction cost is scalable with respect to desired precision, controlling the amount of information provided. We introduce a formal path model for dynamic path analysis, where user execution information is represented by a set of program paths With a well-defined practical high-level interface language, user information can be used in an easy and efficient way. We also introduce a method to verify given user information with known program verification techniques. Initial experiments with a timing tool show that safe and tight predictions are possible for a wide range of programs. The tool can also provide predictions for interesting subsets of program executions. Real-time data processing Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 91,12,1 (DE-604)BV008930431 91,12,1 |
| spellingShingle | Park, Chan Y. Predicting program execution times by analyzing static and dynamic program paths Real-time data processing |
| title | Predicting program execution times by analyzing static and dynamic program paths |
| title_auth | Predicting program execution times by analyzing static and dynamic program paths |
| title_exact_search | Predicting program execution times by analyzing static and dynamic program paths |
| title_full | Predicting program execution times by analyzing static and dynamic program paths Chang Yun Park |
| title_fullStr | Predicting program execution times by analyzing static and dynamic program paths Chang Yun Park |
| title_full_unstemmed | Predicting program execution times by analyzing static and dynamic program paths Chang Yun Park |
| title_short | Predicting program execution times by analyzing static and dynamic program paths |
| title_sort | predicting program execution times by analyzing static and dynamic program paths |
| topic | Real-time data processing |
| topic_facet | Real-time data processing |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT parkchany predictingprogramexecutiontimesbyanalyzingstaticanddynamicprogrampaths |