Node Selection in Grid Computing for Application Pattern
Youlin Ruan · Journal of Chinese Computer Systems · 2008
Grid computing provides tremendous computation and communication resources for tasks scheduling,meanwhile there raises the problem of Grid resources selection must be considered by scheduler.Traditional resources selection methods only care how to maximize computation and communication capacity of networks resources.However,the communication structure of the resources must match the communication pattern of the application is generally ignored by traditional scheduler.This paper presents an algorithm of communication pattern based node selection for Grid Computing,the algorithm is improved upon Remos project.A subgraph identification algorithm is used to decide the graph composed of the selected Grid nodes is match to the communication pattern of the application.After satisfies the communication pattern constraint,a Greedy Algorithm is used to select the optimization nodes.As special case of the general algorithm,two simplified algorithms based on Master-Slave and All-to-All application pattern respectively is introduced.The presented algorithms have been tested and compared with a random selection method in a simulation environment.The tests results show that the nodes set selected by the presented algorithms are not only satisfy the communication pattern requirement of the application but also have optimization computation and communication capacity.