Home Strategy Activities Grants Publications People Sponsors Blog Contact Us 


A. Fuentes, E. Huedo, R.S. Montero, I.M. Llorente. A Grid Scheduling Algorithm Considering Dynamic Interconnecting Network Quality. In 3rd Cracow Grid Workshop, Pages 151-158, 2004.


Download paper: Follow the link

Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


For certain application domains the traditional concept of computing based on a homogeneous, and centrally managed environment is being displaced by Grid computing, based on the exchange of information and the sharing of distributed resources by applications. The Globus toolkit has become a de facto standard in Grid computing. Globus is a core Grid middleware that supports the submission of applications to remote hosts by providing resource discovery, monitoring, resource allocation and job control service. However, application execution on Grids continues requiring a high level of expertise due to its complex nature. The user is responsible for manually performing all the job submission stages in order to achieve any functionality, namely: system selection and preparation, submission, monitoring, migration and termination. Moreover, computational Grids are dynamic environments, characterized by highly variable conditions: high failure rate, and resource availability, performance and cost. Therefore, adaptation to changing conditions is needed to achieve a reasonable degree of both application performance and fault tolerance. In the present work, job adaptation is achieved by implementing automatic application migration following performance degradation, better resource discovery, requirement change, owner decisions or remote resource failure. The most important step in job scheduling is resource selection, which in turn relies completely in the information gathered from the grid. Resource selection usually takes into account the performance offered by the available resources, but it should also consider the quality of the interconnecting network in terms of latency and bandwidth between the Grid resources. For example, the bandwidth is very important because the size of the files involved in some applications domains, like Particle Physics or Bioinformatics, is very large. This fact is specially relevant in the case of adaptive job execution, since job migration requires the transfer of large restart files between the compute hosts. Therefore the quality of the interconnection network has a decisive impact on the overhead induced by the job migration. In this work, we present a new job scheduling algorithm that takes into account the interconnecting network quality, dynamically evaluating decisive communication parameters. Our scheduler gathers dynamic information of remote resources and the network (bandwidth, latency,.. ) in order to choose the better available resource for job submission. The final contribution will include experimental results of the scheduling


[ Tic2003-01321 ] [ Inta ]


Eduardo Huedo
Ruben S. Montero
Ignacio M. Llorente

BibTex Reference

   Author = {Fuentes, A. and Huedo, E. and Montero, R.S. and Llorente, I.M.},
   Title = {A Grid Scheduling Algorithm Considering Dynamic Interconnecting Network Quality},
   BookTitle = {3rd Cracow Grid Workshop},
   Pages = {151--158},
   Publisher = {Academic Computer Centre CYFRONET AGH},
   Year = {2004}

Admin · Log In