Some real-time systems that need to be associated with operating system services with a hard real-time system. Since these real-time systems that need to be extremely responsive to the outside world have no simple and low-cost operating system assistance. This paper deals with the application on a Linux-based operating system of the priority-based preemptive real-time scheduling algorithm that will suffice these firm applications in real-time. Typically, the algorithms regarded for these hard real-time systems are preemptive scheduling based on priorities. Based on the priority, by meeting the deadline, this algorithm can produce a feasible schedule for the dynamic tasks to be performed on the processor. It is feasible to schedule tasks on a processor as long as preemption is permitted and tasks do not compete for resources. In this scheduling algorithm, the task in the running queue that is waiting for the execution will be placed in the priority queue that is ready to execute in the available processor. This algorithm is deployed in the Linux kernel with the patch file and the kernel is built in the multi core system to execute an application