A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Real-time knowledge-based control systems
Communications of the ACM
Reducing problem-solving variance to improve predictability
Communications of the ACM
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
Journal of VLSI Signal Processing Systems - Special issue on the rapid prototyping of application specific signal processors (RASSP) program
DAC '97 Proceedings of the 34th annual Design Automation Conference
Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Adaptive feedback scheduling of incremental and design-to-time tasks
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Algorithms for Scheduling Imprecise Computations with Timing Constraints to Minimize Maximum Error
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Prediction of Performance and Processor Requirements in Real-Time Data Flow Architectures
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
APPROXIMATE: A Query Processor that Produces Monotonically Improving Approximate Answers
IEEE Transactions on Knowledge and Data Engineering
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Design of a Real-Time SQL Engine in the Distributed Environment
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
Empirical Differences between COTS Middleware Scheduling Strategies
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Real-Time Scheduling of Hierarchical Reward-Based Tasks
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Journal of Systems and Software
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
Enforceable component-based realtime contracts
Real-Time Systems
Engineering Real-Time Robotics Software Systems Using CLEOPATRA
Integrated Computer-Aided Engineering
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Real-time, load-adaptive processing of continuous queries over data streams
Proceedings of the second international conference on Distributed event-based systems
Flexible hard real-time scheduling for deliberative AI systems
Real-Time Systems
Periodic scheduling with obligatory vacations
Theoretical Computer Science
Specification and simulation of real time concurrent systems using standard SDL tools
SDL'03 Proceedings of the 11th international conference on System design
Journal of Systems and Software
Leakage-aware dynamic scheduling for real-time adaptive applications on multiprocessor systems
Proceedings of the 47th Design Automation Conference
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
I-DEVS: imprecise real-time and embedded DEVS modeling
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Fairness-free periodic scheduling with vacations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
International Journal of Web and Grid Services
| Hi-index | 15.03 |
The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.