Sciweavers

67 search results - page 1 / 14
» Response-Time Analysis of tasks with offsets
Sort
View
ECRTS
2005
IEEE
13 years 10 months ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
ETFA
2006
IEEE
13 years 10 months ago
Response-Time Analysis of tasks with offsets
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
Karim Traore, Emmanuel Grolleau, Ahmed Rahni, Mich...
RTCSA
2006
IEEE
13 years 10 months ago
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Karim Traore, Emmanuel Grolleau, Francis Cottet
CODES
2007
IEEE
13 years 10 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
RTAS
2008
IEEE
13 years 10 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller