Abstract
In this paper an ideal distributed memory architecture is considered which is called a Virtual Distributed System. The scheduling problem is formally defined which is associated with the execution in a minimal makespan of a set of dependent tasks over such an architecture. It is shown that if the processing times of the tasks are not less that the data communication times between the tasks, the associated scheduling problem under tree-like precedence constraints is polynomial and an efficient algorithm is provided to solve it.
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.
