# Changeset 3139 for Deliverables

Ignore:
Timestamp:
Apr 12, 2013, 7:11:03 PM (7 years ago)
Message:

English tweaks

File:
1 edited

### Legend:

Unmodified
 r3137 \paragraph{D6.4} Before receiving the Project extension, we had identified for month 37 (Jan. 2013) the workshop track of the HiPEAC Conference series on High Performance and Embedded Architectures and Compilers as a suitable destination, comprising as it does a wide range of sessions bringing together industrial and academic research. The half-day workshop was held on 2013-01-23 in Berlin: \\ \texttt{http://http://www.hipeac.net/conference/berlin/workshop/CerCo} HiPEAC 2013 was held in Berlin, with the \cerco{} event a half-day workshop on 2013-01-23: \\ \texttt{http://www.hipeac.net/conference/berlin/workshop/CerCo} Prof. Kevin Hammond (St. Andrews University, UK) gave an invited talk on his work on methods for WCET analysis, in particular of Hume programs at the source-level, and their application in the autonomous vehicle guidance and aerospace domains. \paragraph{D6.5} We identified for month 39 (Mar. 2013) a workshop at ETAPS, the pre-eminent European federated conference on programming languages, systems and tools. The full-day workshop was held on 2013-03-23 in Rome: \\ \texttt{http://www.etaps.org/2013/workshops13}\\ as a Technical Day on Innovative Techniques on Timing Analysis''\\ ETAPS 2013 was held in Rome, with the full-day \cerco{} event a Technical Day on Innovative Techniques on Timing Analysis'' on 2013-03-23: \\ \texttt{http://cerco.cs.unibo.it/innovative\_techniques\_on\_timing\_analysis\_technical\_day} \paragraph{Scientific Outcomes} The HiPEAC workshop was one of 24 such meetings in a highly parallel programme organised over the 3 days of the main conference, while the ETAPS workshop was one of 20 workshops organised over 4 days, the two weekends which book-ended the main conference, and was thus the better attended, and scientifically more successful, meeting. The HiPEAC workshop was one of 24 such meetings in a programme organised in parallel with the 3 days of the main conference, while the ETAPS event was one of 20 workshops organised over the 4 days either side of the main conference, and was thus the better attended, and scientifically more successful, meeting. Nonetheless, a fruitful discussion emerged at HiPEAC concerning source-level cost reasoning.  Kevin Hammond's group use amortized analysis techniques to connect local costs about embedded programs in the Hume language to global costs, technology which it may be possible to transfer to the \cerco{} setting.  A key difference in our approaches is that their Hume implementation uses the high predictability of their virtual machine implementation to obtain local cost information, whereas \cerco{} produces such information for a complex native-code compiler. A common theme emerged from the shared sessions with QAPL, and in particular the invited talk there from prof. Alessandra di Pierro on \emph{probabilistic} timing analysis: the parametrisation of a given timing analysis with respect to different cost \emph{algebras}. In the case of probabilistic analyses, costs are taken with respect to given probability distributions, with \emph{expected} costs being computed. prof. Vartanegra's talk emphasised a radical approach to such analyses, by making assumptions about the processor/cache architecture to yield an essentially deterministic analysis. In the deterministic case studied in \cerco{}, we have taken a given, fixed, cost algebra of natural numbers (obtained from Siemens data-sheet clock timings) under addition, but already Tranquili's work on \emph{dependent labelling} suggests a move to computing costs in algebras of \emph{functions} (in the case of his analysis of loop unrolling, of cost expressions parametrised with respect to valuations of the loop index variables). The implications of such a move are yet to be explored. In the deterministic case studied in \cerco{}, we have taken a given, fixed, cost algebra of natural numbers (obtained from Siemens data-sheet clock timings) under addition, but already Tranquili's work on \emph{dependent labelling} suggests a move to computing costs in algebras of \emph{functions} (in the case of his analysis of loop unrolling, of cost expressions parametrised with respect to valuations of the loop index variables). The wider implications of such a move are yet to be explored.