PARAS: System-level concurrent partitioning and scheduling

Abstract

Partitioning for the ASIC designs is examined and the interaction between high-level synthesis and partitioning is studied and incorporated in the solution. Four algorithms (called PARAS) which can exploit this interaction by solving the scheduling and partitioning problems concurrently are presented. PARAS maximizes the overall performance of the nal design and considers dierent c hip congurations and communication structures. Experiments, conducted with specications ranging in size from few to hundreds of operations, demonstrate the success of this approach.