Computer Science ›› 2015, Vol. 42 ›› Issue (11): 43-47.doi: 10.11896/j.issn.1002-137X.2015.11.007

Previous Articles     Next Articles

Pareto Optimization and Scheduling of Synchronous Dataflow Graphs on Heterogeneous Multicore Platform

GU Yu-lei, ZHU Xue-yang, YAN Rong-jie and ZHANG Guang-quan   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Synchronous dataflow graphs (SDFGs) are widely used to model streaming applications such as multimedia and digital signal processing applications.Streaming applications are usually required to reach a high throughput to guarantee smooth running.Using heterogeneous multicore processors to improve the throughput of streaming applications has become a feasible solution.However,a higher throughput is usually achieved with the increase of energy consumption.We presented a method to explore the Pareto space of energy consumption and throughput and find the schedule of each Pareto point.A system model includes an SDFG description for the application and a heterogeneous multicore platform.The system model is transformed to a network of timed automata (NTA) and the optimization goals are formalized as temporal logic formulae.The NTA and formulae are then used as the input of the real time model checking tool UPPAAL.The Pareto points and corresponding schedules by the trace provided by UPPAAL can be obtained.Our method is exact,which is benefited from the exhaustive search nature of model checking technique.The method can be used to help designers to understand the quantitative relationship between energy consumption and throughput in the design period,shortening development cycles and reducing costs of system developments.

Key words: Synchronous dataflow graphs,Heterogeneous multicore platform,Pareto optimization,Scheduling,Model checking

[1] Lee E A,Messerschmitt D G.Static scheduling of synchronous data flow programs for digital signal processing[J].IEEE Trans on Computer,1987,6(1):24-35
[2] Institute of Software,Chinese Academy of Sciences.The iDFOS Tool.(2014)[2014].http://lcs.ios.ac.cn/~zxy/tools/idfos.html
[3] Karp R M.A characterization of the minimum cycle mean in a digraph[J].Discrete Mathematics,1978,3(3):309-311
[4] Groote R,Kuper J,Broersma H,et al.Max-plus algebraicthroughput analysis of synchronous dataflow graphs [C]∥38th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA).Cesme,2012:29-38
[5] Stuijk S,Geilen M,Basten T.Exploring trade-offs in buffer re-quirements and throughput constraints for synchronous dataflow graphs[C]∥Proceedings of the 43rd annual Design Automation Conference.San Francisco,2006:899-904
[6] Fakih M,Gruttner K,Franzle M,et al.Towards performance analysis of SDFGs mapped to shared-bus architectures using model-checking[C]∥Design,Automation & Test in Europe Conference & Exhibition (DATE).Grenoble,2013:1167-1172
[7] Madsen J,Hansen M R,Knudsen K S,et al.System-level verification of multi-core timed-automata[C]∥Proceedings of International Federation of Automatic Control.Seoul,2008:9302-9307
[8] Bouyer P,Fahrenberg U,Larsen K G,et al.Quantitative analysis of real-time systems using priced timed automata[J].Communications of the ACM,2011,4(9):78-87
[9] Alur R,Dill DL.A theory of timed automata[J].Theoretical Computer Science,1994,6(2):183-235
[10] Behrmann G,David A,Larsen K G.A tutorial on Uppaal[J].Formal Methods for Design of Real-time Systems,2004,5:200-236
[11] Uppsala University,Aalborg University.The UPPAAL Model Checker.(2005)[2014].http://www.uppaal.com
[12] Gu Yu-lei,Zhu Xue-yang,Yan Rong-jie,et al.Pareto Optimization and Scheduling of Synchronous Dataflow Graphs on a Heterogeneous Multicore Platform.(2014)[2014].http://lcs.ios.ac.cn/~zxy/papers/r14-14.pdf

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!