MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface

Application development for distributed computing "Grids" can benefit from tools that variously hide or enable application-level management of critical aspects of the heterogeneous environment. As part of an investigation of these issues, we have developed MPICH-G2, a Grid-enabled implementation of the Message Passing Interface (MPI) that allows a user to run MPI programs across multiple computers, at the same or different sites, using the same commands that would be used on a parallel computer. This library extends the Argonne MPICH implementation of MPI to use services provided by the Globus Toolkit for authentication, authorization, resource allocation, executable staging, and I/O, as well as for process creation, monitoring, and control. Various performance-critical operations, including startup and collective operations, are configured to exploit network topology information. The library also exploits MPI constructs for performance management; for example, the MPI communicator construct is used for application-level discovery of, and adaptation to, both network topology and network quality-of-service mechanisms. We describe the MPICH-G2 design and implementation, present performance results, and review application experiences, including record-setting distributed simulations.Comment: 20 pages, 8 figure

Towards Deployments Contracts in Large Scale Clusters & Desktop Grids

While many dream and talk about Service Level Agreement (SLA) and Quality of Service (QoS) for Service Oriented Architectures (SOA), the practical reality of Grid computing is still far from providing effective techniques enabling such contractual agreements. Towards this goal, this paper provides an overview of the techniques offered by ProActive to set and use contractual agreements. Based on the identification of roles, application developer, infrastructure manager, application user, the actors of a Grid environment can specify what is required or what is provided at various levels. The results are both flexibility and adaptability, matching the application constraints and the environment characteristics with various techniques

Proposed Algorithm for Scheduling in Computational Grid using Backfilling and Optimization Techniques

In recent years, the fast evolution in the industry of computer hardware such as the processors, has led the application developers to design advanced software's that require massive computational power. Thus, grid computing has emerged in order to handle the computational power demands requested by the applications. Quality of service (QoS) in grid is highly required in order to provide a high service level to the users of Grid. Several interactions events are involved in determining the QoS level in grid such as; allocating the resources for the jobs, monitoring the performance of the selected resources and the computing capability of the available resources. To allocate the suitable resources for the incoming jobs, a scheduling algorithm has to manage this process. In this paper, we provide a critical review the recent mechanisms in “grid computing” environment. In addition, we propose a new scheduling algorithm to minimize the delay for the end user, Gap Filling policy will be applied to improve the performance of the priority algorithm. Then, an optimization algorithm will perform in order to further enhance the initial result for that obtained from backfilling mechanism. The main aim of the proposed scheduling mechanism is to improve the QoS for the end user in a real grid computing environment