Proc. of the Intl. Conf. on Future Engg. Trends (ICFET 2K10),SSE, Saveetha University, India.

RESOURCE BASED SCHEDULING APPROACH FOR GRID ENVIRONMENT

M.Prakash1,T.Ravichandran2
AbstractGrid computing can integrate computational resources from different networks or regional area into a high performance computational platform and be used to solve complex computing-intensive problems efficiently. Grid scheduling is an important issue in a grid computing environment because of heterogeneity of computing resources. Scheduler is an important component for selecting and allocation of grid resources to the current and future applications. This paper proposes to a resource evaluation scheduling algorithm in grid environment where the scheduler dispatches the job to the available resources based upon the rank. The rank for the resource is calculated as soon as either on completion of its scheduled current task or the availability of the resource is exists. In this proposed algorithm which will maximize the throughput.

Index

TermsGrid Computing, Scheduling Heterogeneous computing, Resource policy.

algorithm,

I. INTRODUCTION

rid enables the sharing and selection of a wide resources that includes data sources, storage systems, specialized devices and supercomputers that are geographically distributed and owned by different organizations for solving large-scale computational and data intensive problems in science, engineering and commerce. The concept of Grid started as a project to link geographically dispersed supercomputers, but now it has grown far beyond its original intent. The Grid infrastructure can benefit many applications, including collaborative engineering, data exploration, high-throughput computing and distributed supercomputing. A computational grid that provides consistent, dependable, pervasive and inexpensive access to high-end computational capabilities [5]. Grid computing environment must be able to manage all type of data including data location, data transfer, data access and security. Grid can provide different services from the endusers. The different types of services are Computational service, Data service, Application service, Information service and Knowledge service. The users interact with the Grid resource broker or Scheduler to solve a problem which in turn
1. M.Prakash working in Rajalakshmi Engineering College, Chennai as Assistant Professor. Contact: 9840604086. (e-mail: salemprakash@yahoo.com)

performs resource discovery, scheduling, monitoring and the processing of application jobs on the distributed Grid resources. Scheduling is the key problem which is to minimize the completion time of a given task to the processor properly. The scheduling scheme is formally classified into two categories; they are Static Scheduling and Dynamic Scheduling [6]. In static scheduling before execution of a program, the following details like task processing time, communication and data dependencies are well known whereas in dynamic scheduling the goal not only includes the minimization of the program completeness but also to reduce the running cost paid to the schedulers. In the dynamic environment of grid system any events such as breakdown of computes, arrival of new jobs, processing time of job etc., that may occur in short span of time. Due to the above events, its very difficult to predict and execute the job in advance. These real-time event will interrupt the system performance, so that the result of schedule may be either feasible or near optimal. The rest of this paper is organized as follows. In section II, the related previous work and our new approach is presented. Section III, deals with the grid architecture for efficient resource evaluation. Section IV describes about the problem description in resource evaluation. Section V briefly describes about resource evaluation algorithm and finally this paper has conclusion and future work in section VI.

II. RELATED PREVIOUS WORK AND OUR NEW APPROACH We first review the related work on dynamic task scheduling in the computational Grid. Then, we introduce our unique approach to the scheduled job in grid and complete the task efficiently and effectively in a short span time.

2.1.Related Previous Work

In the past decades, many researches have proposed scheduling algorithms for parallel systems [1]. However, the problem is more complex and still continues in grid scheduling. Young Choon Lee and Albert Y.Zomaya [2] proposed a Duplication-based State transition method for task scheduling. Scheduling is done by overlapping a next state with randomly generate state by current state. However it is still more complex by removing ineffectual task. Opportunistic Load Balancing (OLB) [3] is one of the techniques where each job finds the next or near available

2. Dr. T.Ravichandaran, Principal in Hindustan Institute of Technology, Coimbatore.

296

