Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
Authors:
- E. GrolleauEGE. Grolleau
- F. CottetFCF. Cottet
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 10-16
Abstract
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 rotation) localized at the beginning of the transaction. In the general context of tasks with offsets (general transactions) only exponential methods are known to calculate the worst-case response time. The pseudo-polynomial methods known give an upper bound of the worst-case response time. The method of analysis suggested in this article gives the real worst-case response time: moreover; this method has a complexity lower than that of the existing methods of approximation. There are two main steps in the application of this method: grouping the tasks of the transaction in a normal form and seeking a monotonic patternKeywords
This publication has 6 references indexed in Scilit:
- Fast and Tight Response-Times for Tasks with Offsets2006
- A multiframe model for real-time tasks2002
- Schedulability analysis for tasks with static and dynamic offsets2002
- A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms2002
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973