Three obstacles to flexible scheduling

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2001, Pages 11-18

  Bernat, G ^a   Burns, A ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EARLY ACCEPTANCE; FLEXIBLE SCHEDULING; MULTI CRITERIA SCHEDULING; PROCESS MODEL; TEST MODELING;

COMPUTER NETWORKS; ELECTRICAL ENGINEERING;

REAL TIME SYSTEMS;

EID: 77949290054     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMRTS.2001.933990     Document Type: Conference Paper

References (28)

1. N. C. Audsley, A. Burns, R.I. Davis, and A. J. Wellings. Integrating unbounded software components into hard real-time systems. In S. Natarajan, editor, Imprecise and Approximate Computation, pages 63-86. Kluwer Academic Publishers, 1995.
2. N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Incorporating unbounded algorithms into predictable real-time systems. Computer Systems Science and Engineering, 8(2):80-89, 1993. (Pubitemid 23672356)
3. H. Aydin, R. Melhem, D. Mosse, and P. Mejia-Alvarez. Optimal reward-based scheduling of periodic real-time tasks. In 20th IEEE Real-fime Systems Symposium. Phoenix. USA, December 1999.
4. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of online real-time task scheduling. Real-Time Systems, 4(2):124-144, 1992.
5. S. Biyabani, J.A. Stankovic, and K. Ramamritham. The integration of criticalness and deadlines in scheduling real-time tasks. In Proceedings of the 9th IEEE Real-Time Systems Symposium, pages 152-169, 1988.
6. P. Buneman, S.B. Davidson, and A. Watters. A semantics for complex objects and approximate queries. In Proceedings of the 7th Symposium on the Principles of Database Systems, pages 305-314, 1988.
7. A. Burns, D. Prasad, A. Bondavalli, E Di Giandomenico, K. Ramamritham, J. Stankovic, and L. Stringini. The meaning and role of value in scheduling flexible real-time systems. Journal of Systems Architecture, 46:305-325, 2000.
8. G. Buttazzo and J. Stankovic. RED: A robust earliest deadline scheduling algorithm. In Proceedings of the 3rd International Workshop on Responsive Computer Systems, Austin, 1993.
9. Jen-Yao Chung, Jane W. S. Liu, and Kwei-Jay Lin. Scheuduling periodic jobs that allow imprecise results. IEEE Transactions on Computers, 39(9):1156-1173, 1990.
10. T.L. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artijicial Intelligence, pages 49-54, 1988.
11. A. Garvey and Victor Lesser. Design-to-time real-time scheduling. IEEE Transactions on Systems, Man and Cybernetics, 23(6):1491-1502, 1993.
12. A.J. Garvey and V.R. Lesser. A survey of research in deliberative real-time artificial intelligence. Real-Time Systems, 6(3):317-47, 1994.
13. E.D. Jensen, C.D. Locke, and H. Tokuda. A time driven scheduling model for real-time operating systems. In Proceedings IEEE Real-Time Sytems Symposium, pages 112-122, 1985.
14. Chen K and P. Muhlethaler. A scheduling algorithm for tasks described by time value function. Real-Time Systems, 10(3):293-312, 1996. (Pubitemid 126716094)
15. S. Koenig and R. Simmons. The effect of representation and knowledge on goal-directed exploration with reinforcement learning algorithms. Machine Learning Journal, 22:227-250, 1996.
16. R. Korf. Real-time heuristic search: First results. In Proceedings of the AAAI, pages 133-138, 1987.
17. J.W.S. Liu, K.J. Lin, W.K. Shih, A.C.S. Yu, J.Y. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, pages 58-68, 1991.
18. C.D. Locke. Best-effort decision making for real-time scheduling. CMU-CS-86-134 (PhD Thesis), Computer Science Department, CMU, 1986.
19. S. Matsubara and T. Ishida. Real-time planning by interleaving real-time search with subgoaling. In Proceedings of the International Conference on Artificial Intelligence Planning Systems, pages 122-127, 1994.
20. C. McElhone and A. Burns. Scheduling optional computations for adaptive real-time systems. Journal of Systems Architectures, 46:46-77, 2000.
21. R. Oliveira and J. Fraga. Scheduling imprecise computation tasks with intra-task/ inter-task dependence. In Proceedings of the 21st IFAC/IFIP Workshop on Real-Time Programming, WRTP'96, pages 51-56, 1996.
22. S.J. Russell and S. Zilberstein. Composinng real-time systems. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 212-217, 1991.
23. W. K. Shih, J. W. S. Liu, and J. Y. Chung. Algorithms for scheduling imprecise computations with timing constraints. In Proc. IEEE Real-Time Systems Symposium, 1989.
24. W. K. Shih, J. W. S. Liu, J. Y. Chung, and D. W. Gillies. Scheduling tasks with ready times and dead-lines to minimise average error. ACM Operating Systems Review, 23(3):14-28, 1989.
25. Too-Seng Tia, Jane Liu, and M. Shankar. Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems. Journal of Real-Time Systems, 1(21), 1996.
26. S.V. Vrbsky and J.W.S. Liu. Approximate: A query processor that produces monotonically improving approximate answers. IEEE Trans. on Knowledge and Data Engineering, pages 1056-1068, 1993.
27. S. Zilberstein. Resource-bounded sensing and planning in autonomous systems. Autonomous Robots, 3:31-48, 1996. (Pubitemid 126711453)
28. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996. (Pubitemid 126669856)