Stochastic DFS for multiprocessor scheduling of cyclic taskgraphs

Authors:
Frode Eika Sandnes;Oliver Sinnen
Affiliations:
Oslo University College, Oslo, Norway;Dept. of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 9
Cited 1

Introduction to algorithms

Introduction to algorithms
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding

IEEE Transactions on Computers
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Scheduling DAG's for Asynchronous Multiprocessor Execution

IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines

IEEE Transactions on Parallel and Distributed Systems
Scheduling with Dynamic Voltage/Speed Adjustment Using Slack Reclamation in Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
Power-Aware Scheduling for Periodic Real-Time Tasks

IEEE Transactions on Computers
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers
Power-aware task motion for enhancing dynamic range of embedded systems with renewable energy sources

PACS'02 Proceedings of the 2nd international conference on Power-aware computer systems

A promise theory approach to collaborative power reduction in a pervasive computing environment

UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.