Task Partitioning Hybrid Algorithms for Multi-Core Processors

Abstract

Multi-core Processors Rapidly developing in the world we live in and Companies Manufacturers continuous efforts to manufacture faster and intelligent chips. The use of multi-core processors has become widespread in many areas; therefore, task Partitioning for multi-core processors has become a hot issue in the research community. Many types of research have been done on task Partitioning and Task Mapping from various perspectives by researchers. The existing partitioning task algorithms still have negatives, such as low usage of the processor or not making the most of the cores efficiency on the processor. However, partitioning tasks onto processors is a significant challenge among the challenges facing the multi-core processor. In this paper, to solve this challenge we proposed developing the framework that uses hybrid partitioning algorithms to mix the Blocking-Aware Algorithm with First-Fit Decreasing (FFD) algorithm, based on each of these algorithms advantages.