Abstract
Resource matching is the core function of the grid. This paper analyzed the characteristics of the grid, designed a Hierarchical Resource Scheduling Model for data resources in grid and a new resource scheduling algorithm. This model can combine each function units of resource scheduling organically to meet with resource scheduling requirements of different goals, different levels, and different particle size involved in grid resource scheduling. Finally, a new resource scheduling algorithm was designed based on the resource object space distance. The experimental results show that the algorithm can effectively balance the performance and cost index in less computation, realize resource scheduling, and won’t cause too much burden to the system. Keywords-grid; resource scheduling model; resource scheduling algorithm
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.
