Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Logótipo
Você está em: Start > Publications > View > A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction
Publication

A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction

Title
A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction
Type
Article in International Conference Proceedings Book
Year
2013
Authors
Rodrigues, V
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Akesson, B
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Melo De Sousa, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Conference proceedings International
Pages: 43-59
15th International Symposium on Practical Aspects of Declarative Languages, PADL 2013
Rome, 21 January 2013 through 22 January 2013
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge
Publicação em ISI Web of Science ISI Web of Science
Scientific classification
CORDIS: Physical sciences > Computer science
Other information
Authenticus ID: P-008-KB8
Abstract (EN): This paper presents a functional model for timing analysis by abstract interpretation, used for estimation of worst-case execution times (WCET) in multicore architectures using a denotational semantics. The objective aims at surpassing the intrinsic computational complexity of timing analysis of multiple processing units sharing common resources. For this purpose, we propose a novel application of latency-rate (LR) servers, phrased in terms of abstract interpretation, to achieve timing compositionality on requests to shared resources. The soundness of the approach is proven with respect to a calculational fixpoint semantics for multicores that is able to express all possible ways in which a shared resource can be accessed. Experimental results show that the loss in precision introduced by the LR server model is about 10% on average and is fairly compensated by the gain in analysis time, which is above 99%. The system is implemented in Haskell, taking advantages of the declarative features of the language for a simpler and more robust specification of the underlying concepts. © 2013 Springer-Verlag.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 17
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same scientific areas

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
APRIORI Algorithm for Label Ranking (2010)
Thesis
Cláudio Sá; Carlos Soares; Joaquim Costa
On the average size of pd automata: an analytic combinatorics approach (2010)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
On Covering Path Orthogonal Polygons (preliminary version) (2016)
Technical Report
Ana Paula Tomás; Catarina Lobo Ferreira
Introdução ao método dos elementos finitos (1998)
Technical Report
João Manuel Ribeiro Silva Tavares; Armando Jorge Monteiro Neves Padilha

See all (192)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Psicologia e de Ciências da Educação da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-10-01 at 14:33:52 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book