Improvement in feasibility testing for real-time tasks

Real-Time Systems

Volumn 11, Issue 1, 1996, Pages 19-39

  Ripoll, Ismael ^a   Crespo, Alfons ^a   Mok, Aloysius K ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTERIZATION; COMPUTER SIMULATION; POLYNOMIALS; RESOURCE ALLOCATION; SCHEDULING;

FEASIBILITY TESTING; PERIODIC TASK SYSTEMS; SCHEDULING THEORY; WORST CASE EXPONENTIAL COMPLEXITY;

REAL TIME SYSTEMS;

EID: 0030196996     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00365519     Document Type: Article

References (16)

1. Audsley, N. C., Burns, A., David, R. I., Tindell, K.W. and Wellings, A. J. "Fixed Priority Pre-emptive Scheduling: An Historical Prespective", Real-Time Systems, Vol 8(2/3), Mar/May 1995, pp. 173-198.
2. Audsley, N. C., Burns, A. , Richardson, M., Tindell, K.W. and Wellings, A. J. "Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling", Software Engineering Journal, Vol. 8(5) Sept 1993 pp. 284-292.
3. th Real-Time Systems Symposium, Dec 1990, pp. 182-190.
4. Baruah, S., Rosier, L. and Howell, R. R. "Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor", Real-Time Systems, Dec 1990, pp. 301-324.
5. Bihari, T., and Schwan, K. "Dynamic adaptation of Real-Time software", ACM Trans. Computer Syst. and Software, May 1991.
6. Burns, A., Wellings, A. J., Bailey, C. M. and Fyfe, E. "The Olympus Attitude and Orbital Control System: A Case Study in Hard Real-Time System Design and Implementation", Department of Computer Science, University of York, report YCS 190 1993.
7. Ghetto, H. and Ghetto, M. "Some results of the Earliest Deadline Scheduling Algorithm", IEEE Transactions Software Engineering, Oct 1989.
8. Dertouzos, M. "Control robotics : the procedural control of physical processors", Proceedings of the IFIP Congress, 1974, pp. 807-813.
9. Garey, M. R., and Johnson, D. S. "Computer And Intractability, A Guide to the Theory of NP-Completeness", Ed: W. H. Freeman And Company, 1979.
10. Knuth, D. "The art of computer programming", Vol. 2, 1969, pp. 293-304.
11. Liu, C. and Layland, J."Scheduling algorithms for multiprogramming in a hard Real-Time environment", Journal of the ACM, Vol. 20(1) 1973, pp. 46-61.
12. th IEEE Real-Time Systems Symposium, Dec 1990, pp. 201-209.
13. Leung, J. and Merrill, M."A note on the preemptive scheduling of periodic, Real-Time tasks", Information Processing Letters, Vol. 11, 1980, pp. 115-118.
14. Leung, J. and Whitehead, J. "On the complexity of fixed-priority scheduling of periodic, Real-Time tasks", Performance Evaluation, Vol. 2(4), Dec 1982, pp. 237-250.
15. Mok, A."Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment, PhD Thesis, MIT Laboratory for Computer Science, May 1983.
16. SRL90 Sha, L., Rajkumar, R. and Lehoczky, J. P. "Priority inheritance protocols: An approach to real-time synchronization", IEEE Transactions on Computers, Vol. 93, Sep 1990, pp. 1175-1185.