摘要
任务调度是并行分布式计算机中最有挑战性的问题之一。如何合理有效地进行任务调度将直接影响到系统的并行效率。文中通过将任务图转换为时间petri网的方法,利用求时间petri网的可覆盖树的方法来分析网系统的状态变化和变迁的发生序列,从而求出关键路径和顺序队列。再将该队列分配到处理机上,来缩短相关任务图的调度长度。
Task scheduling is one of most ehallengable 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.
出处
《计算机技术与发展》
2007年第6期15-17,共3页
Computer Technology and Development
