dc.contributor.author | Ziccardi, Marco |
dc.contributor.author | Mezzetti, Enrico |
dc.contributor.author | Vardanega, Tullio |
dc.contributor.author | Abella Ferrer, Jaume |
dc.contributor.author | Cazorla, Francisco J. |
dc.contributor.other | Barcelona Supercomputing Center |
dc.date.accessioned | 2016-11-24T10:56:07Z |
dc.date.available | 2016-11-24T10:56:07Z |
dc.date.issued | 2016-01-18 |
dc.identifier.citation | Ziccardi, Marco [et al.]. EPC: Extended Path Coverage for Measurement-Based Probabilistic Timing Analysis. A: Real-Time Systems Symposium (1-4 Dec. 2015). "Real-Time Systems Symposium, 2015 IEEE". IEEE, 2016, p. 338-349. |
dc.identifier.isbn | 978-1-4673-9507-6 |
dc.identifier.uri | http://hdl.handle.net/2117/97171 |
dc.description.abstract | Measurement-based probabilistic timing analysis (MBPTA) computes trustworthy upper bounds to the execution time of software programs. MBPTA has the connotation, typical of measurement-based techniques, that the bounds computed with it only relate to what is observed in actual program traversals, which may not include the effective worst-case phenomena. To overcome this limitation, we propose Extended Path Coverage (EPC), a novel technique that allows extending the representativeness of the bounds computed by MBPTA. We make the observation data probabilistically path-independent by modifying the probability distribution of the observed timing behaviour so as to negatively compensate for any benefits that a basic block may draw from a path leading to it. This enables the derivation of trustworthy upper bounds to the probabilistic execution time of all paths in the program, even when the user-provided input vectors do not exercise the worst-case path. Our results confirm that using MBPTA with EPC produces fully trustworthy upper bounds with competitively small overestimation in comparison to state-of-the-art MBPTA techniques. |
dc.description.sponsorship | This work has received funding from the European Community’s Seventh Framework Programme [FP7/2007-2013] under grant agreement 611085 (PROXIMA). This work
and has also been partially supported by the Spanish Ministry of Science and Innovation under grant TIN2012-34557, the HiPEAC Network of Excellence and COST Action IC1202: Timing Analysis On Code-Level (TACLe). Jaume Abella has been partially supported by the Ministry of Economy and
Competitiveness under Ramon y Cajal postdoctoral fellowship number RYC-2013-14717. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | IEEE |
dc.subject | Àrees temàtiques de la UPC::Enginyeria electrònica |
dc.subject.lcsh | Timing circuits--Data processing |
dc.subject.lcsh | Software architecture |
dc.subject.lcsh | Probabilistic database systems |
dc.subject.other | Probabilistic logic |
dc.subject.other | Timing |
dc.subject.other | Upper bound |
dc.subject.other | Hardware |
dc.subject.other | Software |
dc.subject.other | Probability distribution |
dc.title | EPC: Extended Path Coverage for Measurement-Based Probabilistic Timing Analysis |
dc.type | Conference lecture |
dc.subject.lemac | Programari |
dc.identifier.doi | 10.1109/RTSS.2015.39 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://ieeexplore.ieee.org/document/7383590/ |
dc.rights.access | Open Access |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//RYC-2013-14717/ES/RYC-2013-14717/ |
local.citation.contributor | Real-Time Systems Symposium (1-4 Dec. 2015) |
local.citation.publicationName | Real-Time Systems Symposium, 2015 IEEE |
local.citation.startingPage | 338 |
local.citation.endingPage | 349 |