On the hard-real-time scheduling of embedded streaming applications

Bamakhrama, Mohamed A.; Stefanov, Todor

doi:10.1007/s10617-012-9086-x

Cited by 28 publications

(52 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One direction for our future work is to investigate under what conditions it is possible to bypass these exponential blow-ups. The existence of efficient solutions for more restricted scheduling problems (e.g., CSDF programs [4]) leads us to believe that it is possible to find such conditions.…”

Section: Discussionmentioning

confidence: 99%

“…A streaming application can be formally represented by a cyclo-static dataflow (CSDF) graph. Bamakhrama and Stefanov proposed a framework for scheduling CSDF graphs that are annotated with worstcase execution times [4]. In this section, we argue that our proposed scheduling framework of Sect.…”

Section: Cyclo-static Dataflowmentioning

confidence: 99%

“…Hence, Sect. 3.3 shows that, for regular scheduling objectives, the schedule S obtained in [4] induces a strategy in the scheduling arena A over A and M 4 .…”

Section: In [4])mentioning

confidence: 99%

“…Bamakhrama and Stefanov generate from a CSDF graph with worst-case execution times a strictly periodic task set (Example 3 in [4]), by determining…”

Section: Cyclo-static Dataflowmentioning

confidence: 99%

“…For specific types of applications, like streaming applications [18], formal models exist that are aware of the interactions among their processes. Such models are then used to synthesize schedulers that optimize the execution of their applications with respect to a scheduling goal, such as latency or power consumption [4,15]. For general types of applications, like web servers [10], no a priori detailed information about the interactions among their constituent processes is available to the scheduler.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Scheduling Games for Concurrent Systems

Dokter

Jongmans

Arbab

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A scheduler is an algorithm that assigns at any time a set of processes to a set of processors. Processes usually interact with each other, which introduces dependencies amongst them. Typically, such dependencies induce extra delays that the scheduler needs to avoid. Specific types of applications, like streaming applications, synthesize a scheduler from a formal model that is aware of these interactions. However, such interaction-specific information is not available for general types of applications. In this paper, we propose an interaction aware scheduling framework for generic concurrent applications. We formalize the amount of work performed by an application as constraints. We use these constraints to generate a graph, and view scheduler synthesis as solving a game on this graph that is played between the scheduler and the application. We illustrate that our framework is expressive enough to subsume an established scheduling framework for streaming programs.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Cyclo-static Dataflowmentioning

confidence: 99%

“…Hence, Sect. 3.3 shows that, for regular scheduling objectives, the schedule S obtained in [4] induces a strategy in the scheduling arena A over A and M 4 .…”

Section: In [4])mentioning

confidence: 99%

“…Bamakhrama and Stefanov generate from a CSDF graph with worst-case execution times a strictly periodic task set (Example 3 in [4]), by determining…”

Section: Cyclo-static Dataflowmentioning

confidence: 99%