Abstract

In this work, we study the influence of local neighborhood choice to the efficiency of decentralized scheduling in geographically distributed multicluster systems and computational grids. We constructed the mathematical model for evaluation of the efficiency of the logical structures. We also designed efficient algorithm, which builds suboptimal graphs of computer systems' local structures. We give the results of full-scale experiments of scheduling of MPI-programs using common logical structures, which demonstrate the influence of the local neighborhood choice to the efficiency metrics. We also compare common structures with the structures, generated by means of designed algorithm. The results of numerical modeling show that the proposed algorithm significantly reduces the cost of job service.

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 call

Disclaimer: 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.