Abstract
Modern computer system is organized with multi-core processing system. The scheduling of processes in multiprocessing may turn into more complex task. In multi-core processing system, there are two or more cores embedded into a single chip. This architecture provides more efficiency in terms of throughput than single processor architecture. Previously, most of the work has been done in creating new scheduling algorithms for multi-core processing system, but small consideration has been given to merge user priority and system priority. In this paper, researcher has proposed Smart Job First Dynamic Round Robin Algorithm with smart Time Quantum (SJFDRR) in multi-core processing system in which a smart priority factor (SPF) is calculated for each process. The process which has lowest value of SPF is scheduled first. The time quantum is calculated dynamically for each processor. By this algorithm the average waiting time and average turnaround time and context switch is significantly decreases which lead to increase in performance of the system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
