Show simple item record

dc.contributor.authorZiccardi, Marco
dc.contributor.authorMezzetti, Enrico
dc.contributor.authorVardanega, Tullio
dc.contributor.authorAbella Ferrer, Jaume
dc.contributor.authorCazorla, Francisco J.
dc.contributor.otherBarcelona Supercomputing Center
dc.date.accessioned2016-11-24T10:56:07Z
dc.date.available2016-11-24T10:56:07Z
dc.date.issued2016-01-18
dc.identifier.citationZiccardi, 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.isbn978-1-4673-9507-6
dc.identifier.urihttp://hdl.handle.net/2117/97171
dc.description.abstractMeasurement-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.sponsorshipThis 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.extent12 p.
dc.language.isoeng
dc.publisherIEEE
dc.subjectÀrees temàtiques de la UPC::Enginyeria electrònica
dc.subject.lcshTiming circuits--Data processing
dc.subject.lcshSoftware architecture
dc.subject.lcshProbabilistic database systems
dc.subject.otherProbabilistic logic
dc.subject.otherTiming
dc.subject.otherUpper bound
dc.subject.otherHardware
dc.subject.otherSoftware
dc.subject.otherProbability distribution
dc.titleEPC: Extended Path Coverage for Measurement-Based Probabilistic Timing Analysis
dc.typeConference lecture
dc.subject.lemacProgramari
dc.identifier.doi10.1109/RTSS.2015.39
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/7383590/
dc.rights.accessOpen Access
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/RYC-2013-14717
local.citation.contributorReal-Time Systems Symposium (1-4 Dec. 2015)
local.citation.publicationNameReal-Time Systems Symposium, 2015 IEEE
local.citation.startingPage338
local.citation.endingPage349


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder