Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time
نویسندگان
چکیده
منابع مشابه
Modified Round Robin Scheduling Algorithm Using Variable Time Slice
CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers...
متن کاملPriority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems
In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robi...
متن کاملScheduling Algorithm for Real-time Burst Traffic Using Dynamic Weighted round Robin
In this paper, we propose a new scheduling algorithm, called the Dynamic Weighted Round Robin (DWRR) scheduling discipline, which is suitable for real-time variable bit rate (rtVBR) service as well as other services such as constant bit rate (CBR), non real-time VBR (nrtVBR), available bit rate (ABR) services in a high-speed network. We employ dynamic weight to serve a queue associated with act...
متن کاملTime Sharing Algorithm with Dynamic Weighted Harmonic round Robin
In operating system is an important issue, Allocates processor time to processes, to be fair. We presented in This paper proposed methods to reduce Average waiting time, average response time, Switch Counts process, through the design of a time sharing non-exclusive scheduling algorithm based on the round Robin and determined accurate time quantum . Among the proposed approaches, weight harmoni...
متن کاملAn optimized round robin cpu scheduling algorithm with dynamic time quantum
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Avera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i8/76368