SCHEDULING POSSIBILITY DETERMINATION SYSTEM, SCHEDULING POSSIBILITY DETERMINATION METHOD, AND PROGRAM

摘要

PROBLEM TO BE SOLVED: To determine more strictly and at higher speed whether or not scheduling is possible for a data flow graph in the case where the data flow graph contains such a temporal constraint as expressed by discrete time or when a delay changes if there is a boundary of the discrete time between calculations.;SOLUTION: Speeding up and strictness can be achieved by providing means for storing dependence arrangement in which a delay from the endpoint of an optional discrete time constraint is stored, to each calculation. For instance, even when a discrete time constraint is contained, it is possible to determine whether or not scheduling can be performed more strictly. Also, by storing the delay from the endpoint of the time constraint as dependence arrangement, the determination can be made more strictly even if there is dependence property of the delay for the boundary of the discrete time. Furthermore, by using the dependence arrangement in the calculation of a distance in a positive closed path detection, it is possible to consider the discrete time constraint and the discrete time boundary when searching for a positive closed path when checking the scheduling possibility.;COPYRIGHT: (C)2010,JPO&INPIT