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.

• Type: Conference
• Year: 2004
• Where: PDCAT
• Authors: Frode Eika Sandnes, Oliver Sinnen
• Keywords: DFS Cycle Removal, Distributed And Parallel Computing, Improved Randomised Dfs, PDCAT 2004, Well-established Dag Multiprocessor