| Type of Material: | Thesis |
| Title: | AN EFFICIENT LOAD BALANCING APPROACH FOR MAX MIN FAIR SCHEDULING OPTIMIZATION IN GRID WORKFLOW ENVIRONMENT |
| Researcher: | R. GOGULAN |
| Guide: | N. Jayaprakash Ph.D., |
| Department: | Department of Computer Application |
| Publisher: | Bharath University, Chennai |
| Place: | Chennai |
| Year: | 2013 |
| Language: | English |
| Subject: | Grid computing | Cluster Computing | Mobile computing Distributed computing | Evolutionary computation | Peer-to-Peer Computing | Parallel computing | Soft computing | Virtual Network Computing | SERVER FARM | Computer Science and Applications | Engineering and Technology |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 454440 | |
| 003 | IN-AhILN | |
| 005 | 2024-09-11 17:25:30 | |
| 008 | __ | 240911t2013||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_454440 |
| 040 | __ | |aBHAU_600073|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aR. GOGULAN|eResearcher |
| 110 | __ | |aDepartment of Computer Application|bBharath University, Chennai|dChennai|ein |
| 245 | __ | |aAN EFFICIENT LOAD BALANCING APPROACH FOR MAX MIN FAIR SCHEDULING OPTIMIZATION IN GRID WORKFLOW ENVIRONMENT |
| 260 | __ | |aChennai|bBharath University, Chennai|c2013 |
| 300 | __ | |dDVD |
| 502 | __ | |bPhD |
| 518 | __ | |d2008-12-04|oDate of Registration |
| 520 | __ | |aA grid is a collection of computing resources that perform tasks. Grid computing is applying the resources of many computers in a network to a single problem. The distributed resources are useful only if the Grid resources are scheduled. The demand for scheduling is to achieve high performance computing. It is difficult to find an optimal resource allocation for specific job that minimizes the schedule length of jobs. It aims to find a suitable allocation of resources for each job. A typical problem which arises during this task is the decision of scheduling. It is about an effective utilization of processor to minimize tardiness time of a job, when it is being scheduled. This research addresses the problem by developing a general framework for grid scheduling using fair scheduling algorithm to improve the decision of scheduling. Most of the scheduling algorithms concentrate on reduction in the overall make span and not the fair scheduling of the tasks to the resources. This research shows the importance |
| 650 | __ | |aComputer Science and Applications|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aGrid computing |
| 653 | __ | |aCluster Computing |
| 653 | __ | |aMobile computing Distributed computing |
| 653 | __ | |aEvolutionary computation |
| 653 | __ | |aPeer-to-Peer Computing |
| 653 | __ | |aParallel computing |
| 653 | __ | |aSoft computing |
| 653 | __ | |aVirtual Network Computing |
| 653 | __ | |aSERVER FARM |
| 700 | __ | |eGuide|aN. Jayaprakash Ph.D., |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/170859|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.