Abstract: The increasing complexity of multi-core multiprocessor systems presents significant challenges in task scheduling. The scheduling of tasks across multiple cores remains a significant challenge due to its NP-complete nature, especially with the in-creasing complexity of multi-core / multi-processors architectures. This paper focuses on Multi-Core Oriented (MCO) scheduling algorithms, which specifically target multi-core multi-processor systems. This paper proposes a novel scheduling algorithm, Core Scheduler Task Duplication (CSD), specifically designed for multi-core multi-processors environment. The CSD algorithm combines static and dynamic task prioritization to enhance processor utilization and performance. The proposed algorithm clusters related tasks to the same cores to improve efficiency and reduce execution time. By leveraging task duplication, the proposed algorithm improves processor utilization and reduces task waiting times. To evaluate the CSD algorithm’s performance, the algorithm was implemented and compared against the Modified Critical Path (MCP) scheduling algorithm. A series of experimental tests were conducted on diverse task sets, varying in size and complexity. Simulation results demonstrate that CSD outperforms existing compared approaches in task scheduling and processor utilization, making it a promising solution for multi-core systems.

Aya A. Eladgham, Nesreen I. Ziedan and Ibrahim Ziedan, “Core Scheduler Task Duplication for Multicore Multiprocessor System” International Journal of Advanced Computer Science and Applications(IJACSA), 15(10), 2024. http://dx.doi.org/10.14569/IJACSA.2024.01510103

@article{Eladgham2024,
title = {Core Scheduler Task Duplication for Multicore Multiprocessor System},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2024.01510103},
url = {http://dx.doi.org/10.14569/IJACSA.2024.01510103},
year = {2024},
publisher = {The Science and Information Organization},
volume = {15},
number = {10},
author = {Aya A. Eladgham and Nesreen I. Ziedan and Ibrahim Ziedan}
}