Research paper proposal on topics : 1. Min-Min Max-Min Selective Algorithm 2. Dynamic Load Balancing Algorithm 3. Fair Scheduling Algorithm

Group Members

Nishant Khandelwal (09CO62) Rahul Anand (09CO72)

PROPOSAL: We would like to implement the min-min and max-min algorithm using appropriate data structures in C. so we will select Min-Min to assign the next task or else max-min. Iran and Prof.Min-Min Max-Min Selective Algorithm STUDY : The increase in supercomputer costs in one hand and the need for large-scale computational resources on the other hand. capability. In the second phase. Max-Min: Max-Min is very similar to Min-Min. performance. Naghibzadeh Dept.2007 . Phase one is resource discovery . Scheduling on a grid has three main phases . the set of minimum expected completion time for each task in MT is found. To make use of tremendous capabilities of the distributed system. If lies in between then if sd is less than a certain threshold. REFERENCES: A Min-Min Max-Min Selective Algorihtm for Grid Task Scheduling by Kobra Etminani Dept. MET(Minimum Execution Time) : MET assigns each task to the resource that performs it in the least amount of execution time. which generates a list of potential resources. Task scheduling algorithms are used to improve the grid performance by minimizing the scheduling length. cost and users quality of service requirements. These sets are mapped at before scheduled times called mapping events. a task is mapped to a machine as soon as it arrives at the scheduler. Phase two involves gathering information about those resources and choosing the best set to match the application requirements. ANALYSIS : Many algorithm were proposed to obtain semi-optimal match which were categorised into two mode. In the first phase. the task with the overall minimum expected completion time from MT is chosen and assigned to required resource. Iran . M. no matter whether this resource is available or not. of Computer Engineering Ferdowsi University of Mashad Mashad. Then this task is removed from MT and the process is repeated until all tasks in the MT are mapped. has led to the possibility of using network of computational resources to solve large-scale problems which emerge to a method called GRID. In this algorithm expected completion time of each task is calculated and the two consecutive task time is checked with the standard deviation of overall task time. selection and aggregation of geographically distributed autonomous and heterogeneous resources dynamically at runtime depending on their availability. If it lies in the first half of list then long task is more in number so min-min is chosen or else it means short task is more so max-min algorithm is choosen. Max-Min assigns task with maximum expected completion time to the corresponding resource. Task scheduling in grid is one of the most important technologies in grid system. Min-Min: Min-Min begins with the set MT of all unassigned tasks with two phases. In phase three the job is executed. in phase 2. of Computer Engineering Ferdowsi University of Mashad Mashad. MCT(Minimum Completion Time) : MCT assigns each task to the resource which obtains earliest completion time for that task. it means the length of all tasks are in a small range. which is used to schedule a task on an appropriate grid node. Firstly on-line mode. effective and efficient scheduling algorithms are needed. Secondly batch mode in which task are collected into a set called meta-task (MT). Grid is a type of parallel and distributed system that enables the sharing. except in phase 2.

