2016
Authors
Pinho, LM;
Publication
Ada User Journal
Abstract
2016
Authors
Faucou, S; Pinho, LM;
Publication
ACM International Conference Proceeding Series
Abstract
2016
Authors
Pinho, LM;
Publication
Ada User Journal
Abstract
2016
Authors
Lindgren, P; Lindner, M; Pereira, D; Pinho, LM;
Publication
IEEE International Conference on Emerging Technologies and Factory Automation, ETFA
Abstract
Concurrent programming is dominated by thread based solutions with lock based critical sections. Careful attention has to be paid to avoid race and deadlock conditions. Real-Time for The Masses (RTFM) takes an alternative language approach, introducing tasks and named critical sections (via resources) natively in the RTFM-core language. RTFM-core programs can be compiled to native C-code, and efficiently executed onto single-core platforms under the Stack Resource Policy (SRP) by the RTFM-kernel. In this paper we formally define the well-formedness criteria for SRP based resource management, and develop a certified (formally proven) implementation of the corresponding compilation from nested critical sections of the input RTFM-core program to a resulting flat sequence of primitive operations and scheduling primitives. Moreover we formalise the properties for resource ceilings under SRP and develop a certified algorithm for their computation. The feasibility of the described approach is shown through the adoption of the Why3 platform, which allows the necessary verification conditions to be automatically generated and discharged through a variety of automatic external SMT-solvers and interactive theorem provers. Moreover, Why3 supports the extraction of certified Ocaml code for proven implementations in WhyML. As a proof of concept the certified extracted development is demonstrated on an example system. © 2016 IEEE.
2016
Authors
Bertogna, M; Pinho, LM; Quiñones, E;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
2016
Authors
Nélis, V; Yomsi, PM; Pinho, LM;
Publication
OpenAccess Series in Informatics
Abstract
It is a known fact that processes running concurrently on different cores in a multicore environment interfere with each other on the processor shared resources. The contention on these shared resources considerably slows down the execution on every core since sometimes the cores must stall while their requests to access the resources are being served. But by how much the execution may be slowed down due to this interference? In this paper we answer this question with numbers coming from experimentation. That is, we quantify the magnitude of the impact of the interference on the execution time by running programs taken from the TACLeBench benchmark suite, a popular benchmark suite in the real-time research community, on the first generation of Kalray manycore processor family, the MPPA-256 (the development board) that goes by the codename "Andey". © Vincent Nélis, Patrick Meumeu Yomsi and Luís Miguel Pinho.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.