Computing period minimization for function-block simulation inparallel processing systems

摘要

The aim of our research is to develop the optimal task schedulingalgorithm that minimizes the computing period in general networkstructures considering communication contention and routing delay. Wepresent new ideas of scheduling: (i) the individual start that allowsoverlapping two different iterations, (ii) the scheduling space and thescheduling graph that represent feasible schedules, and (iii) thecheck-and-diffusion algorithm utilizing property of the start-timedifference vs. The computing period. With concrete examples ofscheduling spaces, segments, and schedules, we show that individualstart reduces the computing period, and our algorithm can find theoptimal start-time difference