A New Scheduling Algorithms For Real Time Tasks

📝 Abstract

The main objective of this paper is to develop the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems. The scheduling algorithm plays a significant role in the design of real time embedded systems. Simple round robin architecture is not efficient to be implemented in embedded systems because of higher context switch rate, larger waiting time and larger response time. Missing of deadlines will degrade the system performance in soft real time systems. The main objective of this paper is to develop the scheduling algorithm which removes the drawbacks in simple round robin architecture. A comparison with round robin architecture to the proposed architectures has been made. It is observed that the proposed architectures solves the problems encountered in round robin architecture in soft real time by decreasing the number of context switches waiting time and response time thereby increasing the system throughput.

💡 Analysis

The main objective of this paper is to develop the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems. The scheduling algorithm plays a significant role in the design of real time embedded systems. Simple round robin architecture is not efficient to be implemented in embedded systems because of higher context switch rate, larger waiting time and larger response time. Missing of deadlines will degrade the system performance in soft real time systems. The main objective of this paper is to develop the scheduling algorithm which removes the drawbacks in simple round robin architecture. A comparison with round robin architecture to the proposed architectures has been made. It is observed that the proposed architectures solves the problems encountered in round robin architecture in soft real time by decreasing the number of context switches waiting time and response time thereby increasing the system throughput.

📄 Content

(IJCSIS) International Journal of Computer Science and Information Security,
Vol. 6, No.2, 2009 A New Scheduling Algorithms
for Real Time Tasks

                          C.Yaashuwanth  

Department of Electrical and Electronics Engineering,
Anna University Chennai, Chennai 600 025, India. .

Abstract - The main objective of this paper is to develop the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems. The scheduling algorithms plays a significant role in the design of real time embedded systems. Simple round robin architecture is not efficient to be implemented in embedded systems because of higher context switch rate, larger waiting time and larger response time. Missing of deadlines will degrade the system performance in soft real time systems. The main objectives of this paper is to develop the scheduling algorithms which removes the drawbacks in simple round robin architecture. A comparison with round robin architecture to the proposed architectures has been made. It is observed that the proposed architectures solves the problems encountered in round robin architecture in soft real time by decreasing the number of context switches waiting time and response time thereby increasing the system throughput.

Key words - Round robin architecture, time slice, deadlines, soft real time.

I. INTRODUCTION

This paper describes the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems

The new approach describes the scheduling of processes in modified round robin architecture. Simple round robin architecture is not efficient if the taskset has processes with variable CPU burst because the processes arriving in round robin will be allocated time slice in first come first serve manner. This drawbacks of variable process bursts of processes in a taskset leads to larger waiting time. The larger response time of processes with less CPU burst which leads to increase in waiting time and response time of system thereby degrading the system performance The proposed algorithm has the advantage of processes with less CPU burst will have a better waiting time and response time than compared to simple round robin architecture and covers the drawbacks of round robin architecture by reducing the waiting time and reducing the response time thereby increasing the system throughput

Dr.R.Ramesh
Department of Electrical and Electronics Engineering,
Anna University Chennai, Chennai 600 025, India. .

The second approach describes the calculation of intelligent time slice for round robin architecture is a modified version of simple round robin architecture. Simple round robin architecture cannot be implemented in soft real time systems because of high context switch rate, larger waiting time and larger response time. Because of these performance criteria of the round robin architecture is not suitable to implement in real time systems. Soft real time systems have no hard deadlines for tasks but missing of deadlines in soft real time systems will degrade the system performance.

Real time systems always has a time constraint on computation. Each task should be invoked after the ready time and must complete before its deadline[12][13][14], an attempt has been made to satisfy these constraints. Simple round robin architecture[1] is not suitable to implement in softreal time due to more no of context switches, longer waiting and response times. This in turn leads to low throughput in the system . Richard roehi[3] proposed a new way of scheduling which implements a new priority queue in the round robin architecture that gives priority to tasks with short CPU burst thereby improving the performance of the tasks with less central processing unit (CPU) burst. Fair scheduling with tunable latency[8] is a Round Robin approach that proposes an alternative and lower complexity approach to packet scheduling, based on modifications of the classical Round Robin scheduler. The authors showed that appropriate modifications of the weighted Round Robin (WRR) service discipline can, in fact, provide tight fairness properties and efficient delay guarantees to multiple sessions. Round robin approach has its applications on networks by allowing the network devices to have a free share of network
resources. Various types of scheduling algorithms such as Dificit round robin [6], Dificit round robin alternated [4] and credit round robin[7] have been implemented.

Real-time scheduling theory has shown a transition from cyclical executive based infrastructure to a more flexible scheduling models such as fixed-priority scheduling, dynamic-priority scheduling, feedback scheduling o

This content is AI-processed based on ArXiv data.