A partitioning methodology that optimizes the communication cost for reconfigurable computing systems

Abstract

This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms. © 2012 Institute of Automation, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg.