Scheduling Using Multi Objective Genetic Algorithm
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2015, Vol 17, Issue 3
Abstract
Abstract : Multiprocessor task scheduling is considered to be the most important and very difficult issue. Taskscheduling is performed to match the resource requirement of the job with the available resources resulting ineffective utilization of multiprocessor systems. In this paper, a Multi Objective Genetic algorithm (MOGA) isproposed for static, non- pre-emptive scheduling problem in homogeneous fully connected multiprocessorsystems with the objective of minimizing the job completion time. The proposed GA is used to determine suitablepriorities that lead to a sub-optimal solution. Our proposed GA for a given job scheduling problem proves thatGA results in better sub-optimal solutions
Authors and Affiliations
Anu Dogra , Kritika Dhiman
Keywords
Related Articles
- EP ID EP137646
- DOI -
- Views 91
- Downloads 0
A Comprehensive Study On Handwritten Character RecognitionSystem
Abstract: Nowadays handwritten character recognition is still remain an open problem because of thevariability in writing style. Conversion of handwritten characters is important for making manuscripts intomachine...
Handoff Management protocols MIPV6 and HMIPV6 Comparative analysis in 4G wireless networks
With the increasing demands for new data and real-time services, wireless networks should support calls with different traffic characteristics and different Quality of Service (QoS) guarantees. Instead of  ...
Study of Simulation for Data Webhousing System by ChallengingTechnology and Performing Tuning Techniques
Abstract: One of the most widely discussedtechnologiesare theInternet and itsassociated environmenttheWorldWide Web.Web technologyhasa broad popular supportamong entrepreneursand technicians likewise.The web environment...
A Parameter free Clustering of Density Based Algortihm
Clustering is a kind of unsupervised learning process in data mining and pattern recognition, most of the clustering algorithms are sensitive to their input parameters. So it is necessary to evaluate results of the clust...
Semi-Supervised Discriminant Analysis Based On Data Structure
Abstract: Dimensionality reduction is a key data-analytic technique for mining high-dimensional data. In thispaper, we consider a general problem of learning from pairwise constraints in the form of must-link and cannotl...