Earliest-Deadline First Scheduling of Multiple Independent Dataflow Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Earliest-Deadline First Scheduling of Multiple Independent Dataflow Graphs

Abstract

Static dataflow graphs are widely used in design of concurrent real-time streaming applications on multiprocessor systems-on-chip. The increasing complexity of these systems advo- cates using real-time operating systems and dynamic scheduling to manage applications and resources. Providing timing guaran- tees (e.g. minimum throughput, deadlines) and minimizing the required amount of resources (e.g. number of processors, buffer capacities) are crucial aspects of these systems.This paper addresses uniprocessor and partitioned multipro- cessor earliest-deadline first scheduling of multiple concurrent applications, each designed as an independent dataflow graph. Our scheduling approach maps each actor to a periodic real- time task and computes the appropriate buffer sizes and timing and scheduling parameters (i.e. periods, processor allocation, etc.). The proposed parametric schedulability analysis aims at maximizing the overall processor utilization, and hence allows for reducing the required number of processors.
No file

Dates and versions

hal-01092606 , version 1 (09-12-2014)

Identifiers

  • HAL Id : hal-01092606 , version 1

Cite

Adnan Bouakaz, Thierry Gautier, Jean-Pierre Talpin. Earliest-Deadline First Scheduling of Multiple Independent Dataflow Graphs. 2014 IEEE Workshop on Signal Processing Systems (SiPS), Oct 2014, Belfast, United Kingdom. ⟨hal-01092606⟩
315 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More