Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for scheduling imprecise computations with timing constraints
SIAM Journal on Computing
Software radio system design for accessing wireless multimedia services
Information processing and technology
Journal of Systems and Software
Real-time, load-adaptive processing of continuous queries over data streams
Proceedings of the second international conference on Distributed event-based systems
Fault tolerant control: an imprecise computation setting
ROCOM'09 Proceedings of the 9th WSEAS international conference on Robotics, control and manufacturing technology
An imprecise computation framework for fault tolerant control design
WSEAS Transactions on Computers
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Energy reduction for scheduling a set of multiple feasible interval jobs
Journal of Systems Architecture: the EUROMICRO Journal
I-DEVS: imprecise real-time and embedded DEVS modeling
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Real-time packet scheduling in next generation radio access system
Computer Communications
| Hi-index | 15.00 |
We consider here the problem of scheduling tasks in the imprecise computation model to minimize the maximum error. Given a task system and a schedule of it, the maximum error of the task system is equal to the error of the task that has the largest error when the task system is executed according to the schedule. We describe two preemptive algorithms for scheduling on a processor n dependent tasks with rational ready times, deadlines, and processing times. Each schedule found by our algorithms is an optimal schedule with the minimum total error, and according to this schedule the maximum error is minimized. The run times of our algorithms are O(n3) and O(n2).