Proc. of the Intl. Conf. on Future Engg. Trends (ICFET 2K10),SSE, Saveetha University, India.
machine and programmes the scheduled job. It uses the resource in a balanced manner but the expected time is not taken into the account, so its result becomes poor. The ultimate aim is not only to find the optimal resources on the grid computing but also to improve the performance of the system. In the present decade may researchers have worked more and more on the job scheduling in gird computing. Some of the heuristic algorithms [4] developed are min-min, max-min, FCFS and so on. Many researchers are trying to find out solutions to schedule the job in an effective manner. But the problems still persists. Normally the scheduling for a job is done based upon the size of the job, available resources etc., if the size of the job is larger and the availability of the resource is low then the expected completion time will be more. To avoid these types of problem, we have introduced a new approach for scheduling the jobs. 2.2. Our New Approach In grid environment scheduling, a job is one of the important key issues. If the user submits a job to the grid scheduler i.e., Resource Finder, then the Resource Finder is responsible to send the job to the available resource where the completion time is minimal. The minimum completion time of the job will be predicted by the Resource Finder by using a technique Resource Evaluation. The Resource Evaluation algorithm finds the rank for each and every available node in the grid sites. So, depending upon the job size, the rank (can be found by using the service provided by the resources and its availability) is matched and the job is submitted to the node to complete the work. By using this matchmaking technique, the waiting time of the job can be eliminated because we are dispatching the job to the resources where the service is available and which resource can complete the job in minimum duration. III. GRID ARCHITECTURE FOR EFFICIENT REOURCE
EVALUATION

The dispatcher dispatches the job where for a particular job that matches the availability of resources and services, which has the highest rank. Service Finder is an intermediary for grid site and user. If any one of the node is joining or leaving, then the gird sites and service provided by each and every nodes will be found only by the Service Finder. The information collected by the Service Finder will be updated in the GRB for the future references. Monitoring service, monitors the entire unit i.e., the job is properly submitted to the resources and on completion of the job, it again sends back to the user. In case of occurrence of any fault before completion of the accomplished job, the availability of the resources is properly updated in the GRB. The RF calculates the rank and updates properly in the GRB and the job dispatched to the resources and got updated in the GRB. The joined or leaving nodes with its service by Service Finder all those information will be monitored by the monitoring services.

IV. PROBLEM DESCRIPTION In this study, Resource Finder will not have any control over the submitted jobs or on the available resources in the various Grid sites as any number of resources can join or leave at any time. Normally, if any, one of the jobs is to be scheduled, the RF dispatches the job to the available resources to execute. Depending upon the resources available in the grid site, the time taken to execute each and every job differs. So there may be a number of chances for varying the actual execution time, if compared with the expected execution time. The aim of the grid scheduler is to allocate the job to the available resources using matchmaking. The best matchmaking can be done by Resource Finder, which holds the list of available jobs as well as list of available resources in each grid sites. The lists of resources are arranged based upon the rank. So that, depends upon the job the resources in the grid site will be matched easily (highest rank will be always on the top). The rank [8] is calculated by using Resource Estimator. The resource estimator finds the rank based on the availability of the resources given by Service Finder. Each grid site consists of a local scheduler [6], which is responsible to submit the job to the corresponding node to finish the work and used to collect the information about the resources available in each nodes. The availability of each and every grid site is send to the Service Finder through the local scheduler. Before sending these information to the scheduler the resource estimation finds the rank by the resource CPU speed and Free Memory space available. Rank = CPU_Speed_MHz * 2 + Free_Memory_Space_MB [7] The rank can be assigned to each and every nodes available in the grid site. If a job has to be submitted, based upon the resource policy match can be done easily and the job can be executed effectively.

The grid environment consists of n-number of nodes. Each and every node has several computational resources. The grid resources may be homogenous or heterogeneous. The nodes in the grid sites that can join or leave at anytime. The availability of the resources will be dynamically updated by the Service Finder and it will be updated in Grid Resource Base (GRB) as shown in fig 1. The user submits the job to the grid site through Resource Finder (RF) to complete the work. The Resource Finder is responsible to find out the best available resource in grid site. The best resources can be identified the following: 1. Resource Estimator (RE): Finds the resource availability and services provided by each and every alive nodes. This information will be updated by the Service Finder in GRB. 2. Instant Ranker (IR): After the estimation by Resource Estimator, a rank will be assigned to the availability of resources and services.

297

Proc. of the Intl. Conf. on Future Engg. Trends (ICFET 2K10),SSE, Saveetha University, India.

Fig 1: Efficient resource evaluation architecture

4. 5.

