Executing dataflow actors as Kahn processes
Abstract
Programming models which specify an application as a network of independent computational elements have emerged as a promising paradigm for programming streaming applications. The antagonism between expressivity and analysability has led to a number of different such programming models, which provide different degrees of freedom to the programmer. One example are Kahn process networks (KPNs), which, due to certain restrictions in communication, can guarantee determinacy (their results are independent of timing by construction). On the other hand, certain dataflow models, such as the CAL Actor Language, allow non-determinacy and thus higher expressivity, however at the price of static analysability and thus a potentially less efficient implementation. In many cases, however, non-determinacy is not required (or even not desired), and relying on KPN for the implementation seems advantageous.
In this paper, we propose an algorithm for classifying dataflow actors (i.e. computational elements) as KPN compatible or potentially not. For KPN compatible dataflow actors, we propose an automatic KPN translation method based on this algorithm. In experiments, we show that more than 75% of all mature actors of a standard multimedia benchmark suite can be classified as KPN compatible and that their execution time can be reduced by up to 1.97x using our proposed translation technique. Finally, in a manual classification effort, we validate these results and list different classes of KPN incompatibility.
References
[1]
Open RVC-CAL Application Repository. https://github.com/orcc/orc-apps, 2014.
[2]
A. Benveniste et al. Compositionality in dataflow synchronous languages. Inf. Comput., 163(1):125--171, Nov. 2000.
[3]
G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theoretical Computer Science, 20(3):265--321, 1982.
[4]
G. Bilsen et al. Cycle-Static Dataflow. IEEE Transactions on Signal Processing, 44(2):397--408, 1996.
[5]
J. Boutellier et al. Quasi-static scheduling of cal actor networks for reconfigurable video coding. Journal of Signal Processing Systems, 63(2):191--202, 2011.
[6]
J. Boutellier, M. Raulet, and O. Silvén. Automatic Hierarchical Discovery of Quasi-Static Schedules of RVC-CAL Dataflow Programs. Journal of Signal Processing Systems, 71(1):35--40, 2013.
[7]
J. Ceng et al. MAPS: An Integrated Framework for MPSoC Application Parallelization. In Proc. Design Automation Conference (DAC), pages 754--759, 2008.
[8]
L. De Moura and N. Bjørner. Z3: An Efficient SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems, pages 337--340. Springer, 2008.
[9]
J. Eker and J. Janneck. CAL Language Report. Technical report, University of California at Berkeley, Dec 2003.
[10]
J. Ersfolk et al. Scheduling of Dynamic Dataflow Programs based on State Space Analysis. In Proc. IEEE Int'l Conf. on Acoustics, Speech, and Signal Processing (ICASSP), pages 1661--1664, 2012.
[11]
A. Ghazi et al. Low power implementation of digital predistortion filter on a heterogeneous application specific multiprocessor. In Proc. IEEE Int'l Conf. on Acoustics, Speech, and Signal Processing (ICASSP), pages 8336--8340, May 2014.
[12]
G. Kahn. The Semantics of a Simple Language for Parallel Programming. In Proc. IFIP Congress in Information Processing, volume 74, pages 471--475, 1974.
[13]
E. A. Lee and D. G. Messerschmitt. Synchronous Data Flow. Proceedings of the IEEE, 75(9):1235--1245, 1987.
[14]
E. A. Lee and T. M. Parks. Dataflow Process Networks. Proceedings of the IEEE, 83(5):773--801, 1995.
[15]
D. B. MacQueen. Kahn networks at the dawn of functional programming. From Semantics to Computer Science: Essays in Honour of Gilles Kahn, pages 95--137, 2009.
[16]
M. Mattavelli, I. Amer, and M. Raulet. The Reconfigurable Video Coding Standard. IEEE Signal Processing Magazine, 27(3):159--167, 2010.
[17]
W. Plishker, N. Sane, and S. Bhattacharyya. A Generalized Scheduling Approach for Dynamic Dataflow Applications. In Proc. Conf. on Design, Automation and Test in Europe (DATE), pages 111--116, 2009.
[18]
L. Schor et al. Scenario-Based Design Flow for Mapping Streaming Applications onto On-Chip Many-Core Systems. In Proc. Int'l Conf. on Compilers, Architectures and Synthesis for Embedded Systems (CASES), pages 71--80, 2012.
[19]
G. Winskel. Event structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of Lecture Notes in Comp. Science, pages 325--392. Springer, 1987.
[20]
M. Wipliez and M. Raulet. Classification of Dataflow Actors with Satisfiability and Abstract Interpretation. Int'l Journal of Embedded and Real-Time Communication Systems (IJERTCS), 3(1):49--69, 2012.
[21]
H. Yviquel et al. Orcc: Multimedia Development Made Easy. In Proc. Int'l Conf. on Multimedia, pages 863--866. ACM, 2013.
[22]
C. Zebelein et al. Classification of General Data Flow Actors into Known Models of Computation. In Proc. Int'l Conf. on Formal Methods and Models for Co-Design (MEMOCODE), pages 119--128, 2008.
Index Terms
- Executing dataflow actors as Kahn processes
Recommendations
Requirements on the execution of Kahn process networks
ESOP'03: Proceedings of the 12th European conference on ProgrammingKahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criteria for correct scheduling of their realisations. In [12], Parks shows how ...
Realizing FIFO Communication When Mapping Kahn Process Networks onto the Cell
SAMOS '09: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and SimulationKahn Process Networks (KPN) are an appealing model of computation to specify streaming applications. When a KPN has to execute on a multi-processor platform, a mapping of the KPN model to the execution platform model should mitigate all possible ...
Deterministic receptive processes are Kahn processes
MEMOCODE '05: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-DesignDeterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies the design and validation of such systems and most concurrent formalisms are nondeterministic. This paper connects two of the more successful ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIGBED: ACM Special Interest Group on Embedded Systems
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE: Institute of Electrical and Electronics Engineers
- SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
IEEE Press
Publication History
Published: 04 October 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 60 of 203 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 70Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in