Feasibility analysis of real-time periodic tasks with offsets

Real-Time Systems

Volumn 30, Issue 1-2, 2005, Pages 105-128

  Pellizzoni, Rodolfo ^a   Lipari, Giuseppe ^a  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

Author keywords

Real time systems; Scheduling

Indexed keywords

ASYNCHRONOUS PERIODIC TASK SETS; FEASIBILITY ANALYSIS; PSEUDO-POLYNOMIAL TEST;

COMPUTER SIMULATION; ONLINE SYSTEMS; RANDOM ACCESS STORAGE; RESOURCE ALLOCATION; SCHEDULING; SYNCHRONOUS MACHINERY;

REAL TIME SYSTEMS;

EID: 24944563516     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-005-0506-x     Document Type: Conference Paper

References (17)

1. Baker, T. 1991. Stack-based scheduling of real-time processes. Journal of Real-Time Systems 3.
2. Baruah, S., Buttazzo, G., Gorinsky, S., and Lipari, G. 1999. Scheduling periodic task systems to minimize output jitter. In Proceedings of the International Conference on Real-Time Computing Systems and Applications. Hong Kong, pp. 62-69.
3. Baruah, S., Mok, A., and Rosier, L. 1990a. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pp. 182-190.
4. Baruah, S., Rosier, L., and Howell, R. 1990b. Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. The Journal of Real-Time Systems 2.
5. Buttazzo, G. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Boston: Kluwer Academic Publishers.
6. Cervin, A. 1999. Improved scheduling of control tasks. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. York, UK, pp. 4-10.
7. Chen, M., and Lin, K. 1990. Dynamic priority ceilings: A concurrency control protocol for real-time systems. Journal of Real-Time Systems 2.
8. Dertouzos, M. L. 1974. Control robotics: The procedural control of physical processes. Information Processing.
9. Jeffay, K. 1992. Scheduling sporadic tasks with shared resources in hard-real-time systems. In Proceedings of the 13th IEEE Real-Time Systems Symposium. Phoenix, pp. 89-99.
10. Leung, J.-T., and Merril, M. 1980. A note on preemptive scheduling of periodic real-time tasks. Information Processing Letters 3(11).
11. Lipari, G. and Buttazzo, G. 2000. Schedulability analysis of periodic and aperiodic tasks with resource constraints. System Architecture 46: 327-338.
12. Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery 20(1).
13. Palencia, J., and Gonzalez Harbour, M. 2003. Offset-based response time analysis of distributed systems scheduled under EDF. In 15th Euromicro Conference on Real-Time Systems. Porto, Portugal.
14. Pellizzoni, R. and Lipari, G. 2005. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium. San Francisco, California.
15. Spuri, M. 1996a. Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA, France.
16. Spuri, M. 1996b. Holistic analysis for deadline scheduled real-time distributed systems. Technical Report RR-2873, INRIA, France.
17. Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analysing fixed priority hard real-time tasks. Journal of Real Time Systems 6(2): 133-151.