CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on Scheduling Approaches for Hard Real-Time Systems

by Mehrin Rouhifar, Reza Ravanmehr
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 17
Year of Publication: 2015
Authors: Mehrin Rouhifar, Reza Ravanmehr
10.5120/ijca2015907656

Mehrin Rouhifar, Reza Ravanmehr . A Survey on Scheduling Approaches for Hard Real-Time Systems. International Journal of Computer Applications. 131, 17 ( December 2015), 41-48. DOI=10.5120/ijca2015907656

@article{ 10.5120/ijca2015907656,
author = { Mehrin Rouhifar, Reza Ravanmehr },
title = { A Survey on Scheduling Approaches for Hard Real-Time Systems },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 131 },
number = { 17 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 41-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number17/23545-2015907656/ },
doi = { 10.5120/ijca2015907656 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:27:40.339208+05:30
%A Mehrin Rouhifar
%A Reza Ravanmehr
%T A Survey on Scheduling Approaches for Hard Real-Time Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 17
%P 41-48
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated that include both uni and multi processors schemes. It provides the summary of schedulability analysis and well-known attributes. This paper composed of two parts; first part surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks. Second part contains the different heuristic and partitioned approaches for some specific factors of real-time systems such as energy consumption, dependability, performance, scheduling feasibility and utilization of memory resource. Finally, the analysis and evaluation of the mentioned methods are shown based on the schedulability of task sets and efficiency.

References
  1. Buttazzo. G. C, “Hard Real-Time Computing Systems Predictable Scheduling Algorithms and Applications”, Springer Publications 3rd Edition, 2011.
  2. Robert. I, Davis, R and Burns A, “A Review of Fixed Priority and EDF Scheduling for Hard Real-Time Uniprocessor Systems”, EWiLi’13, August 26–27, 2013, Toulouse, FRANCE.
  3. Lindh. F, Otnes. T, Wennerström. J, “Scheduling Algorithms for Real-Time Systems”.
  4. Davis, R. I. and Burns. A, “A Survey of Hard Real-Time Scheduling for Multiprocessor Systems”, ACM Computer Survey, Vol. 43, No.4, Article 35, 44 pages, 2011.
  5. Shamim Shiravi and Mostafa E. Salehi, “Fault Tolerant Task Scheduling Algorithm for Multicore Systems”, The 22nd Iranian Conference on Electrical Engineering (ICEE 2014), 2014, Shahid Beheshti University.
  6. Sha L., Rajkumar R. and Lehoczky J. P., "Priority Inheritance Protocols: An Approach to Real Time Synchronisation", IEEE Transactions on Computers 39(9), pp. 1175-1185, September 1990.
  7. G. E. Moore, "Cramming more components onto integrated circuits", Electronics, Vol. 38, No. 8, McGraw-Hill, 1965.
  8. F. Kong, W. Yi, and Q. Deng, "Energy-efficient scheduling of real-time tasks on cluster-based multicores" in Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1-6, 2011.
  9. W. Y. Lee, "Energy-efficient scheduling of periodic real-time tasks on lightly loaded multicore processors", Parallel and Distributed Systems, IEEE Transactions on, vol. 23, pp. 530-537, 2012.
  10. J.-J. Chen and T.-W. Kuo, "Energy-efficient scheduling of periodic real-time tasks over homogeneous multiprocessors", in the 2nd international workshop on power-aware real-time computing, pp. 30-35, 2005.
  11. K. Manudhane, A. Wadhe, “QoS-Aware Approaches to Real-Time task scheduling on Heterogeneous Clusters”, international Journal of Advanced Research in Computer Science and Software Engineering, Volume 3, Issue 4, pp. 174−180, 2013.
  12. K. Houben and A. Halan, “An Energy-Aware Dynamic Scheduling Algorithm for Hard Real-Time Systems”, 3rd Mediterranean Conference on Embedded Computing, MECO – 2014, ACM, PP. 14-17.
  13. Abhaya K. Samal , R. Mall and C. Tripathy, “Fault tolerant scheduling of hard real-time tasks on multiprocessor system using a hybrid genetic algorithm”, Elsevier. Swarm and Evolutionary Computation, 2014.
  14. S. Ghosh, R. Melhem, D. Mossé, “Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems”, IEEE Trans. Parallel Distrib. Syst. 8 (3), pp. 272-284, 1997.
  15. Mohammad H. Mottaghi and Hamid R. Zarandi, “DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors”, Elsevier.Microprocessors and Microsystems, Vol. 38, pp:88–97, 2014.
  16. A. Wiese, V. Bonifaci and S. Baruah, “Partitioned EDF scheduling on a few types of unrelated multiprocessors”, Springer, Real-Time Syst, vol. 49, pp:219–238, 2013.
  17. G. Yao, R. Pellizzoni, S. Bak, E. Betti and M. Caccamo, “Memory-centric scheduling for multicore hard real-time systems”, Springer, Real-Time Syst, vol. 48, pp:681–715, 2012.
  18. J. Rosen, P. Eles, A. Andrei, Z. Peng, “Bus access optimization for predictable implementation of realtime applications on multiprocessor systems-on-chip”, In: Proceedings of the 28th IEEE real-time system symposium, 2007.
  19. German standard DIN 66243-2, “Programmiersparche PEARL90”, Beuth, 1998.
Index Terms

Computer Science
Information Sciences

Keywords

Real-time system Hard RTS Scheduling Schedulability.

Powered by PhDFocusTM