Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs

Journal of Signal Processing Systems - Tập 87 Số 1 - Trang 157-175 - 2017
Marc Geilen1, Joachim Falk2, Christian Haubelt3, Twan Basten1,4, B.D. Theelen4, Sander Stuijk1
1Department Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands
2Department Computer Science, Friedrich-Alexander Universität Erlangen-Nürnberg, Erlangen, Germany
3Department Computer Science and Electrical Engineering, University of Rostock, Rostock, Germany
4Embedded Systems Innovation by TNO, Eindhoven, The Netherlands

Tóm tắt

Từ khóa


Tài liệu tham khảo

Baccelli, F., Cohen, G., Olsder, G, & Quadrat, J. P. (1992). Synchronization and linearity: Wiley.

Boudec, J. L., & Thiran, P. (2003). Network calculus: A theory of deterministic queuing systems for the internet, vol. 2050 of Lecture Notes in Computer Science: Springer.

Thiele, L., Chakraborty, S., & Naedele, M. (2000). Real-time calculus for scheduling hard real-time systems. In International Symposium on Circuits and Systems ISCAS 2000, (Vol. 4 pp. 101–104). Geneva, Switzerland.

Campos, J., Chiola, G., Colom, J., & Silva, M. (1992). Properties and performance bounds for timed marked graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 39(386), 401.

Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541–580.

Gaubert, S. (1995). Performance evaluation of (max, +) automata. IEEE Transactions Automatic Control, 40 (12), 2014–2025.

Lee, E., & Messerschmitt, D. (1987). Synchronous data flow. IEEE Proceedings, 75, 1235–1245.

Sriram, S., & Bhattacharyya, S. S. (2009). Embedded Multiprocessors: Scheduling and Synchronization. NY, USA: Marcel Dekker, Inc.

Buck, J. T. (1994). A dynamic dataflow model suitable for efficient mixed hardware and software implementations of dsp applications. In Proceedings of the 3rd International Workshop on Hardware/Software Co-Design (pp. 165–172).

Theelen, B. D., Geilen, M., Basten, T., Voeten, J., Gheorghita, S. V., & Stuijk, S. (2006). A scenario-aware data flow model for combined long-run average and worst-case performance analysis. In Proceedings of the Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design 2006 (MEMOCODE ’06) (pp. 185–194).

Stuijk, S., Geilen, M., Theelen, B., & Basten, T. (2011). Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications. In Proceedings of International Conference on Embedded Computer Systems (SAMOS), 2011 (pp. 404–411).

Geilen, M. (2011). Synchronous data flow scenarios. Transactions on Embedded Computing Systems, 10, 16:1–16:31.

Geilen, M., & Stuijk, S. (2010). Worst-case performance analysis of synchronous data ow scenarios. In International Conference on Hardware-Software Codesign and System Synthesis, CODES+ISSS 10 (pp. 125–134). Az, USA: Proceedings.

Bilsen, G., Engels, M., Lauwereins, R., & Peperstraete, J. (1996). Cyclo-static dataflow. IEEE Transactions on signal processing, 44, 397–408.

Geilen, M., Falk, J., Haubelt, C., Basten, T., Theelen, B., & Stuijk, S. (2014). Performance analysis of weakly-consistent scenario-aware dataflow graphs. In Asilomar Conference on Signals, Systems, and Computers, Asilomar 14, Pacific Grove. CA, USA: IEEE Proceedings.

Lee, E. A., & Matsikoudis, E. The Semantics of Data ow with Firing. Cambridge University Press, 2007. Chapter from From Semantics to Computer Science: Essays in memory of Gilles Kahn.

Karp, R. M., & Miller, R. E. (1966). Properties of a model for parallel computations: Determinancy, termination, queueing. SIAM Journal of Applied Mathematics, 14, 1390–1411.

Girault, A., Lee, B., & Lee, E. (1999). Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 18, 742–760.

Bhattacharya, B., & Bhattacharyya, S. (2001). Parameterized dataflow modeling for DSP systems. IEEE Transactions on Signal Processing, 49, 2408–2421.

