Abstract
Processor arrays can be used as accelerators for a plenty of dataflow-dominant applications. Innately these applications have almost no control flow, but the application of sophisticated partitioning and scheduling techniques in order to handle large scale problems and to balance local memory requirements with I/O-bandwidth has the disadvantage of a more complex control flow. Thus, efficient control path synthesis is one of the greatest challenges when compiling algorithms onto processor arrays. This paper presents an efficient methodology for the automated control path synthesis for the mapping of partitioned algorithms onto processor arrays. The major advantages observed in the presented methodology are seen in, (a) control generation for different partitioning techniques and arbitrary parallelepiped tiles, (b) combined use of a global and a local control strategy in order to reduce the control overhead, (c) up to 90 percent reduction in control path area and resources compared to existing approaches.
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
Synfora, Inc., http://www.synfora.com
Derrien, S., Risset, T.: Interfacing Compiled FPGA Programs: The MMAlpha Approach. In: PDPTA (2000)
Lengauer, C.: Loop Parallelization in the Polytope Model. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 398–416. Springer, Heidelberg (1993)
Teich, J., Thiele, L.: Control Generation in the Design of Processor Arrays. Int. Journal on VLSI and Signal Processing 3(2), 77–92 (1991)
Xue, J.: The Formal Synthesis of Control Signals for Systolic Arrays. PhD thesis, University of Edinburgh (1992)
Darte, A., Schreiber, R., Rau, B., Vivien, F.: Constructing and Exploiting Linear Schedules with Prescribed Parallelism. ACM Transactions on Design Automation of Electronic Systems 7(1), 159–172 (2002)
Teich, J., Thiele, L., Zhang, L.: Scheduling of Partitioned Regular Algorithms on Processor Arrays with Constrained Resources. Journal of VLSI Signal Processing 17(1), 5–20 (1997)
Hannig, F., Dutta, H., Teich, J.: Regular Mapping for Coarse-grained Reconfigurable Architectures. In: Proceedings of the 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2004), Montréal, Quebec, Canada, vol. V, pp. 57–60. IEEE Signal Processing Society, Los Alamitos (2004)
Wolfe, M.: High Performance Compilers for Parallel Computing. Addison-Wesley Inc., Reading (1996)
Oldfield, J., Dorf, R.: Field Programmable Gate Arrays: Reconfigurable Logic for Rapid Prototyping and Implementation of Digital Systems. John Wiley & Sons, Chichester (1995)
Eckhardt, U., Merker, R.: Hierarchical Algorithm Partitioning at System Level for an Improved Utilization of Memory Structures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18(1), 14–24 (1999)
Teich, J., Thiele, L.: Exact Partitioning of Affine Dependence Algorithms. In: Deprettere, F., Teich, J., Vassiliadis, S. (eds.) SAMOS 2001. LNCS, vol. 2268, pp. 135–153. Springer, Heidelberg (2002)
Hannig, F., Teich, J.: Design Space Exploration for Massively Parallel Processor Arrays. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol. 2127, pp. 51–65. Springer, Heidelberg (2001)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley – Interscience series in discrete mathematics. John Wiley & Sons, Chichester, New York (1986)
Dutta, F., Hannig, F., Teich, J.: Control Path Generation for Mapping Partitioned Dataflow-dominant Algorithms onto Array Architectures. Technical Report 03-2005, University of Erlangen-Nuremberg, Department of CS 12, Hardware-Software-Co-Design (2005)
Quillere, F., Rajopadhye, S., Wilde, D.: Generation of Efficient Nested Loops from Polyhedra. International Journal of Parallel Programming 28(5), 469–498 (2000)
Bastoul, C.: Efficient Code Generation for Automatic Parallelization and Optimization. In: Int. Symposium on Parallel and Distributed Computing (ISPDC 2003), pp. 23–30 (2003)
Feautrier, P.: Parametric Integer Programming. RAIRO Recherche Operationnelle 22, 243–268 (1988)
Guillou, A., Quinton, P., Risset, T.: Hardware Synthesis for Multi-Dimensional Time. In: ASAP 2003. IEEE computer Society, Los Alamitos (2003)
PARO Design System Project, http://www12.informatik.uni-erlangen.de/research/paro
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutta, H., Hannig, F., Teich, J. (2006). Controller Synthesis for Mapping Partitioned Programs on Array Architectures. In: Grass, W., Sick, B., Waldschmidt, K. (eds) Architecture of Computing Systems - ARCS 2006. ARCS 2006. Lecture Notes in Computer Science, vol 3894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682127_13
Download citation
DOI: https://doi.org/10.1007/11682127_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32765-3
Online ISBN: 978-3-540-32766-0
eBook Packages: Computer ScienceComputer Science (R0)