Analysis of a Simple Approach to Modeling Performance for Streaming Data Applications

Current state of the art systems contain various types of multicore processors, General Purpose Graphics Processing Units (GPGPUs) and occasionally Digital Signal Processors (DSPs) or Field-Programmable Gate Arrays (FPGAs). With heterogeneity comes multiple abstraction layers that hide underlying complexity. While necessary to ease programmability of these systems, this hidden complexity makes quantitative performance modeling a difficult task. This paper outlines a computationally simple approach to modeling the overall throughput and buffering needs of a streaming application deployed on heterogeneous hardware.

[1]  Wayne H. Wolf,et al.  TGFF: task graphs for free , 1998, Proceedings of the Sixth International Workshop on Hardware/Software Codesign. (CODES/CASHE'98).

[2]  James B. Orlin,et al.  Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem , 1997, Math. Oper. Res..

[3]  Behnam Pourbabai,et al.  Optimizing Flow Rates in a Queueing Network with Side Constraints , 1991 .

[4]  Roger D. Chamberlain,et al.  Use of simple analytic performance models for streaming data applications deployed on diverse architectures , 2013, 2013 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS).

[5]  Mark A. Franklin,et al.  Simple Analytic Performance Models for Streaming Data Applications Deployed on Diverse , 2013 .

[6]  Joseph M. Lancaster,et al.  TimeTrial: A low-impact performance profiler for streaming data applications , 2011, ASAP 2011 - 22nd IEEE International Conference on Application-specific Systems, Architectures and Processors.

[7]  Alasdair McAndrew.  Data Encryption Standard (DES) for Sage , 2009 .

[8]  Patrick Crowley,et al.  Auto-pipe and the X language: a pipeline design tool and description language , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[9]  Paul J. Schweitzer,et al.  Maximum Throughput in Finite-Capacity Open Queueing Networks with Product-Form Solutions , 1977 .

[10]  William S. Jewell.  New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .