Minimal Task Allocation in Multiprocessors using improved next-fit for RM scheduling

Abstract

processor allocation in multiprocessors can be accomplished efficiently for reducing the required number of processors for the given task set, accounting reduced power consumption with maximum processor utilization. This work is based on next fit algorithm using Rate Monotonic Algorithm (RMA) for a fixed priority system. The work proposes a minimal task allocation algorithm for multiprocessor environment. The proposed method reduces the number of processors required for a given task set using improved next fit algorithm and the same has been evaluated and tested. The proposed algorithm gives better results when there is large number of tasks in the system.