Scheduling optional computations for adaptive real-time systems

Journal of Systems Architecture

Volumn 46, Issue 1, 2000, Pages 49-77

  McElhone, Charlie ^a   Burns, Alan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

ADAPTIVE REAL TIME SYSTEMS; FLEXIBLE SCHEDULING; GUARANTEE ALGORITHMS;

REAL TIME SYSTEMS;

EID: 0033640563     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(98)00058-7     Document Type: Article

References (22)

1. N.C. Audsley, Flexible scheduling in hard real-time systems, D.Phil. Thesis, Computer Science Department, University of York, August 1993.
2. N.C. Audsley, A. Burns, M.F. Richardson, A.J. Wellings, Incorporating unbounded algorithms into predictable real-time systems, YCS 171, Department of Computer Science, University of York, March 1992.
3. J.Y. Chung, J.W.S. Liu, K.J. Lin, Scheduling periodic jobs that allow imprecise results, IEEE Transactions on Computers, 39 (9) (1990).
4. R.I. Davis, On exploiting spare capacity in hard real-time systems, D.Phil. Thesis, Computer Science Department, University of York, July 1995.
5. R.I. Davis, Guaranteeing X in Y: on-line acceptance tests for hard aperiodic tasks scheduled by the slack stealing algorithm, YCS 231, Department of Computer Science, University of York, June 1994.
6. R. Davis, S. Punnekkat, N. Audsley, A. Burns, Flexible scheduling for adaptive real-time systems, Proceedings IEEE Real-Time Technology and Applications Symposium, Chicago, May 1995.
7. A. Garvey, V. Lesser, Representing and scheduling satisficing tasks, in: S. Natarajan (Ed.), Imprecise and Approximate Computation, Kluwer Academic Publishers, Dordrecht, 1995.
8. J.W.S. Liu, K.J. Lin, S. Natarajan, Scheduling real-time, periodic jobs using imprecise results, Proceedings Eighth IEEE Real-Time Systems Symposium, Fairmont Hotel, San Hose, California, December 1987, pp. 252-260.
9. J.W.S. Liu, K.J. Lin, W.K. Shih, A.C.S. Yu, J.Y. Chung, W. Zhao, Algorithms for scheduling imprecise computations, IEEE Computer, May (1991) 58-68.
10. C.D. Locke, Best-effort decision making for real-time scheduling, Technical Report CMU-CS-86-134 (Ph.D. Thesis), Computer Science Department, Carnegie-Mellon University, May 1986.
11. C. McElhone, Adapting and evaluating algorithms for dynamic schedulability testing, YCS 225, Department of Computer Science, University of York, March 1994.
12. C. McElhone, Hybrid algorithms for dynamic schedulability testing, YCS 241, Department of Computer Science, University of York, November 1994.
13. D. Niehaus, K. Ramamritham, J.A. Stankovic, G. Wallace, C. Weems, W. Burleson, J. Ko, The spring scheduling co-processor: design, use and performance, Proceedings 14th IEEE Real-Time Systems Symposium, Durham, N. Carolina, USA, December 1993.
14. J.A. Stankovic, Misconceptions about real-time computing, IEEE Computer, October (1988).
15. J.A. Stankovic, K. Ramamritham, Overview of the spring project, COINS Technical Report 89-03, University of Massachusetts, Amherst, January 1989.
16. J.A. Stankovic, K. Ramamritham, The Spring Kernel: a new paradigm for real-time systems, IEEE Software, May (1991).
17. J.A. Stankovic, K. Ramamritham, W. Zhao, Distributed scheduling of tasks with deadlines and resource requirements, IEEE Transactions Computers, August (1989) 1, 110-111, 123.
18. H. Tokuda, J.W. Wendorf, H.J. Wang, Implementation of a time-driven scheduler for real-time operating systems, Proceedings IEEE Real-Time Systems Symposium, December 1987, pp. 271-280.
19. J.W. Wendorf, Implementation and evaluation of a time-driven scheduling processor, Proceedings IEEE Real-Time Systems Symposium, 1988, pp. 172-180.
20. J. Yen, S. Natarajan, A decision-theoretic treatment of imprecise computation, in: S. Natarajan (Ed.), Imprecise and Approximate Computation, Kluwer Academic Publishers, Dordrecht, 1995.
21. W. Zhao, K. Ramamritham, J.A. Stankovic, Scheduling tasks with resource requirements in hard real-time systems, IEEE Transactions on Software Engineering SE-13 (5) (1987).
22. S. Zilberstein, Operational rationality through compilation of anytime algorithms, Ph.D. Thesis, Department of Computer Science, University of California at Berkeley, 1993.