Centralized Approach: Sometimes a light node may not be available in the current cluster and due to high congestion a far away cluster might be not reachable. Parveen Jain.2006 Department of Computer Science and Engineering. network bandwidth etc. ANALYSIS: The basic idea behind this algorithm is passing of message from one node to the adjacent node which suggest the action to be taken. called supporting nodes(SN) are used. Daya Gupta.static and dynamic.communication mode should be duplex . These algorithms come into two basic categories . Gurvinder Singh2. Load on a particular node depends on the number of processes. Processes are migrated from heavily loaded node to light weighted node. Guru Nanak Dev University. Modified Approach: Instead of keeping a single centralised node many smaller nodes. May 2009. 2. Proposal: We would like to implement the modified approach algorithm using appropriate data structures in C. Such imbalances in system load suggest that performance can be improved by either transferring jobs from the currently heavily loaded processors to the lightly loaded ones or distributing load evenly or fairly among the processors. To improve performance. In a multi-processor system the probability of one of the processor being idle while other processor has multiple jobs queued up can be very high. So to avoid this every cluster has a centralized node which is very lightly loaded and can be loaded of any overloaded node.evry node has same software and hardware configuration. Primary Approach: Initially processes are stored in queue and are allotted one by one to primary nodes. Reference: 1) Qualitative Parametric Comparison of Load Balancing Algorithms in Distributed Computing Environment #Amit Chhabra1. The characteristics that the multiprocessor should have are like 1. . Here nodes are grouped into clusters and checked within its own cluster if a light weighted node is found or else next cluster is searched and after getting a light weighted node transfer takes place as per mesage.Dynamic Load Balancing Algorithm STUDY : A phenomenon often appears in the multiprocessor system is that the load is unbalanced. These nodes are given some load initially to exploit their power or else it will be a resource waste. Process migration is greatly affected by the network bandwidth and work load. proper load balancing algorithms are required that can make all the difference between modest performance gains and maximum performance gains. While static load balancing algorithms (SLB) take decisions regarding assignment of tasks to processors based on the average estimated values of process execution times and communication delays at compile time while Dynamic load balancing algorithms (DLB) are adaptive to changing situations and take decisions at run time. every node never sent a wrong information.. Amritsar 2) An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service. Thus to ensure this centralized node has better structure compare to other node present in cluster. When anyoverloaded node requests a lightly loaded SN a comparison between the requesting process and the current process being executed at the SN is done and work is done accordingly. 3. overall configuration of the node.

the schedulers order the task in the queue. Later to determine as to which job will be given the next time quantum depends on the error value if the error is positive then it has been given enough of resources so it is moved to the end of the queue. The error values of the first job and the second job in the queue are compared and the job that has a lower error value gets the resource for the next time quantum. The process of scheduling is divided into two steps firstly. KASMIR RAJA Dean Research. School of Computing Sciences. and. A queue is created for each node and the tasks are placed in the queue for execution . in some cases. Chennai.3. In this real world it is impossible to be proportional fair at all interval thus service time error is calculated where negative value indicates that a task have received less than what it deserves and a zero value indicates that it has received its ideal share. V. high-performance orientation. VIT University. innovative applications.the resource should be allocated inorder of increasing demand. PROPOSAL: We would like to implement the service time error algorithm using appropriate data structures in C. the scheduler runs the first task in the queue for its time quantum. This paper proposes a fair scheduling algorithm based on the service time error. This process repeats until there are no more jobs in the queue for that requesting task gets a share of resource larger than its demand. The basic idea of this paper is to develop a good scheduling algorithm that can perform effectively and efficiently in terms of minimizing the error to achieve fairness and reduce the cost and time. distinguished from conventional distributed computing by its focus on large-scale resource sharing. Tasks with a higher demand are favored against the remaining tasks in the case of other existing algorithms which means that such tasks are given a higher priority than the others which leads to starvation that increases the completion time of tasks and no fairness is guaranteed. . where user requirements and job characteristics must be also considered. These issues are checked in the algorithm which alllocate resources fairly to all tasks based on the error. India 603203. Kattankulathur. Firstly here definition of fairness are like 1. Vellore. When the processor are free the first task in the queue is assigned to processor for particular time quantum.Fair Scheduling Algorithm STUDY : Grid computing has emerged as an important new field. SRM University. The demand for scheduling is to achieve high performance computing. An efficient use of distributed resources is highly dependent on the resource allocation by grid schedulers. ANALYSIS : Main objective of this algorithm would be to improve the fairness and decrease the total completion time by minimizing the service time error.requesting task with unsatisfied demand get equal share of resources. REFERENCES: A DYNAMIC ERROR BASED FAIR SCHEDULING ALGORITHM FOR A COMPUTATIONAL GRID. 2. India 632006 2 S. secondly. The main objective of the algorithm is to minimize the error and reduce the completion time of the tasks.2006 1 DAPHNE LOPEZ.assigned a weight depending on various factors depending on the infrastructure.