Stochastic DFS for Multiprocessor Scheduling of Cyclic Taskgraphs
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established DAG multiprocessor scheduling algorithms. In this paper, we investigate the inefficiencies of schedules acquired using DFS cycle removal. Further, an improved randomised DFS cycle removal algorithm is proposed that produces significantly improved results with acceptable computational overheads.
KeywordsDirected Acyclic Graph Critical Path Sparse Graph Multiprocessor Schedule Back Edge
Unable to display preview. Download preview PDF.
- 3.Bozic, S.M.: Digital and Kalman Filtering. Edward Arnold, London (1979)Google Scholar
- 11.Yang, T., Fu, C.: Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines. IEEE Transactions on Parallel and Distributed Systems 8(6) (1997)Google Scholar
- 13.Sandnes, F.E., Sinnen, O.: A new scheduling algorithm for cyclic graphs. International Journal of High Performance Computing and Networking 1 (2004)Google Scholar