Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Minimizing the weighted number of tardy task units
Discrete Applied Mathematics
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error
IEEE Transactions on Computers
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Applying imprecise algorithms to real-time image and video transmission
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Dynamic Transaction Scheduling and Reallocation in Overloaded Real-Time Database Systems
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
An Imprecise Algorithm for Real-Time Compressed Image and Video Transmission
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A New Scheduling Algorithm and a Compensation Strategy for Imprecise Computation
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
| Hi-index | 0.00 |
Scheduling tasks with different weights in the imprecise computation model is rather difficult. Each task in the imprecise computation model is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be completely executed before the deadline to produce acceptable result; the optional subtask begins after the mandatory subtask to refine the result. The error in the results of a task is measured by the processing time of the unexecuted portion of the optional subtask. This work proposes a fast algorithm for scheduling imprecise computation with timing constraints on uniprocessor systems. The proposed algorithm can obtain the optimal schedule for different weighted tasks with time complexity O(n log2 n).