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 114
- Downloads 0
Principles of Video Segmentation Scenarios
Video segmentation is the first step toward automatic video processing such as browsing, retrieval, and indexing. Many algorithms and techniques have been proposed a few years ago. They can cover the topic of video segme...
Structured System Test Suite Generation Process for Multi-Agent System
In recent years, Agent-Oriented Software Engineering (AOSE) methodologies are proposed to develop complex distributed systems based upon the agent paradigm. The implementation for such systems has usually the form of Mul...
Populating domain specific words from Academic web pages of Tamil Nadu Universities to build domain ontology for educational websites.
Machine translation from one natural language to the other is a challenging task. One of the methods of doing machine translation is using Interlingua based approach. In that approach the source language can be represent...
General Framework for Cluster based Active Learning Algorithm
This paper revisits the problem of active learning and decision making when the cost of labeling incurs cost and unlabeled data is available in abundance. In many real world applications large amounts of data are availab...
Multi Subgroup Data Compression Technique Using Switch Code
Data compression is the art of converting a data stream into a small in size data bits so that it can be easily travel a long istance without increasing load of its volume on a constant Bandwidth channel regardless of i...