V. ALGORITHM FOR RESOURCE EVALUATION 1. Service Finder finds the following a. Newly joined nodes in grid (or) the given task to the nodes are completed. b. If any one in step 1 (a) is found then i. the availability of the resources is collected and update in Grid Resource Base ii. Service provided by the node also collected and update in Grid Resource Base. User submits the job to the resources through resource finder Resource Finder matches the job with the availability of resources by the following a. Availability of the resources found in the Grid Resource Base is collected by the Resource Estimator and calculate Rank=(2*CPU_Speed_MHz)+ Free_Memory_MB b. Resultant of Resource Estimator and Service availability the Instant Ranker assigns the Rank for the nodes in the grid environment

6.

According to the users criteria job matches with the Resource Finder and its dispatched to the resources. Monitoring service monitors the following a. Job is submitted to the resources b. Whether the resource completes the work and sends back to the user. c. Matching done by the Resource Finder is correct. If the job is completed then it delivers back to the user and go to Step 1.

VI. CONCLUSION AND FUTURE WORK Grid computing is becoming a new computing infrastructure for scientific and cooperation. Resource scheduling plays an important role in grid. We have presented the Resource Evaluation algorithm for resource scheduling based upon rank. The availability of the resource in each grid site is calculated by the resource estimator and rank is assigned. With this approach the waiting time of the job can be reduced and the throughput can be maximized. The future work will focus on extension of the resource evaluation using priority, during fault tolerant. Moreover, the plan is to implement and evaluate the different cost measures like make-span time and grid efficiency.

2. 3.

298

Proc. of the Intl. Conf. on Future Engg. Trends (ICFET 2K10),SSE, Saveetha University, India.
REFERENCES
[1]

J.Krallmann, U.Schwiegelshohn and R.Yahyapour, On the desing and evaluation of Job Scheduling Algorithms, in 5th workshop on Job Scheduling strategies for parallel processing, volume LNCS 1659, pp 17-42, 1999
Young Choon Lee and Albert Y.Zomaya, A Novel State Transition method for Metahuristic-Based Scheduling in Heterogeneous Computing Systems, IEEE Transaction on Parallel and Distribued Systems, Vol 19 No 19, pp 1215-1223, Sep 2008. Stefka Fidanova & Mariya Durchova, Ant Algorithm for gird Scheduling Problem, Large scale computing, Lecture notes in Computer Science No 3743, Springer, Germany, pp 405-412, 2006 T.D.Braun, H.J.Siegel, N. Beck, L.L.Boloni, M.Maheswaran, A.L. Reuther, J.P.Robertson, M.D.Theys, B.Yao, D.Hensgen and R.F.Freud, A Comparision of Eleven Static Heruistic For Mapping Access of Independent Task Onto Hetergenous Distributed Computing System, Journal of Parallel and Distributed Computing. Vol 61(6), pp 610837,2001. Stefka Fidanova & Mariya Durchova, Ant Algorithm for gird Scheduling Problem, Large scale computing, Lecture notes in Computer Science No 3743, Springer, Germany, pp 405-412, 2006 Cowling, P. I. and Johansson, M. (2002) Using real time information for effectivedynamic scheduling, European Journal of Operational Research, 139 (2), 230-244.

[2]

[3]

[4]

[5]

[6]

http://www.gridway.org/doku.php?id=documentation: release_5.6:ug [8] http://www.sura.org/programs/docs/ Grid WayTutorial.pdf

[7]

M.Prakash is presently a PhD candidate at Faculty of Computer Science Engineering in Jawaharalal Nehru Technological University Hyderabad, Andhra Pradesh, India. He received the B,E degree from University of Madras in 2001 and M.E degree from Sathyabama University 2007, he is an Assistant Professor in Rajalakshmi Engineering College, Thandalam, Channai, India. His research interests include Grid Computing and networks. He has presented papers in International and National Conferences. He is a member in ISTE.

Professor Dr.T.Ravichandran received the B.E degrees from Bharathiar University, Tamilnadu, India and M.E degrees from Madurai Kamaraj University, Tamilnadu, India in 1994 and 1997, respectively, and PhD degree from the Periyar University, Salem, India, in 2007. He is currently the Principal of Hindustan Institute of Technology, Coimbatore, Tamilnadu, India. Before joining Hindustan Institute of Technology, Professor Ravichandran has been a Professor and Vice Principal in Vellalar College of Engineering & Technology, Erode, Tamilnadu, India. His research interests include theory and practical issues of building distributed systems, Internet computing and security, mobile computing, performance evaluation, and fault tolerant computing. Professor Ravichandran is a member of the IEEE, CSI and ISTE.

299