• Publications
  • Influence
Measuring the Performance of Schedulability Tests
The high computational complexity required for performing an exact schedulability analysis of fixed priority systems has led the research community to investigate new feasibility tests which are lessExpand
  • 670
  • 52
Schedulability analysis of periodic fixed priority systems
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can beExpand
  • 215
  • 36
Resource partitioning among real-time applications
  • G. Lipari, E. Bini
  • Computer Science
  • 15th Euromicro Conference on Real-Time Systems…
  • 2 July 2003
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are notExpand
  • 263
  • 31
Rate Monotonic Analysis: The Hyperbolic Bound
We propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm when the exact test cannot be applied on line due toExpand
  • 174
  • 13
Biasing effects in schedulability measures
  • E. Bini, G. Buttazzo
  • Computer Science
  • Proceedings. 16th Euromicro Conference on Real…
  • 30 June 2004
The performance of a schedulabilty test is typically evaluated by generating a huge number of synthetic task sets and then computing the fraction of those that pass the test with respect to the totalExpand
  • 152
  • 13
A hyperbolic bound for the rate monotonic algorithm
In this paper we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on lineExpand
  • 125
  • 12
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Later in theExpand
  • 87
  • 11
Delay-Aware Period Assignment in Control Systems
We consider the problem of optimal static period assignment for multiple independent control tasks executing on the same CPU. Previous works have assumed that the control performance can be expressedExpand
  • 126
  • 10
A Framework for Hierarchical Scheduling on Multiprocessors: From Application Requirements to Run-Time Allocation
  • G. Lipari, E. Bini
  • Computer Science
  • 31st IEEE Real-Time Systems Symposium
  • 30 November 2010
Hierarchical scheduling is a promising methodology for designing and deploying real-time applications, since it enables component-based design and analysis, and supports temporal isolation amongExpand
  • 69
  • 9
The Optimal Sampling Pattern for Linear Control Systems
In digital control systems, the state is sampled at given sampling instants and the input is kept constant between two consecutive instants. With the optimal sampling problem, we mean the selectionExpand
  • 32
  • 9