Design of streaming applications on MPSoCs using abstract clocks

Gamatie,

doi:10.1109/date.2012.6176571

Cited by 5 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding affine relations, a subclass of affine relations between abstract clocks was used in [14] to address time requirements of streaming applications on multiprocessor systems on chip. The whole class of affine relations is used in this paper.…”

Section: Related Workmentioning

confidence: 99%

Buffer minimization in earliest-deadline first scheduling of dataflow graphs

BouakazAdnan

TalpinJean-Pierre

2013

SIGPLAN Not.

View full text Add to dashboard Cite

Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific scheduling policy. Furthermore, the resulted schedule must ensure that communication buffers are underflow-and overflow-free. This paper describes a (partitioned) earliest-deadline first symbolic schedulability analysis of dataflow graphs that minimizes the buffering requirements. Our scheduling analysis consists of three major steps. (1) The construction of an abstract affine schedule of the graph that excludes overflow and underflow exceptions and minimizes the buffering requirements assuming some precedences between jobs. (2) Symbolic deadlines adjustment that guarantees precedences without the need for lock-based synchronizations. (3) The concretization of the affine schedule using a symbolic, fast-converging, processor-demand analysis for both uniprocessor and multiprocessor systems. Experimental results show that our technique improves the buffering requirements in many cases.

show abstract

Section: Related Workmentioning

confidence: 99%

Buffer minimization in earliest-deadline first scheduling of dataflow graphs

BouakazAdnan

TalpinJean-Pierre

2013

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Thanks to its high abstraction level, it favors a rapid system prototyping. A preliminary work of part of this paper has been presented in [4]. A comparison of our approach with cycle-accurate simulations is shown for the motion JPEG decoder.…”

Section: Introductionmentioning

confidence: 99%

Classy

Boumedien

Gamatié

et al. 2012

Proceedings of the 15th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

This paper presents an abstract multi-clock oriented reasoning for the rapid prototyping of embedded applications executed on multiprocessor systems-on-chip (MPSoCs). The scheduling of applications on execution platforms composed of processors operating at various frequencies is described and analyzed with clocks. As in the static scheduling of synchronous dataflows (SDFs), requirements for admissible schedules are investigated, which come not only from expected application behavior, but also from execution platform. An algorithm is proposed to construct admissible schedules respecting identified requirements. It is then adapted to synthesize admissible schedules for adaptive system behaviors. The modeling, analysis and algorithms presented in this paper have been implemented in a prototype tool named CLASSY (standing for CLock AnalySis SYstem). Abstract clocks, MPSoCs KeywordsMPSoC design, embedded applications, abstract clocks, synchronous approach, simulation and analysis Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.

show abstract

“…We are mainly interested in affine transformation of abstract clocks [37] which enjoy a canonical form and some useful mathematical properties. A subclass of affine relations between abstract clocks was used in [21] to address time requirements of streaming applications on multiprocessor systems on chip. Recently, affine relations are used in [13] to construct EDF schedules of dataflow graphs.…”

Section: Related Workmentioning

confidence: 99%

Design of safety-critical Java level 1 applications using affine abstract clocks

Bouakaz

Talpin

2013

Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems

View full text Add to dashboard Cite

Safety-critical Java (SCJ) is designed to enable development of applications that are amenable to certification under safety-critical standards. However, its shared-memory concurrency model causes several problems such as data races, deadlocks, and priority inversion. We propose therefore a dataflow design model of SCJ applications in which periodic and aperiodic tasks communicate only through lockfree channels. We provide the necessary tools that compute scheduling parameters of tasks (i.e. periods, phases, priorities, etc) so that uniprocessor/multiprocessor preemptive fixed-priority schedulability is ensured and the throughput is maximized. Furthermore, the resulted schedule together with the computed channel sizes ensure underflow/overflowfree communications. The scheduling approach consists in constructing an abstract affine schedule of the dataflow graph and then concretizing it.

show abstract

Design of streaming applications on MPSoCs using abstract clocks

Cited by 5 publications

References 14 publications

Buffer minimization in earliest-deadline first scheduling of dataflow graphs

Buffer minimization in earliest-deadline first scheduling of dataflow graphs

Classy

Design of safety-critical Java level 1 applications using affine abstract clocks

Contact Info

Product

Resources

About