PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling
SourceTheoretical Computer Science
Google Scholar check
MetadataShow full item record
As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using real-time scheduling theory with various notions of real-time tasks running under restricted resource supply environments. However, these real-time scheduling-based approaches are limited in their expressiveness in that, although capable of describing resource-demand tasks, they are unable to model resource supply. This paper describes a process algebraic framework PADSfor reasoning about resource demand and resource supply inspired by the timed process algebra ACSR. In ACSR, real-time tasks are specified by enunciating their consumption needs for resources. To also accommodate resource-supply processes in PADS, given a resource cpu, we write cpū to denote the availability of cpu for a requesting task process. Using PADS, we define a supply-demand relation where a pair (T,S) belongs to the relation if the demand process T can be scheduled under supply S. We develop a theory of compositional schedulability analysis as well as a technique for synthesizing an optimal supply process for a set of tasks. Furthermore, we define ordering relations between supplies which describe when a supply offers more resource capacity than another. With this notion it is possible to formally represent hierarchical scheduling approaches that assign more "generous" resource allocations to tasks in exchange for a simple representation. We illustrate our techniques via a number of examples. © 2011 Elsevier B.V. All rights reserved.
Showing items related by title, author, creator and subject.
A process algebraic framework for modeling resource demand and supply Philippou, Anna; Lee, I.; Sokolsky, O.; Choi, J. -Y (2010)As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using ...
Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2015)Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the ...
Entropy-Based Heuristic for Resource-Constrained Project Scheduling Christodoulou, Symeon E. (2016)A heuristic is presented for the resource-constrained project scheduling problem (RCPSP), based on maximizing the entropy of the project's resource histogram. The proposed RCPSP algorithm makes use of the general theory ...