Testing for unboundedness of fifo channels
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Bounded scheduling of process networks
Bounded scheduling of process networks
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Quasi-Static Scheduling of Embedded Software Using Equal Conflict Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Quasi-Static Scheduling of Communicating Tasks
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Schedulability Analysis of Petri Nets Based on Structural Properties
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Journal of Computer and System Sciences
Quasi-static scheduling of independent tasks for reactive systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Good scheduling policies for distributed embedded applications are required for meeting hard real time constraints and for optimizing the use of computational resources. We study the quasi-static scheduling problem in which (uncontrollable) control flow branchings can influence scheduling decisions at run time. Our abstracted distributed task model consists of a network of sequential processes that communicate via point-to-point buffers. In each round, the task gets activated by a request from the environment. When the task has finished computing the required responses, it reaches a pre-determined configuration and is ready to receive a new request from the environment. For such systems, we prove that determining the existence of a scheduling policy that guarantees upper bounds on buffer capacities is undecidable. However, we show that the problem is decidable for the important subclass of ''data-branching'' systems in which control flow branchings are exclusively due to data-dependent internal choices made by the sequential components. This decidability result exploits ideas derived from the Karp and Miller coverability tree for Petri nets as well as the existential boundedness notion of languages of message sequence charts.