Dataflow Analysis for Real-Time Embedded Multiprocessor System Design

Abstract

Document VersionPublisher's PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication:• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publicationCitation for published version (APA): Bekooij, M. J. G., Hoes, R. J. H., Moreira, O., Poplavko, P., Pastrnak, M., Mesman, B., ... Meerbergen, van, J. (2005). Dataflow analysis for real-time embedded multiprocessor system design. In P. Stok, van der (Ed.), Dynamic and Robust Streaming in and between Connected Consumer-Electronic Devices (pp. 81-108). (Philips research book series; Vol. 3). Dordrecht: Springer.

Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

“…Bekooij et al presented a dataflow analysis for embedded realtime multiprocessor systems [3]. They analyzed the impact of TDM scheduling on applications modeled as SDF graphs.…”

“…They formulated a resource allocation heuristic [19] and a TDM scheduler combined with static allocation policy [20]. Their TDM scheduler improves the one proposed in [3]. In [21], they proved that it is possible to derive a strictly periodic schedule for the actors of a cyclic SDF graph iff the periods are greater than or equal to the maximum cycle mean of the graph.…”

“…Our approach differs from [3,19,20] in: 1) using the periodic task model which allows applying a variety of proven hard-realtime scheduling algorithms for multiprocessors, 2) providing direct analysis of acyclic graphs for which the maximum cycle mean analysis can not be applied without converting the graph into a cyclic one, and 3) using the CSDF model which is more expressive than SDF graphs. Compared to [21], our approach differs in: 1) we derive an equation which always finds the actors periods that ensure periodic execution and scheduling.…”

“…Most of the existing run-time scheduling solutions assume applications modeled as task graphs and provide best-effort or soft-real-time services [22]. Few run-time scheduling solutions exist which support applications modeled using a MoC and provide hard-real-time services [10,3,19,20]. However, these solutions either use simple MoCs such as SDF/PGM graphs or use TimeDivision Multiplexing (TDM)/Round-Robin (RR) scheduling combined with heuristics.…”

Analyzing composability of applications on MPSoC platforms

“…For multiple applications, an approach that models resource contention by computing worst-case-response-time for TDMA scheduling (requires preemption) has been analyzed in [4]. This analysis also requires limited information from the other SDFGs, but gives a very conservative bound that may be too pessimistic.…”