Abstract
Task scheduling is of great significance to shorten performing time and minimize the cost for computational Grid. A grid task schedule algorithm is presented in this paper, which is based on a constraint satisfaction neural network. The constraint satisfaction means to remove the violations for sequence and resource constraints during scheduling subtasks for grid environment. The data-transferring costs among subtasks are also considered in our task scheduling. The simulation in this paper has shown that the task schedule algorithm is efficient with respect to the quality of solutions and the solving speed.
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.
