[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.5626/JCSE.2014.8.1.43

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

Senobary, Saeed (Imam Reza International University)
Naghibzadeh, Mahmoud (Dept. of Computer Engineering, Ferdowsi University of Mashhad)

Publication Information

Journal of Computing Science and Engineering / v.8, no.1, 2014 , pp. 43-56 More about this Journal

Abstract

Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

Keywords

Real-time systems; Scheduling algorithms; Delayed rate monotonic; Semi-partitioned technique;

Citations & Related Records

Reference

1	R. J. Bril, M. M. van den Heuvel, and J. J. Lukkien, "Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points," in Proceedings of the 21st International Conference on Real-Time Networks and Systems, Sophia Antipolis, France, 2013, pp. 255-264.
2	S. Lauzac, R. Melhem, and D. Mosse, "An improved ratemonotonic admission control and its applications," IEEE Transactions on Computers, vol. 52, no. 3, pp. 337-350, 2003. DOI ScienceOn
3	M. K. Bhatti, C. Belleudy, and M. Auguin, "A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms," in Proceedings of the 27th Annual ACM Symposium on Applied Computing, Riva, Trento, Italy, 2012, pp. 1594-1601.
4	L. George, P. Courbin, and Y. Sorel, "Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling," Journal of Systems Architecture, vol. 57, no. 5, pp. 518-535, 2011. DOI ScienceOn
5	C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," Journal of the ACM, vol. 20, no. 1, pp. 46-61, 1973. DOI
6	J. Lee, A. Easwaran, I. Shin, and I. Lee, "Zero-laxity based real-time multiprocessor scheduling," Journal of Systems and Software, vol. 84, no. 12, pp. 2324-2333, 2011. DOI ScienceOn
7	J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: exact characterization and average case behavior," in Proceedings of the Real Time Systems Symposium, Santa Monica, CA, 1989, pp. 166-171.
8	M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: W. H. Freeman, 1979.
9	M. Naghibzadeh and K. H. K. Kim, "The yielding-first ratemonotonic scheduling approach and its efficiency assessment," Computer Systems Science & Engineering, vol. 18, no 3, pp. 173-180, 2003.
10	M. Sabeghi, M. Naghibzadeh, and T. T. Razavizadeh, "A fuzzy algorithm for scheduling soft periodic tasks in preemptive real-time systems," New Mathematics and Natural Computation, vol. 3, no. 3, pp. 371-384, 2007. DOI ScienceOn
11	N. Guan, M. Stigge, W. Yi, and G. Yu, "Parametric utilization bounds for fixed-priority multiprocessor scheduling," in Proceedings of the IEEE 26th International Parallel and Distributed Processing Symposium, Shanghai, China, 2012, pp. 261-272.
12	J. J. Anderson, V. Bud, and U. C. Devi, "An EDF-based scheduling algorithm for multiprocessor soft real-time systems," in Proceedings of the 17th Euromicro Conference on Real-Time Systems, Palma de Mallorca, Spain, 2005, pp. 199-208.
13	A. Kandhalu, K. Lakshmanan, J. Kim, and R. Rajkumar, "pCOMPATS: period-compatible task allocation and splitting on multi-core processors," in Proceedings of the IEEE 18th Real Time and Embedded Technology and Applications Symposium, Beijing, China, 2012, pp. 307-316.
14	N. Guan, M. Stigge, W. Yi, and G. Yu, "Fixed-priority multiprocessor scheduling with Liu and Layland's utilization bound," in Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, Stockholm, Sweden, 2010, pp. 165-174.
15	K. Lakshmanan, R. Rajkumar, and J. P. Lehoczky, "Partitioned fixed-priority preemptive scheduling for multi-core processors," in Proceedings of the 21st Euromicro Conference on Real-Time Systems, Dublin, Ireland, 2009, pp. 239-248.
16	M. Fan and G. Quan, "Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform," in Proceedings of the Conference on Design, Automation and Test in Europe, Dresden, Germany, 2012, pp. 503-508.
17	M. Naghibzadeh, P. Neamatollahi, R. Ramezani, A. Rezaeian, and T. Dehghani, "Efficient semi-partitioning and ratemonotonic scheduling hard real-time tasks on multi-core systems," in Proceedings of the 8th IEEE International Symposium on Industrial Embedded Systems, Porto, Portugal, 2013, pp. 85-88.