A Performance Study of GA and LSH in Multiprocessor Job Scheduling

Computer Science – Performance

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

International Journal of Computer Science Issues, IJCSI, Vol. 7, Issue 1, No. 1, January 2010, http://ijcsi.org/articles/A-P

Scientific paper

Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Both algorithms are naturally parallelizable but have heavy data dependencies. Based on experimental results, this paper presents a detailed analysis of the scalability, advantages and disadvantages of each algorithm. Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uni-processor system would not be sufficient enough to execute all the tasks. The high performance and reliability of multiprocessors have made them a powerful computing resource. Such computing environment requires an efficient algorithm to determine when and on which processor a given task should execute. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. This scheduling problem is known to be NP- Hard. In multiprocessor scheduling problem, a given program is to be scheduled in a given multiprocessor system such that the program's execution time is minimized. The last job must be completed as early as possible. Genetic algorithm (GA) is one of the widely used techniques for constrained optimization.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Performance Study of GA and LSH in Multiprocessor Job Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Performance Study of GA and LSH in Multiprocessor Job Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Performance Study of GA and LSH in Multiprocessor Job Scheduling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-535126

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.