ACM Transactions on Embedded Computing Systems · 2014 · 29 citations · 36 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureEmbedded SystemsReal-time SystemsDataflow ModelingDynamic SchedulingEmbedded Systems ArchitecturePerformance ModelingReal-time Systems DesignTask ModelsDataflow GraphsDynamic Model SpecificationDynamic Task SchedulingEmbedded System ModelingRuntime SchedulingSynchronous DataflowSynchronous Dataflow ModelsSystem State Analysis
As the number of processors in a chip increases and more functions are integrated, the system status will change dynamically due to various factors such as the workload variation, QoS requirement, and unexpected component failure. A typical method to deal with the dynamics of the system is to decide the mapping decision at runtime, based on the local information of the system status. It is very challenging to guarantee any real-time performance of a certain application in such a dynamically varying system. To solve this problem, we propose a hybrid specification of dataflow and FSM models to specify the dynamic behavior of a system distinguishing inter- and intra-application dynamism. At the top level, each application is specified by a dataflow task and the dynamic behavior is modeled as a control task that supervises the execution of applications. Inside a dataflow task, we specify the dynamic behavior using a similar way as FSM-based SADF in which an application is specified by a synchronous dataflow graph for each mode of operation. It enables us to perform compile-time scheduling of each graph to maximize the throughput varying the number of allocated processors, and store the scheduling information. When a change in system state is detected at runtime, the number of allocated processors to the active tasks is determined dynamically utilizing the stored scheduling information of those tasks in order to meet the real-time requirements. The proposed technique is implemented in the HOPES design environment. Through preliminary experiments with a simple smartphone example, we show the viability of the proposed methodology.
36
The Semantics of a Simple Language for Parallel Programming.
Gilles Kahn · IFIP Congress · 1974 · 2.1K citations
Edward A. Lee, David G. Messerschmitt · Proceedings of the IEEE · 1987 · 1.8K citations
E. A. de Kock, W. J. M. Smits, Pieter van der Wolf et al. · 2000 · 316 citations