Abstract: We develop a 0-1 non-linear programming (NLP) model for combined temporal partitioning and high-level synthesis from behavioral specifications ...

Abstract. We develop a 0-1 non-linear programming NLP model for combined temporal partitioning and high- level synthesis from behavioral specifications ...

Jul 11, 2005 · This algorithm is used to solve the time partitioning problem. It divides the input task graph model to an optimal number of partitions and puts ...

We develop a 0-1 non-linear programming (NLP) model for combined temporal partitioning and high-level synthesis from behavioral specifications destined to ...

Model formulation, NLP linearized to an ILP solution by a LP solver. No. Solution Found ? Yes. Behavior specification. FPGA cost metrics. Characterized.

Bibliographic details on Optimal Temporal Partitioning and Synthesis for Reconfigurable Architectures.

This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully reconfigurable systems and divides ...

In this paper we present a new temporal partitioning methodology used for the data-path part of an algorithm for the reconfigurable embedded system design.

Pareto Optimal Temporal Partition Methodology for Reconfigurable Architectures Based on Multi-objective Genetic Algorithm · Weiguang Sheng, Weifeng He, +1 author

In this paper, we present a typical temporal partitioning methodology that temporally partitions a data flow graph on reconfigurable system. Our approach ...