Processor Array Synthesis from Shift-Variant Deep Nested Do Loops

  • Authors:
  • Surin Kittitornkun;Yu Hen Hu

  • Affiliations:
  • Department of Computer Engineering King Mongkut's Institute of Technology Ladkrabana, Bangkok, 10520 Thailand kksurin@kmitl.ac.th;Department of Electrical and Computer Engineering, University of Wisconsin, Madison, WI 53706 hu@engr.wisc.edu

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The consolidation of Internet devices into a universal/portable device will soon be accomplishable through the incorporation of reconfigurable computing in system-on-a-chip (SOC). At any particular moment, it could be a video/audio mobile phone, an MP3 song player, and other devices. The basic construct of these multimedia processing algorithms can be described as deep nested Do loop algorithms. They are considered the most demanding data-intensive algorithms and hence ideal candidates for an array of reconfigurable nanoprocessors. Therefore, algorithm to hardware synthesis methodology is important for an efficient exploitation of both spatial parallelism and temporal pipelining. In this paper, we propose a processor array synthesis methodology. It can map an n-level nested Do loop represented by a nonuniform or shift-variant data dependence graph to a near-optimal of one-or two-dimensional processor array under the available resource constraints to satisfy high-throughput computation demands.