Controller synthesis for mapping partitioned programs on array architectures

  • Authors:

  • Hritam Dutta;Frank Hannig;Jürgen Teich

  • Affiliations:

  • Department of Computer Science 12, Hardware-Software-Co-Design, University of Erlangen-Nuremberg, Germany;Department of Computer Science 12, Hardware-Software-Co-Design, University of Erlangen-Nuremberg, Germany;Department of Computer Science 12, Hardware-Software-Co-Design, University of Erlangen-Nuremberg, Germany

  • Venue:
  • ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.