Operation scheduling is one of the most important steps in datapath design. The object of this paper is to propose a new idea of scheduling which may potentially lead to an optimal result. Different from the algorithms proposed in the past, which try to find the control step that is suitable for a selected operation, the new idea tries to find the control step that is not suitable for the operation. An operation is scheduled when all the unsuitable steps are found. Some allocation problems such as functional unit sharing and connection minimisation, are combined into the scheduling procedure. Thus, the allocation procedure is simplified and design quality increases. The experiment show that the optimality of scheduling is distinctly improved comparing to those of related works published before.
展开▼
