The week's pick
Random Articles
Reseach Article
Comparative Study of Scheduling Algorithms for Real Time Environment
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 44 - Number 2 |
| Year of Publication: 2012 |
| Authors: Ishan Khera, Ajay Kakkar |
10.5120/6233-7797
|
Ishan Khera, Ajay Kakkar . Comparative Study of Scheduling Algorithms for Real Time Environment. International Journal of Computer Applications. 44, 2 ( April 2012), 5-8. DOI=10.5120/6233-7797
Abstract
Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i. e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques has been done. The various issues have been presented on which there is still a need to work.
References
- Daniel P. Bovet and Marco Cesati, "Understanding the Linux Kernel", O'Reilly Online Catalogue, October 2000.
- Hermann Kopetz, "Real-Time Systems: Design Principles for Distributed Embedded Applications", Springer, second edition.
- Peter Brucker, "Scheduling Algorithms", Springer, fifth edition.
- Giorgio C. Buttazzo, "Hard Real Time Computing Systems: Predictable Scheduling Algorithms and Applications", Springer, Third edition.
- C. L. Liu and James W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard Real Time Environment", Journal of the Association of Computing Machinery, Vol. 20, No. 1, January 1973, pp. 46-61.
- Euiseong Seo Jinkyu Jeong, Seonyeong Park, and Joonwon Lee. , "Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors", IEEE transactions on parallel and distributed systems, vol. 19, no. 11, November 2008, pp 1540-1552.
- S. Roman, H. Mecha, D. Mozos and J. Septien, " Constant complexity scheduling for hardware multitasking in two dimensional reconfigurable field-programmable gate arrays", IET Computer Digit. Tech. , 2008, Vol. 2, No. 6, pp. 401–412.
- Pravanjan Choudhury, Rajeev Kumar and P. P. Chakrabarti, "Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time Constraints" IEEE Transactions On Parallel And Distributed Systems, Vol. 19, No. 7, July 2008, pp. 967-980.
- Enrico Bini, Thi Huyen Chau Nguyen, Pascal Richard, and Sanjoy K. Baruah, "A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines", IEEE Transactions On Computers, Vol. 58, No. 2, February 2009, pp. 279-286.
- Marko Bertogna, Michele Cirinei, and Giuseppe Lipari, "Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms", IEEE Transactions On Parallel And Distributed Systems, Vol. 20, No. 4, April 2009, pp. 553-566.
- Wan Yeon Lee, "Energy-Efficient Scheduling of Periodic Real-Time Tasks on Lightly Loaded Multicore Processors", IEEE Transactions On Parallel And Distributed Systems, Vol. 23, No. 3, March 2012, pp. 530-537
Index Terms
Keywords