Algorithm of Multiprocessor Scheduling Based on Time Petri Nets
Bo Chen · Computer Technology and Development · 2007
Task scheduling is one of most challengable problems in parallel and distributed computing.How to schedule the parallel tasks onto the processors will greatly influence the parallel computing performance of the applications.By the method of translating tasks graph into time petri nets(TPN),analyzes the state covertion and transition fire sequence.By using the TPN coverability tree,finding out the critical path and the allocating sequence.Then allocate the sequence to the processors.It can shorten the scheduing length of the task graph.