Abstract
Proposes three new static scheduling algorithms for allocating task graphs without communication costs to fully connected multiprocessors. The proposed algorithms, called MCP/ABS, MCP/CLR and MCP/CLRR, are based on the well-known MCP (modified critical path) algorithm, and all of them have the same complexity of O(v/sup 2/log v), where v is the number of nodes in the task graph. A global comparison of the proposed algorithms with three recently reported scheduling algorithms [ETF (earliest task first), HLFET (high level first with estimated time) and MCP] is carried out. The proposed algorithms generate similar or even better solutions than the previous algorithms in terms of the completion times of the resulting schedules using a prototype standard task graph set.
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.
