Abstract
Compaan Process Networks (CPN) are Kahn Process Networks (KPN) that are generated by a compiler, called Compaan, that translates imperatively specified affine nested loop programs to input-output equivalent KPN – specified programs. This paper presents a method to convert a given CPN to an input-output equivalent CPN in which no redundant channels appear. The method has been implemented and applied to a large set of given affine nested loop programs that Compaan can accept.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Kock, E.: Multiprocessor Mapping of Process Networks: A JPEG Decoding Case Study. In: Proc. 15th Int. Symposium on System Synthesis (ISSS 2002), Kyoto, Japan, pp.68–73 (2002)
Deprettere, E.F., Rijpkema, E., Kienhuis, B.: Translating imperative affine nested loop programs into process networks. In: Deprettere, F., Teich, J., Vassiliadis, S. (eds.) SAMOS 2001. LNCS, vol. 2268, pp. 89–112. Springer, Heidelberg (2002)
Lee, E.A., Parks, T.M.: Dataflow process networks. Proceedings of the IEEE 83, 773–799 (1995)
Kahn, G.: The semantics of a simple language for parallel programming. In: Proc. of the IFIP Congress 1974, North-Holland Publishing Co, Amsterdam (1974)
Turjan, A., Kienhuis, B., Deprettere, E.F.: A compile time based approach for solving out-oforder communication in kahn process networks. In: IEEE 13th Int. Conf. on Applicationspecific Systems, Architectures and Processors, ASAP 2002 (2002)
Zissulescu-Ianculescu, C., Stefanov, T., Kienhuis, B., Deprettere, E.: Laura: Leiden architecture research and exploration tool. In: FPL (2003)
Stravers, P., Hoogerbrugge, J.: Homogeneous multiprocessors and the future of silicon design paradigms. In: Proceedings of the Int. Symposium on VLSI Technology, Systems, and Applications (2001)
Rijpkema, E.: From Piecewise Regular Algorithms to Dataflow Architectures (2001)
Feautrier, P.: Dataflow analysis of scalar and array references. Int. J. of Parallel Programming 20, 23–53 (1991)
Feautrier, P.: Parametric integer programming Operations Research, vol. 22(3), pp. 243–268 (1988)
Pugh, W.: The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. Communications of the ACM 35, 102–114 (1992)
Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16, 575–577 (1973)
De Micheli, G.: Synthesis and optimization of digital circuits, McGraw-Hill series in electrical and computer engineering. Electronics and VLSI circuits (1994)
Wilde, D.: A library for doing polyhedral operations. In: Technical Report PI 785, IRISA, Rennes, France (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cimpian, I., Turjan, A., Deprettere, E., de Kock, E. (2004). Communication Optimization in Compaan Process Networks. In: Pimentel, A.D., Vassiliadis, S. (eds) Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2004. Lecture Notes in Computer Science, vol 3133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27776-7_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-27776-7_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22377-1
Online ISBN: 978-3-540-27776-7
eBook Packages: Springer Book Archive