Resource optimization for CSDF-modeled streaming applications with latency constraints

In this paper, we study the problem of minimizing the number of processors required for scheduling latency-constrained streaming applications modeled as CSDF graphs, where the actors of a CSDF are executed as strictly periodic tasks. We formalize the problem and prove that due to the strict periodicity of actors the problem is an integer convex programming problem, that can be solved efficiently by using an existing convex programming solver. We evaluate our solution approach on a set of 13 real-life streaming applications modeled as CSDF graphs and demonstrate that it can reduce the number of processors in more than 52% of the conducted experiments in comparison to an existing approach.

[1]  Sanjoy K. Baruah,et al.  The partitioned multiprocessor scheduling of sporadic task systems , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  Period Optimization for Hard Real-time Distributed Automotive Systems , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[3]  Todor Stefanov,et al.  Managing latency in embedded streaming applications under hard-real-time scheduling , 2012, CODES+ISSS '12.

[4]  Xiaobo Sharon Hu,et al.  Meeting End-to-End Deadlines through Distributed Local Deadline Assignments , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[5]  Jason Cong,et al.  Synthesis Algorithm for Application-Specific Homogeneous Processor Networks , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Xin He,et al.  Optimal synthesis of latency and throughput constrained pipelined MPSoCs targeting streaming applications , 2010, 2010 IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).

[7]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[8]  Sander Stuijk,et al.  Latency Minimization for Synchronous Data Flow Graphs , 2007, 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007).

[9]  William Thies,et al.  An empirical characterization of stream programs and its implications for language and compiler design , 2010, 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT).

[10]  Jean A. Peperstraete,et al.  Cycle-static dataflow , 1996, IEEE Trans. Signal Process..

[11]  Xiaofeng Wang,et al.  Period and Deadline Selection for Schedulability in Real-Time Systems , 2008, 2008 Euromicro Conference on Real-Time Systems.

[12]  Patricia Balbastre Betoret,et al.  Optimal deadline assignment for periodic real-time tasks in dynamic priority systems , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[13]  Todor Stefanov,et al.  Hard-real-time scheduling of data-dependent tasks in embedded streaming applications , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.