Performance Analysis of List Scheduling on Homogeneous Multiprocessors System
نویسندگان
چکیده
Nowadays multiprocessor system has received a lot of attention because of its efficiency and reliability, which play an important role in success of multiprocessor systems. Hence, there is a necessity for developing efficient scheduling algorithms. Therefore, various researches have been done in different areas of scheduling of multiprocessor system. This paper evaluates the performance of homogeneous multiprocessor system on the basis of Throughput. General Terms List heuristic scheduling
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملA Performance Study of GA and LSH in Multiprocessor Job Scheduling
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. Mu...
متن کاملScheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme
We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with noncontiguous processor allocation. The algorithm is called LLHm (Level-by-level and List scheduling using the Harmonic system partitioning scheme), where m ≥ 1 is a positive integer, which is a parameter for the harmonic system partitioning scheme. Three basic techniques are employed in algorit...
متن کاملA Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Abstract Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is an NP-hard problem, no exact tractable algorithm exists, and no baseline is available from which to compare the resulting schedules. This paper is an attempt to quantify the differences in a few of the heuristi...
متن کامل