Design of G-CODE algorithms and components

点击翻译按钮获取中文摘要

The research aims at developing algorithms and protocols required for an optimized network- aware scheduler for the Grid Computing Development Environment (G-CODE) system. The scheduler may use sender-side algorithm and historical experience to estimate bandwidth. It would use heuristic techniques like genetic algorithm to obtain a near-optimal schedule in near-real time. In early nineties, the traffic models using self-similar processes and long range dependencies were used. However the studies conducted in 2000 have shown that traffic follows Poisson distribution. We, therefore, propose to investigate a self-induced sender-side algorithm based on Poisson distribution. The Meta scheduler is to permit advance reservations and work-flow based task scheduling. We propose to investigate the use of genetic algorithm up to the lowest level, where its use may depend upon the depth of parallelism of the application. If the resources are represented by a dynamic graph, if each node is represented by a tuple and if applications are represented by graphs with dual weights, optimization process will match the requirements of the processes of an application with the compute-powers of  the heterogeneous nodes, after considering the  communication delays, latencies, prior reservations and the trust that the client is able to build. NOVELTIES OF THE WORK: There is no reported scheduler with sender-end bandwidth algorithm and with the ability to handle workflow type of jobs, prior reservations or communication delays. The scheduler algorithms become too slow, when even a thousand processes are required to be mapped. None of them tries to continuously evaluate trust factor at every level. Moreover our research is trying to develop algorithms and protocols, which are in alignment with the moving target of open Grid Computing standards. EXPECTED SIGNIFICANCE: The new approaches mentioned here are worth exploring if we are to progress towards the vision of a global grid, with unlimited number of ubiquitous devices connected to it.