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
Performance Estimation on Opportunistic Routing Protocol based on Reliability Analysis
This paper discuss various opportunistic routing algorithm which is based on broadcast nature of opportunistic network and also provide novel solution of routing which have less data loss. This research work proposed bro...
Energy Efficient Event Driven Data Reporting System for Wireless Sensor Network
Power conservation is important in sensor devices since battery life is usually one of the critical components in extending the life time of the sensor network. Cluster technology that enables a group of sensor working c...
Review on Binary Image Steganography and Watermarking
In this paper we have reviewed and analyzed different watermarking and steganography techniques. This is based on image processing in spatial and transform domain. We have reviewed different techniques like data hiding b...
Encryption using XOR based Extended Key for Information Security – A Novel Approach
The explosive growth of information, places a high demand for Information Security. Information Security deals with securing the information from unauthorized access or misuse of information either intentionally or accid...
Comparison of variable learning rate and Levenberg-Marquardt back-propagation training algorithms for detecting attacks in Intrusion Detection Systems
This paper investigates the use of variable learning rate back-propagation algorithm and Levenberg-Marquardt back-propagation algorithm in Intrusion detection system for detecting attacks. In the present study, these 2 n...