Abstract
This paper addresses the problem of assigning a task with precedence constraint to a distributed computing system. The task turnaround time including communication overhead and idle time is adopted to measure the performance of task assignment. The task assignment in this paper requires one to determine not only the assignment of modules, but also the sequence of message transmission to balance processor loads and diminish communication overhead. The search for the optimal task assignment with precedence constraint is known to be NP-complete in the strong sense. A heuristic algorithm with polynomial time complexity is then proposed in order to effectively solve the task assignment problem. The experimental results reveal that the proposed approach is able to obtain a near-optimal or even the optimal task assignment.
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.
