A Comparative Study of the Implementation of SJF and SRT Algorithms on the GPU Processor Using CUDA

GPU (Graphical Processing Units) have become in a few years very powerful tools for parallel computing. They are currently used in several fields such as image processing, bioinformatics, medical applications and numerical computation...etc. Their advantages are faster processing and lower power consumption compared to CPU power. It is simple to program a GPU processor using the CUDA C language to perform tasks that are typically computed in parallel. But you need to understand the different architectural aspects of the GPU. In this paper, we will define and implement the two operating system algorithms the SJF (Shortest Job First) algorithm and the SRT (Shortest Remaining Time) algorithm in a single-wire CPU environment using the C language, and then the same algorithms will be implemented on the GPU using the CUDA C language, in order to compare the different performances of the implementation of the two algorithms on GPU and CPU processors and to verify the efficiency of this study.