Research ArticleOpen accessIn the keywordsA Great Deluge Algorithm with Bi-Decay Rate for Efficient Task Scheduling in Grid ComputingKaiLun Eng, Abdullah Muhammed, Sazlinah Hasan, Mohamad Afendee MohamedTo realise the utmost idea of global collaborative resource sharing with Grid computing, the fundamental scheduling process is playing a critical role. However, scheduling in Grid computing environment is a well-known NP-complete problem. In this study, we propose a new extension of Great Deluge algorithm with an effective diversification strategy for the Grid scheduling problem. The proposed approach, namely BiGD, … …Journal of Computer Science, Vol. 15, Issue 3 · 7 Mar 2019 · 7,720 accessesView PDFCite
Research ArticleOpen accessIn the abstractStatic Batch Mode Heuristic Algorithm for Mapping Independent Tasks in Computational GridR. Vijayalakshmi, V. VasudevanGrid computing plays an important role in solving large-scale computational problems in a high performance computing environment. Scheduling of tasks to efficient and best suitable resource is one of the most challenging phase in grid computing systems. Grid environment reveals several challenges in efficient scheduling of complex applications because of its heterogeneity, dynamic behavior and shared resources. Scheduling of independent … …Journal of Computer Science, Vol. 11, Issue 1 · 22 Sep 2014 · 7,429 accessesView PDFCite
Research ArticleOpen accessIn the abstractA NEW-THRESHOLD BASED JOB SCHEDULING FOR GRID SYSTEML. RamaparvathyIn heterogeneous distributed systems, utility grids have emerged as a new model of service. In this service, workflow scheduling is one of the challenging problems for satisfying user’s quality requirements. One of the main issues in work flow scheduling is to minimize the workflow execution cost in terms of time and makespan. In this study, we propose a new workflow … …Journal of Computer Science, Vol. 10, Issue 6 · 3 Feb 2014 · 6,785 accessesView PDFCite
Research ArticleOpen accessIn the abstractQUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULINGKrishnamoorthy Natarajan, Asokan Ramasamy, Sangeetha SubramanianThis study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time (throughput) and the resources use cost. The … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,554 accessesView PDFCite
Research ArticleOpen accessIn the abstractA SURVEY: PARTICLE SWARM OPTIMIZATION-BASED ALGORITHMS FOR GRID COMPUTING SCHEDULING SYSTEMSFaruku Umar Ambursa, Rohaya LatipBio-inspired heuristics have been promising in solving complex scheduling optimization problems. Several researches have been conducted to tackle the problems of task scheduling for the heterogeneous and dynamic grid systems using different bio-inspired mechanisms such as Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO). PSO has been proven to have a relatively more promissing performance in dealing … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 6,656 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Fault Tolerant Scheduling Approach for Computational GridP. Keerthika, N. KasthuriGrid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with less response time. There are various reasons such as … …American Journal of Applied Sciences, Vol. 9, Issue 12 · 5 Jan 2013 · 6,995 accessesView PDFCite
Research ArticleOpen accessIn the abstractNovel Adaptive Job Scheduling Algorithm on Heterogeneous Grid ResourcesG. K. Kamalam, V. Murali BhaskaranGrid provides an infrastructure for sharing geographically distributed heterogeneous resources to process many applications and mainly used for solving scientific problems that requires more computation time. Problem statement: Grid is a dynamic environment, where the resources may join or leave the environment at any time and the jobs also arrives at different intervals of time. To meet the demands and … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 6 Jul 2012 · 6,851 accessesView PDFCite
Research ArticleOpen accessIn the abstractExplicit Allocation Strategy with Deadline and Budget Constraint Algorithm in Bag of Tasks GridM. Suresh Kumar, T. PurusothamanProblem statement: This study is for effective scheduling of grid jobs based on economy for space shared resources in Bag of tasks grid. Grid Computing aims in combining the power of heterogeneous, geographically distributed, multi-domain computational resources to provide high performance or high throughput. Approach: Space shared resources are parallel supercomputers and clusters of workstations that provides a great amount … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jun 2012 · 6,229 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Optimal Load Sharing Technique For Grid ComputingD. Ramesh, A. KrishnanProblem statement: Grid and Cloud Computing is the fast growing industry, in which the grid computing shares the resources in the organization in an effective manner. Resource sharing requires more optimized algorithmic structure, otherwise the waiting time and response time are increased and the resource utilization is reduced. Approach: In order to avoid such reduction in the performances of the … …American Journal of Applied Sciences, Vol. 9, Issue 7 · 29 May 2012 · 6,965 accessesView PDFCite