DocumentCode
2511640
Title
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
Author
Traore, Karim ; Grolleau, Emmanuel ; Cottet, Francis
Author_Institution
LISI, ENSMA, Chasseneuil
fYear
0
fDate
0-0 0
Firstpage
10
Lastpage
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 pattern
Keywords
computational complexity; scheduling; transaction processing; approximation method; computational complexity; exponential method; load arrival pattern; monotonic transaction; pseudo-polynomial method; task analysis; worst-case response time; Computer applications; Delay; Embedded computing; Interference; Real time systems; Telephony; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on
Conference_Location
Sydney, Qld.
ISSN
1533-2306
Print_ISBN
0-7695-2676-4
Type
conf
DOI
10.1109/RTCSA.2006.21
Filename
1691289
Link To Document