#### Filter Results:

- Full text PDF available (176)

#### Publication Year

1990

2017

- This year (13)
- Last 5 years (65)
- Last 10 years (120)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luca Abeni, Giorgio C. Buttazzo
- RTSS
- 1998

This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where two types of tasks can coexist simultaneously: multimedia soft real-time tasks and hard real-time tasks. Hard tasks are guaranteed based on worst case execution times and minimum interarrival times, whereas multimedia and soft… (More)

- Giorgio C. Buttazzo
- Real-Time Systems Series
- 2004

- Enrico Bini, Giorgio C. Buttazzo
- Real-Time Systems
- 2005

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 less complex than exact tests, but still provide a reasonable performance in terms of acceptance ratio. The performance of a test is typically evaluated by… (More)

- Marco Caccamo, Lynn Y. Zhang, Lui Sha, Giorgio C. Buttazzo
- RTSS
- 2002

mainly periodic and need guaranteed bounded delay; Recent advances in wireless technology have brought us closer to the vision of pervasive computing where sensors/actuators can be connected through a wireless network. Due to cost constraints and the dynamic nature of sensor networks, it is undesirable to assume the existence of base stations connected by a… (More)

- Marco Spuri, Giorgio C. Buttazzo
- Real-Time Systems
- 1996

In this paper we present five new on-line algorithms for servicing soft aperiodic requests in realtime systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm. All the proposed solutions can achieve full processor utilization and enhance aperiodic responsiveness, still guaranteeing the execution of the… (More)

- Marco Spuri, Giorgio C. Buttazzo
- RTSS
- 1994

In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest Deadline First (EDF) algorithm. All the proposed solutions can achieve full processor ulilization and enhance aperiodic responsiveness, still guaranteeing the ezecution of the… (More)

- Luca Abeni, Giorgio C. Buttazzo
- Real-Time Systems
- 2004

This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where different types of tasks (characterized by different criticality) can coexist. Whereas critical real-time tasks (hard tasks) are guaranteed based on worst-case execution times and minimum interarrival times, multimedia tasks are… (More)

- Enrico Bini, Giorgio C. Buttazzo
- IEEE Trans. Computers
- 2004

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 be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests can efficiently be used for on-line guarantee of real-time applications,… (More)

- John A. Stankovic, Marco Spuri, Marco Di Natale, Giorgio C. Buttazzo
- IEEE Computer
- 1995

Important classical scheduling theory results for real time computing are identi ed Im plications of these results from the perspective of a real time systems designer are discussed Uni processor and multiprocessor results are addressed as well as important issues such as future release times precedence constraints shared resources task value overloads… (More)

- Enrico Bini, Giorgio C. Buttazzo
- ECRTS
- 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 total number of feasible ones. The resulting ratio, however, depends on the metrics used for evaluating the performance and on the method for generating random task… (More)