Visible to the public Multi-Fold Scheduling Algorithm for Multi-Core Multi-Processor Systems

TitleMulti-Fold Scheduling Algorithm for Multi-Core Multi-Processor Systems
Publication TypeConference Paper
Year of Publication2020
AuthorsGautam, Savita, Umar, M. Sarosh, Samad, Abdus
Conference Name2020 5th International Conference on Computing, Communication and Security (ICCCS)
KeywordsAcceleration, Computer architecture, cube architectures, Dynamic scheduling, execution time, load imbalance factor, Metrics, multicore, multicore computing security, Multicore processing, packet scheduling, pubcrawl, resilience, Resiliency, Scalability, Scheduling algorithms, Task Analysis, task migration, Throughput
AbstractAdapting parallel scheduling function in the design of multi-scheduling algorithm results significant impact in the operation of high performance parallel systems. The various methods of parallelizing scheduling functions are widely applied in traditional multiprocessor systems. In this paper a novel algorithm is introduced which works not only for parallel execution of jobs but also focuses the parallelization of scheduling function. It gives attention on reducing the execution time, minimizing the load balance performance by selecting the volume of tasks for migration in terms of packets. Jobs are grouped into packets consisting of 2n jobs which are scheduled in parallel. Thus, an enhancement in the scheduling mechanism by packet formation is made to carry out high utilization of underlying architecture with increased throughput. The proposed method is assessed on a desktop computer equipped with multi-core processors in cube based multiprocessor systems. The algorithm is implemented with different configuration of multi-core systems. The simulation results indicate that the proposed technique reduces the overall makespan of execution with an improved performance of the system.
DOI10.1109/ICCCS49678.2020.9276749
Citation Keygautam_multi-fold_2020