UCSY's Research Repository

Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor

Show simple item record

dc.contributor.author Wai, Khin San
dc.contributor.author Htun, Moe Sanda
dc.date.accessioned 2019-07-31T14:43:38Z
dc.date.available 2019-07-31T14:43:38Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1540
dc.description.abstract Multiprogramming is used to improve the efficiency of the micro-processor. That is when the currently running process is blocked due to waiting for an I/O event, another process may be scheduled to run. At this moment, the issue of scheduling is involved, deciding which process should be executed by the processor, because usually more than one process may be ready for being scheduled. This paper presents performance analysis for different scheduling algorithms for multi-programming in uniprocessor environment Performance analysis is based on average turn-around time, average waiting time and average ratio or turn-around time to service time. Performance analysis shows that RR requires more waiting time and therefore , increase more turn-around time and turn- around to service time ratio. On the other hand,Short Process Next (SPN),Shortest Remaining Time (SRT) and Highest Response Ratio Next (HRRN) algorithms perform the best. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.subject Uniprocessor Scheduling en_US
dc.subject Scheduling algorithms en_US
dc.subject multiprogramming en_US
dc.subject performance analysis en_US
dc.title Simulation System for Performance Analysis of Scheduling Algorithm with Uniprocessor en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account