MULTIPROCESSOR SCHEDULING WITH DIFFERENT START TIMES

The multiprocessor scheduling problem is considered in this paper. The definitions of processor-available function and processor-available time are given. The necessary conditions with which a task can be scheduled at sometime are proved. With the necessary conditions,ETEPF algorithm is presented, and the performance of this algorithm is shown through simulation analysis.