Title
Throughput-constrained DVFS for scenario-aware dataflow graphs
Abstract
Dynamic behavior of streaming applications can be effectively modeled by scenario-aware dataflow graphs (SADFs). Many streaming applications must provide timing guarantees (e.g., throughput) to assure their quality-of-service. For instance, a video decoder which is running on a mobile device is expected to deliver a video stream with a specific frame rate. Moreover, the energy consumption of such applications on handheld devices should be as low as possible. This paper proposes a technique to select a suitable multiprocessor DVFS point for each mode (scenario) of a dynamic application described by an SADF. The technique assures strict timing guarantees while minimizing energy consumption. The technique is evaluated by applying it to several streaming applications. It solves the problem faster than the state of the art technique for dataflow graphs. Moreover, the DVFS controller devised using the proposed technique is more compact and reduces energy consumption compared to the controller devised using the counterpart technique.
Year
DOI
Venue
2013
10.1109/RTAS.2013.6531090
IEEE Real-Time and Embedded Technology and Applications Symposium
Keywords
DocType
Citations 
scenario-aware dataflow graph,dynamic application,dataflow graph,art technique,energy consumption,dynamic behavior,counterpart technique,proposed technique,strict timing guarantee,Throughput-constrained DVFS,DVFS controller
Conference
5
PageRank 
References 
Authors
0.42
0
5
Name
Order
Citations
PageRank
Sander Stuijk1107870.45
Twan Basten21833132.45
Marc Geilen3134684.30
Henk Corporaal41787166.20
Morteza Damavandpeyma5232.15