论文信息 - Scheduling Imprecise Computation Tasks with Intra-Task / Inter-Task Dependence

Scheduling Imprecise Computation Tasks with Intra-Task / Inter-Task Dependence

Abstract This work presents two heuristics to be used as admission policy in imprecise task systems. It is assumed that imprecise tasks have intra-task and inter-task dependence and a 0/1 constraint. These heuristics are supposed to be used combined with off-line schedulability tests and on-line acceptance tests already described in the literature. The objective of the admission policy is to maximize system utility through the selection of optional parts for execution. Simulation is used to analyze the proposed heuristics.

Joni da Silva Fraga | R. S. Oliveira | J. Fraga | R. S. Oliveira

[1] Alan Burns,et al. Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[2] Alan Burns,et al. Integrating Best Effort and Fixed Priority Scheduling , 1994, RTSS 1994.

[3] Jane W.-S. Liu,et al. Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[4] Alan Burns,et al. Flexible scheduling for adaptable real-time systems , 1995, Proceedings Real-Time Technology and Applications Symposium.

[5] W.-S. Liu. Algorithms for scheduling tasks with input error and end-to-end deadlines , 1994 .

[6] Riccardo Bettati,et al. Imprecise computations , 1994, Proc. IEEE.

[7] J. W. Liu,et al. Algorithms for scheduling tasks with input error and end-to-end deadlines , 1994 .

[8] Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[9] Alan Burns,et al. Mechanisms for enhancing the flexibility and utility of hard real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.