Level-Wise Scheduling Algorithm for Linearly Extensible Multiprocessor Systems

The valuable treating of parallelism on an interconnection network entails optimizing inconsistent performance indices, such as the reduction of communication and scheduling overheads and also uniform distribution of load among the nodes. In this kind of a system a number of nodes process the numerous jobs concurrently. A novel dynamic scheduling scheme that supports task unbiased structure approach is proposed for a particular class of multiprocessor networks known as linearly extensible multiprocessor networks. The significance of proposed scheduling scheme is remedying the communication overhead, delay in task execution and efficient processor utilization, which ultimately improves the total execution time. The proposed algorithm is implemented on a set of processors known as nodes which are linked through certain interconnection network. In particular, the performance is evaluated for linear type of multiprocessor architectures. In addition, a comparison is also made by implementing standard scheduling algorithm on same architectures with same number of nodes. The metrics used for comparison are Load Imbalance Factor (LIF), which represents the deviation of load among processors after achieving load balancing and execution time. The comparative simulation study shows that the proposed scheme gives better performance in terms of task scheduling and execution time when implemented on various linearly extensible multiprocessor networks.