Achieving timing composability with measurement-based probabilistic timing analysis

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/24705

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor.author	Kosmidis, Leonidas
dc.contributor.author	Quiñones, Eduardo
dc.contributor.author	Abella Ferrer, Jaume
dc.contributor.author	Vardanega, Tulio
dc.contributor.author	Cazorla Almeida, Francisco Javier
dc.date	2013
dc.identifier.citation	Kosmidis, L. [et al.]. Achieving timing composability with measurement-based probabilistic timing analysis. A: IEEE Computer Society symposium on object/component/service-oriented realtime distributed computing. "The IEEE International Symposium on Object/component/service-oriented Real-time distributed computing: Paderborn, Germany, June 19 - 21, 2013". Paderborn: 2013, p. 1-8.
dc.identifier.citation	10.1109/ISORC.2013.6913193
dc.identifier.uri	http://hdl.handle.net/2117/24705
dc.language.iso	eng
dc.relation	http://people.ac.upc.edu/equinone/docs/2013/isorc_2013.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat
dc.subject	Àrees temàtiques de la UPC::Informàtica::Programació
dc.subject	Real-time data processing
dc.subject	Probabilities
dc.subject	Probabilistic timing analysis
dc.subject	Temps real (Informàtica)
dc.subject	Probabilitats
dc.title	Achieving timing composability with measurement-based probabilistic timing analysis
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	Probabilistic Timing Analysis (PTA) allows complex hardware acceleration features, which defeat classic timing analysis, to be used in hard real-time systems. PTA can do that because it drastically reduces intrinsic dependence on execution history. This distinctive feature is a great facilitator to time composability, which is a must for industry needing incremental development and qualification. In this paper we show how time composability is achieved in PTA-conformant systems and how the pessimism of worst-case execution time bounds obtained from PTA is contained within a 5% to 25% range for representative application scenarios
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author