Advertisement

First-Fit Semi-partitioned Scheduling Based on Rate Monotonic Algorithm

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 309)

Abstract

Semi-partitioned scheduling is a new approach for allocating real-time tasks to processors such that utilization is enhanced. Each semi-partitioned approach has two phases, partitioning and scheduling. In partitioning phase, tasks are assigned to the processors. In this phase, some tasks are probably split into several subtasks and each assigned to a different processor. The second phase is the policy to determine how to schedule tasks on each processor. The main challenge of semi-partitioned scheduling algorithms is how to partition and split tasks by which they are safely scheduled under the identified scheduling policy. This paper proposes a new semi-partitioned scheduling algorithm called SRM-FF for real-time periodic tasks over multiprocessor platforms. The scheduling policy used within each processor is based on rate monotonic algorithm. The partitioning phase of our proposed approach includes two sub-phases. Task splitting is done only in the second sub-phase. In the first sub-phase, processors are selected by a first-fit method. The use of first-fit method makes SRM-FF create lower number of subtasks in comparison to previous work hence the number of context switches of subtasks and overhead due to task splitting are reduced. The feasibility of tasks and subtasks which are partitioned by SRM-FF is formally proved.

Keywords

Embedded systems Real time scheduling Rate monotonic Semi-partitioned technique 

References

  1. 1.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 43–73 (1973)Google Scholar
  2. 2.
    Garey, M.R., Johnson, D.S. (eds.): Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)Google Scholar
  3. 3.
    George, L., Courbin, P., Sorel, Y.: Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling. J. Syst. Architect. 57(5), 518–535 (2011)CrossRefGoogle Scholar
  4. 4.
    Guan, N., et al.: Parametric utilization bounds for fixed-priority multiprocessor scheduling. In: Parallel and Distributed Processing Symposium (IPDPS). IEEE, Shanghai, pp. 261–272 (2012)Google Scholar
  5. 5.
    Kandhalu, A., et al.: pCOMPATS: period-compatible task allocation and splitting on multi-core processors. In: 18th Real Time and Embedded Technology and Applications Symposium (RTAS). IEEE, Beijing, pp. 307–316 (2012)Google Scholar
  6. 6.
    Kato, S., Yamasaki, N.: Semi-partitioned fixed-priority scheduling on multiprocessors. In: 15th Real-Time and Embedded Technology and Applications Symposium (RTAS), IEEE, San Francisco, CA, pp. 23–32 (2009)Google Scholar
  7. 7.
    Lakshmanan, K., Rajkumar, R.R., Lehoczky, J.P.: Partitioned fixed-priority preemptive scheduling for multi-core processors. In: Euromicro conference on real-time systems (ECRTS), Dublin, pp 239–248 (2009)Google Scholar
  8. 8.
    Naghibzadeh, M., et al.: Efficient semi-partitioning and rate-monotonic scheduling hard real-time tasks on multi-core systems. In: 8th IEEE International Symposium on Industrial Embedded Systems (SIES), Porto, pp. 85–88 (2013)Google Scholar
  9. 9.
    Guan, N., Stigge, M., Yi, W., Yu, G.: Fixed-priority multiprocessor scheduling with Liu and Layland’s utilization bound. In: Real-Time and Embedded Technology and Applications Symposium (RTAS), 2010 16th IEEE, pp. 165–174 (2013)Google Scholar
  10. 10.
    Naghibzadeh, M., Kim, K.H.K.: The yielding-first rate-monotonic scheduling approach and its efficiency assessment. Comput. Syst. Sci. Eng. 18, 173–180 (2003)Google Scholar
  11. 11.
    Lauzac, S., Melhem, R., Mosse, D.: An improved rate-monotonic admission control and its applications. IEEE Trans. Comput. 52(3), 337–350 (2003)CrossRefGoogle Scholar
  12. 12.
    Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Real Time Systems Symposium, Santa Monica (1989)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Imam Reza International UniversityMashhadIran
  2. 2.Department of Computer EngineeringFerdowsi University of MashhadMashhadIran

Personalised recommendations