A BSF‐EDZL scheduling algorithm for heterogeneous multiprocessors

Abstract

AbstractTo improve the performance of real‐time systems, heterogeneous asymmetric multiprocessors are proposed. Heterogeneous asymmetric multiprocessor architecture allows the system to better match computational resources to meet the needs and dynamic workload of each application. The benefits of system performance and reduced power consumption cannot be fully exploited unless proper task scheduling and task allocation methods are implemented at the operating system level.The EDZL scheduling algorithm has been shown to be a better scheduling algorithm in heterogeneous multiprocessor platforms. In this paper, the BSF‐EDZL (best speed fit for earliest deadline first until zero‐laxity) performance asymmetric multiprocessor scheduling algorithm is proposed, and an effective schedulability analysis is performed. The algorithm selects an appropriate processor for non‐zero relaxation highest priority task rather than the fastest processor when assigning tasks. Experimental results show that the proposed BSF‐EDZL scheduling algorithm can schedule a larger set of tasks than the ordinary EDZL scheduling algorithm.