Wiggers, M. H., Bekooij, M. J., & Smit, G. J. (2008). Buffer capacity computation for throughput constrained streaming applications with data-dependent inter-task communication. In Proceedings of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS’08 (pp. 183–194).

Buck, J., & Lee, E. A. (1994). Advanced Topics in Dataflow Computing and Multithreading, ch. The Token Flow Model. IEEE Computer Society Press.

Kahn, G. (1974). The semantics of a simple language for parallel programming. In Rosenfeld, J. (Ed.) Information Processing 74: Proceedings of the IFIP Congress 74, Stockholm, Sweden. North-Holland, Amsterdam, Netherlands (pp. 471–475).

Kahn, G., & MacQueen, D. (1977). Coroutines and networks of parallel programming. In Gilchrist, B. (Ed.) Information Processing 77: Proceedings of the IFIP Congress 77, Toronto, Canada (pp. 993–998). North-Holland.

Thiele, L., & Stoimenov, N. (2009). Modular performance analysis of cyclic dataflow graphs. In EMSOFT ’09: Proceedings of the Seventh ACM International Conference on Embedded Software (pp. 127–136). NY, USA: ACM.

Petri, C. (1962). Kommunikation mit Automaten. PhD thesis, Institut für instrumentelle Mathematik. Germany: Bonn.

Viennot, G. (1986). Combinatoire Énumérative, ch. Heaps of Pieces, I: Basic definitions and combinatorial lemmas, (pp. 321–350): Springer.

Gaubert, S., & Mairesse, J. (1999). Modeling and analysis of timed petri nets using heaps of pieces. IEEE Transactions Automatic Control, 44, 683–697.

Cochet-Terrasson, J., Cohen, G., Gaubert, S., Gettrick, M., & Quadrat, J. -P. (1998). Numerical computation of spectral elements in max-plus algebra. In Proceedings of the IFAC Conference on System Structure and Control: Nantes.

Dhingra, V., & Gaubert, S. (2006). How to solve large scale deterministic games with mean payoff by policy iteration. In Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, valuetools ’06. NY, USA: ACM.

Dasdan, A. (2004). Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems, 9, 385–418.

Bhattacharyya, S. S., Murthy, P., & Lee, E. (1997). APGAN and RPMC: Complementary heuristics for translating dsp block diagrams into efficient software implementations. Journal of Design Automation for Embedded Systems.

Falk, J., Keinert, J., Haubelt, C., Teich, J., & Bhattacharyya, S. (2008). A generalized static data flow clustering algorithm for MPSoC scheduling of multimedia applications. In EMSOFT’08: Proceedings of the 8th ACM International Conference on Embedded Software.

Meijer, S., Nikolov, H., & Stefanov, T. (2010). Throughput modeling to evaluate process merging transformations in polyhedral process networks. In DATE (pp. 747–752).

Tripakis, S., Bui, D., Geilen, M., Rodiers, B., & Lee, E. A. (2010). Compositionality in synchronous dataflow: Modular code generation from hierarchical sdf graphs. Berkeley: Technical Report UCB/EECS-2010-52, EECS Department, University of California.

Geilen, M., Tripakis, S., & Wiggers, M. (2011). The earlier the better: A theory of timed actor interfaces. In Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control, HSCC ’11 (pp. 23–32). NY, USA: ACM.

Fradet, P., Girault, A., & Poplavko, P. (2012). Spdf: A schedulable parametric dataflow moc. In Proceedings of the Conference on Design, Automation and Test in Europe, DATE ’12 (pp. 769–774). CA, USA: EDA Consortium.

Wiggers, M. (2009). Aperiodic multiprocessor scheduling. PhD thesis, University of Twente.

Geuns, S. J., Hausmans, J. P., & Bekooij, M. J. (2013). Automatic dataflow model extraction from modal real-time stream processing applications. In Proceedings of the 14th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems, LCTES ’13 (pp. 143–152). NY, USA: ACM.

