RTAS 2005 START ConferenceManager    


Improved schedulability analysis of real-time transactions with earliest deadline scheduling

Rodolfo Pellizzoni and Giuseppe Lipari

Presented at IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2005), San Francisco, California, March 7 - 10, 2005


Abstract

In this paper we address the problem of schedulability analysis of distributed real-time transactions under EDF, where each transaction is a chain of precedence constrained tasks. We propose a new efficient methodology and a set of algorithms that explicitly take into account the offsets of the transactions. We show, with an extensive set of simulations, that our methodology provides improved schedulability conditions with respect to existing algorithms. Finally, we apply the methodology to an important class of systems: heterogeneous multiprocessor systems, with a general purpose processor and one or more coprocessors (DSPs).


  
START Conference Manager (V2.47.7)
Maintainer: hjkim@redwood.snu.ac.kr