High-level comprehensive scheduling method based on difference constraint system and iterative model

Abstract

The invention discloses a high-level comprehensive scheduling method based on a difference constraint system and an iterative model. The high-level comprehensive scheduling method based on the difference constraint system and the iterative model is characterized in that the method comprises steps of constructing a corresponding control data flow diagram after obtaining input circuit description; dividing the control data flow diagram into a circulating part and a non-circulating part; scheduling the circulating part of the control data flow diagram by adopting an iterative model scheduling algorithm; scheduling the non-circulating part of the control data flow diagram by adopting a difference constraint system scheduling algorithm; mathematically integrating the obtained scheduling results to obtain a comprehensive scheduling result. The high-level comprehensive scheduling method based on the difference constraint system and the iterative model has the advantages that the high-level comprehensive scheduling flow is optimized, the scheduling performance is improved, the scheduling realization process is convenient and quick, the scheduling can be comprehensively realized in real time, the scheduling efficiency is high and the method can be widely applied to the high-level comprehensive scheduling field.

Description

technical field [0001] The invention relates to a high-level comprehensive scheduling method, in particular to a high-level comprehensive scheduling method based on a differential constraint system and an iterative module. Background technique [0002] The goal of high-level synthesis is to obtain a structural result based on the algorithm-level behavior description and constraint conditions of the established digital system in the target set. The high-level synthesis process includes: compilation and conversion, operator scheduling, resource allocation, register allocation, connection network generation and optimization. Among them, the operator scheduling, that is, the scheduling algorithm is to assign each operation and operation in the control data flow graph generated for compilation and transformation to each control step, so as to realize the optimal or better operator scheduling scheme under the constraint conditions, which is a high-level The most important step in...

AI Technical Summary

Problems solved by technology

There are basically two types of high-level scheduling methods, one is cyclic scheduling, and the other is acyclic scheduling. In the current high-level scheduling methods, there is no clear distinction between these two situations, and they are all based on existing technologies. Scheduling by methods such as construction method, transformation method or integer linear programming method, the scheduling process is more complicated, and it is impossible to schedule in a timely and comprehensive manner, the scheduling efficiency is low, and gradually cannot meet the development needs of integrated circuit design

Images