Abstract
This paper presents an efficient task scheduling algorithm for multiprocessor systems based on clustering with task duplication. This algorithm has a relatively small time complexity of O(|E| log |V|) for a task graph of |V| nodes and |E| edges. Results from an extensive simulation run on randomly generated graphs as well as several application graphs demonstrate a significant improvement in using the proposed technique over several well-known fast techniques. Schedule lengths produced by the proposed algorithm are in general comparable to the ones generated by techniques with a much larger computation time requirement. Actual processing time required by this technique is among the smallest in all advanced techniques, while the number of processors needed is also among the least in all techniques.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
