Abstract: The present disclosure is directed to a scheduler in a real time operating system for a central processing unit (CPU) that runs a number of, and diverse set of processes in a ready queue, the scheduler when executed by the CPU performs steps including dividing the ready queue of P processes into two lists, list 1 contains n processes while list 2 contains m processes, where n+m=P, averaging total execution times of the processes in each list, generating a first quantum s based on an average of each list, generating a second quantum t based on the average of each list, comparing total execution time of a candidate process which needs to be assigned to the CPU with the quantum values, and assigning the value of a quantum, based on the comparing, that is the quantum value closest to the total execution time of the candidate process, to that process as a time period for running on the CPU.

Abstract: The present disclosure is directed to a scheduler in a real time operating system for a central processing unit (CPU) that runs a number of, and diverse set of processes in a ready queue, the scheduler when executed by the CPU performs steps including dividing the ready queue of P processes into two lists, list 1 contains n processes while list 2 contains m processes, where n+m=P, averaging total execution times of the processes in each list, generating a first quantum s based on an average of each list, generating a second quantum t based on the average of each list, comparing total execution time of a candidate process which needs to be assigned to the CPU with the quantum values, and assigning the value of a quantum, based on the comparing, that is the quantum value closest to the total execution time of the candidate process, to that process as a time period for running on the CPU.