Mauro Marinoni

Mauro Marinoni

Auto-generated profile, based on publicly available information

Mauro Marinoni

Scuola Superiore Sant'Anna, Pisa, Italy

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2016 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
Davide CalvaresiDavide Calvaresi
Davide Calvaresi
DCDaniel Cesarini
Daniel Cesarini
PSPaolo Sernani
Paolo Sernani
MMMauro Marinoni
Mauro Marinoni
Aldo Franco DragoniAldo Franco Dragoni
Aldo Franco Dragoni
ASArnon Sturm
Arnon Sturm

13 January 2016 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
PDF file
MBMario Bambagini
Mario Bambagini
MMMauro Marinoni
Mauro Marinoni
HAHakan Aydin
Hakan Aydin
GBGiorgio Buttazzo
Giorgio Buttazzo
This article presents a survey of energy-aware scheduling algorithms proposed for real-time systems. The analysis presents the main results starting from the middle 1990s until today, showing how the proposed solutions evolved to address the evolution of the platform's features and needs. The survey first presents a taxonomy to classify the existing approaches for uniprocessor systems, distinguishing them according to the technology exploited for reducing energy consumption, that is, Dynamic Voltage and Frequency Scaling (DVFS), Dynamic Power Management (DPM), or both. Then, the survey discusses the approaches proposed in the literature to deal with the additional problems related to the evolution of computing platforms toward multicore architectures.

23 August 2017
Verified
Conference Paper
Open access
Davide CalvaresiDavide Calvaresi
Davide Calvaresi
MMMauro Marinoni
Mauro Marinoni
ASArnon Sturm
Arnon Sturm
Michael SchumacherMichael Schumacher
Michael Schumacher
GBGiorgio Buttazzo
Giorgio Buttazzo
Techniques originating from the Internet of Things (IoT) and Cyber-Physical Systems (CPS) areas have extensively been applied to develop intelligent and pervasive systems such as assistive monitoring, feedback in telerehabilitation, energy management, and negotiation. Those application domains particularly include three major characteristics: intelligence, autonomy and real-time behavior. Multi-Agent Systems (MAS) are one of the major technological paradigms that are used to implement such systems. However, they mainly address the first two characteristics, but miss to comply with strict timing constraints. The timing compliance is crucial for safety-critical applications operating in domains such as healthcare and automotive. The main reasons for this lack of real-time satisfiability in MAS originate from current theories, standards, and technological implementations. In particular, internal agent schedulers, communication middlewares, and negotiation protocols have been identified as co-factors inhibiting the real-time compliance. This paper provides an analysis of such MAS components and pave the road for achieving the MAS compliance with strict timing constraints, thus fostering reliability and predictability.

1 July 2011
Verified
Conference Paper
Closed access
MBMarko Bertogna
Marko Bertogna
OXOrges Xhani
Orges Xhani
MMMauro Marinoni
Mauro Marinoni
FEFrancesco Esposito
Francesco Esposito
GBGiorgio Buttazzo
Giorgio Buttazzo
A central issue for verifying the schedulability of hard real-time systems is the correct evaluation of task execution times. These values are significantly influenced by the preemption overhead, which mainly includes the cache related delays and the context switch times introduced by each preemption. Since such an overhead significantly depends on the particular point in the code where preemption takes place, this paper proposes a method for placing suitable preemption points in each task in order to maximize the chances of finding a schedulable solution. In a previous work, we presented a method for the optimal selection of preemption points under the restrictive assumption of a fixed preemption cost, identical for each preemption point. In this paper, we remove such an assumption, exploring a more realistic and complex scenario where the preemption cost varies throughout the task code. Instead of modeling the problem with an integer programming formulation, with exponential worst-case complexity, we derive an optimal algorithm that has a linear time and space complexity. This somewhat surprising result allows selecting the best preemption points even in complex scenarios with a large number of potential preemption locations. Experimental results are also presented to show the effectiveness of the proposed approach in increasing the system schedulability.

1 November 2016
Verified
Conference Paper
Closed access
ABAlessandro Biondi
Alessandro Biondi
ABAlessio Balsini
Alessio Balsini
MPMarco Pagani
Marco Pagani
EREnrico Rossi
Enrico Rossi
MMMauro Marinoni
Mauro Marinoni
GBGiorgio Buttazzo
Giorgio Buttazzo
Computing platforms are evolving towards heterogeneous architectures including processors of different types and field programmable gate arrays (FPGAs), used as hardware accelerators for speeding up specific functions. The increasing capacity and performance of modern FPGAs, with their partial reconfiguration capabilities, have made them attractive in several application domains, including space applications.This paper proposes a framework for supporting the development of safety-critical real-time systems that exploit hardware accelerators developed through FPGAs with dynamic partial reconfiguration capabilities.A model is first presented and then used to derive a response-time analysis to verify the schedulability of a real-time task set under given constraints and assumptions. Although the analysis is based on a generic model, the proposed framework has been conceived to account for several real-world constraints present on today's platforms and has been practically validated on the Zynq platform, showing that it can actually be supported by state-of-the-art technologies. Finally, a number of experiments are reported to evaluate the worst-case performance of the proposed approach on synthetic workload.

12 February 2007 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
MMMauro Marinoni
Mauro Marinoni
GBGiorgio Buttazzo
Giorgio Buttazzo
Applying classical dynamic voltage scaling (DVS) techniques to real-time systems running on processors with discrete voltage/frequency modes causes a waste of computational resources. In fact, whenever the ideal speed level computed by the DVS algorithm is not available in the system, to guarantee the feasibility of the task set, the processor speed must be set to the nearest level greater than the optimal one, thus underutilizing the system. Whenever the task set allows a certain degree of flexibility in specifying timing constraints, rate adaptation techniques can be adopted to balance performance (which is a function of task rates) versus energy consumption (which is a function of the processor speed). In this paper, we propose a new method that combines discrete DVS management with elastic scheduling to fully exploit the available computational resources. Depending on the application requirements, the algorithm can be set to improve performance or reduce energy consumption, so enhancing the flexibility of the system. A reclaiming mechanism is also used to take advantage of early completions. To make the proposed approach usable in real-world applications, the task model is enhanced to consider some of the real CPU characteristics, such as discrete voltage/frequency levels, switching overhead, task execution times nonlinear with the frequency, and tasks with different power consumption. Implementation issues and experimental results for the proposed algorithm are also discussed