A Parallel Scheduling Algorithm for Solving Transport Equations
Zhou Di · Chinese Journal of Computers · 2010
Parallel sweep scheduling problem belong to the precedence constrained scheduling problem,and is NP-complete.How to schedule the local grids according to the characteristic of transport problem and keep the well performance of computation and communication is a hard work.This paper presents a priority scheduling algorithm based on DFDS algorithm.The new algorithm has well locality and less communication,and creates well priority queue.The new parallel priority scheduling algorithm is used to solve the two dimension particle transport equations.Performance results show that the new algorithm has better parallel performance than many scheduling algorithms widely used now.For the large transport problem,parallel efficiency is 96% on 1024 processors relative to 64.