ALGORITHM FOR CHOOSING LOCAL NEIGHBOURHOODS OF DECENTRALIZED SCHEDULERS IN GEOGRAPHICALLY DISTRIBUTED COMPUTER SYSTEMS
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 CS 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.
Authors: A. A. Paznikov, A. V. Tabakov, M. S. Kupriyanov, A. R. Liss
Direction: Informatics, Computer Technologies And Control
Keywords: Decentralized scheduling, multicluster systems, geographically distributed computer systems, Grid, local neighborhood, logical structure
View full article