Imprecise computation technique to schedule AND/OR tasks with global end-to-end deadline in distributed real-time systems

Directed acyclic graphs (DAGs) are used to represent AND/OR precedence constraint systems where AND tasks are ready to execute when all of their direct predecessors are completed and OR tasks are ready to execute when one or more but not necessarily all of their direct predecessors are completed. A proposed imprecise computation technique ICT is introduced to maximize the solution quality within the available time. To examine and evaluate ICT, a random graph generator algorithm (RGG) is created to provide a wide range of random DAGs to be used in the simulation experiments.