Real Time System Fault Tolerance Scheduling Algorithms
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 9)Publication Date: 2014-09-30
Authors : Ramita Mehta; Upasna;
Page : 297-306
Keywords : SJF; FCFS; Scheduling; Round Robin; Preemptive; Non Preemptive;
Abstract
The main objective of this paper is to implement the real time scheduling algorithms and discuss the advantages and disadvantages of the same. Task within the real time system are designed to accomplish certain service(s) upon execution, and thus, each task has a particular significance to overall functionality of the system. Scheduling algorithms in non-real time system not considering any type of dead line but in real time system deadline is main criteria for scheduling the task.
Other Latest Articles
- Peristaltic Motion with Porous Medium through Coaxial Vertical Channel: A Theoretical Study
- Peristaltic Motion with Porous Medium through Coaxial Vertical Channel: A Theoretical Study
- AN EFFICIENT DISTRIBUTED CONTROL LAW FOR LOAD BALANCING IN CONTENT DELIVERY NETWORKS?
- Wireless Body Area Networks and Its Emerging Technologies in Real Time Applications
- A Novel Method of Optimizing Lifetime and Reduction in Power Consumption in Wireless Sensor Network
Last modified: 2014-09-19 15:22:01