Please use this identifier to cite or link to this item:
|Title:||Quasi-static scheduling of communicating tasks|
|Citation:||Darondeau, P., Genest, B., Thiagarajan, P.S., Yang, S. (2010). Quasi-static scheduling of communicating tasks. Information and Computation 208 (10) : 1154-1168. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ic.2009.09.005|
|Abstract:||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. © 2010 Elsevier Inc. All rights reserved.|
|Source Title:||Information and Computation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 5, 2018
checked on May 26, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.