EDF feasibility conditions with kernel overheads on an event driven OSEK system

3rd International Conference on Systems, ICONS 2008

Volumn , Issue , 2008, Pages 277-284

  Bimbard, Franck ^a   George, Laurent ^b  

^a CEDRIC CNAM   (France)

^b Ecole Centrale Electroniques   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY CONDITIONS; PERIODIC TASKS;

BOOLEAN FUNCTIONS; COMPUTER NETWORKS; SCHEDULING;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 50649097664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICONS.2008.16     Document Type: Conference Paper

References (6)

1. N. Audsley. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Real-Time Systems Research Group, Dept. of Computer Science, University of York, York. Y01 5DD England, November 1991.
2. F. Bimbard and L. George. Fp/fifo feasibility conditions with kernel overheads for periodic tasks on an event driven osek system. 9th IEEE International Symposium on Object and component-oriented Real-time distributed Computing, Gyeongju, Korea, April 2006.
3. V. Corp. Osek/vdx operating system v. 2.2.3 specification.
4. D. Katcher, J. Lehoczky, and J. Strosnider. Scheduling models of dynamic priority schedulers. Research Report CMUCDS-93-4, Carnegie Mellon University, Pittsburgh, April 1993.
5. L. C. Liu and W. Layland. Scheduling algorithms for multi-programming in a hard real time environment. Journal of ACM, Vol. 20, No 1, pp. 46-61, January 1973.
6. M. Spuri. Analysis of deadline scheduled real-time systems. INRIA Research Report, No. 2772, Jan. 1996.