Moreira, O. (2012). Temporal analysis and scheduling of hard real-time radios running on a multi-processor. PhD thesis, Eindhoven University of Technology.

Ghamarian, A., Geilen, M., Basten, T., & Stuijk, S. (2008). Parametric throughput analysis of synchronous data flow graphs. In Proceedings of the Design Automation and Test in Europe Conference (DATE), (Vol. 10-14 pp. 116–121). Munich, Germany.

Damavandpeyma, M., Stuijk, S., Geilen, M., Basten, T., & Corporaal, H (2012). Parametric throughput analysis of scenario-aware dataflow graphs. In 2012 IEEE 30th International Conference on Computer Design (ICCD) (pp. 219–226).

Skelin, M., Geilen, M., Catthoor, F., & Hendseth, S. (2014). Worst-case throughput analysis for parametric rate and parametric actor execution time scenario-aware dataflow graphs, (Vol. 2014 pp. 65–79).

De Groote, E. (2016). On the analysis of synchronous dataflow graphs: a system-theoretic perspective. PhD thesis, University of Twente.

Skelin, M., Geilen, M., Catthoor, F., & Hendseth, S. (2015). Worst-case latency analysis of sdf-based parametrized dataflow mocs. In Proceedings of the 2015 Conference on Design and Architectures for Signal and Image Processing (DASIP) (p. 2015).

Gheorghita, S., Basten, T., & Corporaal, H. (2008). Application scenarios in streaming-oriented embedded system design. IEEE Design and Test of Computers, 25, 581–589.

Plishker, W., Sane, N., Kiemb, M., Anand, K., & Bhattacharyya, S. S. (2008). Functional dif for rapid prototyping. In RSP’08. The 19th IEEE/IFIP International Symposium on Rapid System Prototyping (pp. 17–23): IEEE.

Lin, S., Wang, L. -H., Vosoughi, A., Cavallaro, J., Juntti, M., Boutellier, J., Silvn̆, O., Valkama, M., & Bhattacharyya, S. (2014). Parameterized sets of dataflow modes and their application to implementation of cognitive radio systems. Journal of Signal Processing Systems, 1–16.

Bebelis, V., Fradet, P., Girault, A., & Lavigueur, B. (2013). BPDF: A statically analyzable data ow model with integer and boolean parameters. In Proceedings of the International Conference on Embedded Software (EMSOFT) (pp. 1–10): IEEE.

Stuijk, S., Geilen, M., & Basten, T. (2006). SDF 3: SDF for free. In Application of Concurrency to System Design, 6th International Conference, ACSD 2006, Proceedings (pp. 276–278). CA, USA: IEEE Computer Society Press.

Young, N. E., Tarjan, R., & Orlin, J. (1991). Faster parametric shortest path and minimum balance algorithms. Networks, 21(2), 205–221.

Siyoum, F. (2014). Worst-case Temporal Analysis of Real-time Dynamic Streaming Applications. PhD thesis, Eindhoven University of Technology.

Moonen, A., Bekooij, M., Van den Berg, R., & Van Meerbergen, J. L. (2007). Practical and accurate throughput analysis with the cyclo static data ow model. In 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2007) (pp. 238–245). Istanbul, Turkey.

Moonen, A. (2009). Predictable Embedded Multiprocessor Architecture for Streaming Applications, PhD thesis, Eindhoven University of Technology.

Theelen, B., Geilen, M., & Voeten, J. (2011). Performance model checking scenarioaware dataflow. In Proceedings of the International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), vol. 6919 of LNCS (pp. 43–59): Springer.

Kim, D. (2003). System-level specification and cosimulation for multimedia embedded systems, PhD thesis, Seoul National University.

Oh, H., & Ha, S. (2004). Fractional rate dataflow model for efficient code synthesis. Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology, 37(1), 41–51.

Wiggers, M., Bekooij, M., & Smit, G. J. M. (2007). Efficient computation of buffer capacities for cyclo-static dataflow graphs. In Proceeding of the Design Automation Conderence (DAC) (pp. 658–663).