Design of G-CODE algorithms and components

研究的目的是开发一个优化的网格计算开发环境（G-CODE）系统的网络感知调度所需的算法和协议。调度器可以使用发送端算法和历史经验来估计带宽。它将使用启发式技术，如遗传算法，以获得一个接近实时的接近最优的时间表。在九十年代初，使用自相似过程和长程相关的流量模型被使用。然而，在2000年进行的研究表明，流量遵循泊松分布。因此，我们提出了一种基于泊松分布的自诱导发送端算法。Meta调度器允许提前预留和基于工作流的任务调度。我们建议调查使用遗传算法的最低水平，它的使用可能取决于深度的并行应用程序。如果资源由动态图表示，如果每个节点由元组表示，并且如果应用由具有双权重的图表示，则在考虑通信延迟、延迟、先前预留和客户端能够建立的信任之后，优化过程将使应用的进程的需求与异构节点的计算能力相匹配。工作的新颖性：没有报告的调度程序与发送端带宽算法，并有能力处理工作流类型的作业，事先预订或通信延迟。调度算法变得太慢，甚至需要映射一千个进程。没有人试图在每个层面上持续评估信任因素。此外，我们的研究正在努力开发的算法和协议，这是在开放网格计算标准的移动目标。预期意义：如果我们要实现全球电网的愿景，这里提到的新方法值得探索，无限数量的无处不在的设备连接到它。

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.