BEYOND SIMULATED ANNEALING IN GRID SCHEDULING
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 3
Abstract
In Grid Environment the number of resources and tasks to be scheduled is usually variable and dynamic in nature. This characteristic emphasizes the scheduling approach as a complex optimization problem. Scheduling is a key issue which must be solved in grid computing study and a better scheduling scheme can greatly improve the efficiency.The objective of this paper is to explore and investigate Simulated Annealing with limited iterations to promote compute intensive grid applications to maximize the Job Completion Ratio based on the comprehensive understanding of the challenges and the state of the art of current research. Experimental results demonstrate the effectiveness and robustness of the proposed algorithm. Further the comparative evaluation with other scheduling algorithms such as First Come First Serve (FCFS), Earliest Deadline First (EDF) is plotted.
Authors and Affiliations
R. Joshua Samuel Raj , Dr. V. Vasudevan
Keywords
Related Articles
- EP ID EP129479
- DOI -
- Views 118
- Downloads 0
A Effective and Complete Preprocessing for Web Usage Mining
Now, peoples are interested in analyzing log files which can offer valuable insight into web site usage. The log files hows actual usage of web site under all circumstances and don’t need to conduct external experimenta...
Text Analytics to Data Warehousing
Information hidden or stored in unstructured data can play a critical role in making decisions, understanding and conducting other business functions. Integrating data stored in both structured and unstructured formats c...
Study of Data Mining Approach for Mobile Computing Environment
Efficient Data mining Techniques are required to discover useful Information andknowledge. This is due to the effective involvement of computers and the improvement inDatabase Technology which has provided large Data. Th...
Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
In this paper, we proposed the fuzzy multi-job and multi-company workers assignment problem with penalty. Our purpose is obtaining the optimal solution the assignment problem, where n jobs are assigned to m workers (m>...
Performance Evaluation and Comparison of AODV and AOMDV
A Mobile Ad-hoc Network (MANET) is a dynamic wireless network that can be formed without the need for any pre-existing infrastructure in which each node can act as a router. One of the main challenges of MANET is the des...