Computer Science – Operating Systems
Scientific paper
2009-12-03
International Journal of Computer Science and Information Security, IJCSIS, Vol. 6, No. 2, pp. 061-066, November 2009, USA
Computer Science
Operating Systems
6 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS November 2009, ISSN 1947 5500,
Scientific paper
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.
Ramesh Dr. R.
Yaashuwanth C.
No associations
LandOfFree
A New Scheduling Algorithms For Real Time Tasks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A New Scheduling Algorithms For Real Time Tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Scheduling Algorithms For Real Time Tasks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-517094