Abstract

The multiprocessor scheduling is the method to allocate modules(or tasks) with precedence relationship onto the processors in such a way that the parallel time (completion time of a program in multiprocessor system) is minimized. In this paper, we propose a scheduling heuristic which is based on linear clustering scheme and uses only local information of a DAG (Directed Acyclic Graph). Proposed algorithm gives an optimal scheduling result for a coarse grain DAG with only fork or join nodes and a greatly reduced parallel time for general DAGs. Simulation results showed that proposed algorithm has better scheduling result and less algorithm execution time than any of compared algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.