Task Scheduling for Directed Cyclic Graph Using Matching Technique

Abstract

The scheduling and mapping of task graph to processors is considered to be the most crucial NP-complete in parallel and distributed computing systems. In this paper, the theoretical graph application using matching is presented to assign a number of tasks onto two processors. This paper addresses a directed-weighted cyclic graph. The effort is to reduce the… (More)

Topics

11 Figures and Tables

Cite this paper

@inproceedings{Ariffin2015TaskSF, title={Task Scheduling for Directed Cyclic Graph Using Matching Technique}, author={W A Wan Ariffin}, year={2015} }