An adaptive compiler method for scheduling and place-and-route for VLIW-based dynamic reconfigurable processor

  • Authors:
  • Ryuji Hada;Kazuya Tanigawa;Akira Kojima;Tetsuo Hironaka

  • Affiliations:
  • Hiroshima City University, Information Sciences, Hiroshima, Japan;Hiroshima City University, Information Sciences, Hiroshima, Japan;Hiroshima City University, Information Sciences, Hiroshima, Japan;Hiroshima City University, Information Sciences, Hiroshima, Japan

  • Venue:
  • ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We have proposed and developed a compiler for dynamic reconfigurable processor based on VLIW model. VLIW model, which is our compiler targets, fetches and executes one configuration data as VLIW instruction. For this model, our compiler schedules mapping elements as operations and live variables in program, with consideration of hardware resources. Next, it places and routes the elements to hardware resources. In place-and-route, if the number of mapping elements in one configuration data is large, place-and-route condition is so difficult that the number of final steps might be worse. The number of mapping elements is significant important, because output result is widely different by depending on the number of mapping elements, and the optimal number of them is also different depending on the nature of applications. To search the optimal number of them and improve scheduling and place-and-route results, we propose a novel mapping method which dynamically changes the maximum number of mapping elements as parameters. To solve the previous problem, we adopt heuristic approach. As one of target processors based on VLIW model, we use PARS processor which dynamically reconfigurates and executes one configuration data as one VLIW instruction every cycle. We evaluate our method by the number of generated configuration data. And the comparative method is ones which uses constant parameters which is statically set by depending on the hardware resources of target processor. From the results, our method can find more optimal parameters for each application, and decrease 22.6% of the number of configuration data in maximum (13.4% in average), compared with the comparative method.