Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
LSTF: a new scheduling policy for complex real-time tasks in multiple processor systems
Automatica (Journal of IFAC)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults
IEEE Transactions on Computers
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Journal of Systems and Software
Hi-index | 0.00 |
In real-time systems, it is often more desirable for a job to produce an approximate, imprecise result by its deadline than to produce a precise result late. In this paper, we evaluate by simulation the performance of a heterogeneous distributed real-time system, where composite jobs with end-to-end deadlines are scheduled dynamically as they arrive in the system, utilizing imprecise computations. Each job is a directed acyclic graph of component tasks, where the output data of a task may be used as input by another task. In case the input data of a component task are imprecise, the processing time of the task is extended, in order to correct the error and produce a result of acceptable quality. The impact of input error on the system performance is investigated under various workloads and input error limits.