Rate derivation and its applications to reactive, real-time embedded systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
A timing-driven design and validation methodology for embedded real-time systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
CORBA-based integration framework for distributed shop floor control
Computers and Industrial Engineering
Power-Aware Scheduling for AND/OR Graphs in Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamic Task-Level Voltage Scheduling Optimizations
IEEE Transactions on Computers
A generic approach to schedulability analysis of real-time tasks
Nordic Journal of Computing
Uniprocessor scheduling under precedence constraints for embedded systems design
ACM Transactions on Embedded Computing Systems (TECS)
Proactive algorithms for job shop scheduling with probabilistic durations
Journal of Artificial Intelligence Research
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Operations Research Letters
Scheduling directives for shared-memory many-core processor systems
Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores
| Hi-index | 0.00 |
In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks. We analyze the complexity of two types of real-time AND/OR task scheduling problems. In the first type of problem, all the predecessors of every OR task must eventually be completed, but in the second type of problem, some OR predecessors may be left unscheduled. We show that most problems involving tasks with individual deadlines are NP-complete, and then present two priority-driven heuristic algorithms to minimize completion time on a multiprocessor. These algorithms provide the same level of worst-case performance as some previous priority-driven algorithms for scheduling AND-only task systems.