Abstract
Nowadays, the issue of scheduling multi-core real-time systems has become the focus of such research in industrial, biomedical, military, and other fields. As a consequence, a new semi-partitioning algorithm that uses a static Rate-Monotonic criterion to schedule real-time tasks on multi-core platforms is proposed. The improvement in the performance of real-time systems is achieved by exploitingthe fact that the utilization boundary of a task set increases to fully utilize the processors if the periods of tasks have harmonic nature among each other. Experimental results on randomly generated datasets and real-world datasets show that the proposed algorithm inevitably outperforms other competitive algorithms.
- J. H. Anderson, V. Bud, and U. C. Devi. 2005. An edf-based scheduling algorithm for multiprocessor soft real-time systems. In Proceedings of the 17th Euromicro Conference on Real-Time Systems. IEEE Computer Society, Washington, DC, USA, 199--208. Google Scholar
Digital Library
- Bojrn Andersson and Eduardo Tovar. 2006. Multiprocessor scheduling with few preemptions. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 322--334. Google Scholar
Digital Library
- Bjorn Andersson and Jan Jonsson. 2003. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In Proceedings of the 15th Euromicro Conference on Real-Time Systems, Ser. ECRTS’03 (Jul. 2003).Google Scholar
- Bjorn Andersson and Jane Jonsson. 2000. Fixed-priority preemptive multiprocessor scheduling: To partition or not to partition. In Proceedings of the 7th International Conference on Real-Time Computing Systems and Applications. 337--346. Google Scholar
Digital Library
- Bjorn Andersson, Konstantinos Bletsas, and Sanjoy Baruah. 2008. Scheduling arbitrary-deadline sporadic task systems on multiprocessors. In Proceedings of the Real-Time Systems Symposium, ser. RTSS’08. IEEE Computer Society, Washington, DC, 385--394. DOI:http://dx.doi.org/10.1109/RTSS.2008.44 Google Scholar
Digital Library
- Bjorn Andersson, S. Baruah, and Jane Jonsson. 2001. Static-priority scheduling on multiprocessors. In Proceedings of the 22nd IEEE Real-Time Systems Symposium, ser. RTSS’01. IEEE Computer Society, Washington, DC, 93. DOI:http://dl.acm.org/citation.cfm?id=882482.883823 Google Scholar
Digital Library
- Bjorn Andersson. 2008. Global static-priority preemptive multiprocessor scheduling with utilization bound 38. In Proceedings of the 12th ACM International Conference on Principles of Distributed Systems. Springer-Verlag, Berlin, 73--88. Google Scholar
Digital Library
- Theodoer. P. Baker. 2005. An analysis of edf schedulability on a multiprocessor. IEEE Trans Parallel Distrib Syst. 16, 8 (Aug. 2005), 760--768. Google Scholar
Digital Library
- Sanjoy Baruah and John Carpenter. 2003. Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. In Proceedings of the 17th Euromicro Conference on Real-Time Systems, (July 2003), 195--202.Google Scholar
Cross Ref
- Marko Bertogna. 2007. Real-Time Scheduling Analysis for Multiprocessor Platforms. Ph.D. Dissertation. Scuola Seprropre Sant Anna, Pisa.Google Scholar
- Enrico Bini, Giorgio C. Buttazzo, and Giuseppe M. Buttazzo. 2003. Rate monotonic analysis: The hyperbolic bound. IEEE Trans. Comput. 52, 7 (Jul. 2003), 933--942. DOI:http://dx.doi.org/10.1109/TC.2003.121 4341 Google Scholar
Digital Library
- John M. Calandrino, James H. Anderson, and Dan P. Baumberger. 2007. A hybrid real-time scheduling approach for large-scale multicore platforms. In Proceedings of the 19th Euromicro Conference on Real-Time Systems, ser. ECRTS’07, (July 2007), 247--258. Google Scholar
Digital Library
- Sérgio Vale Aguiar Campos, Edmund M. Clarke, Rance Cleaveland, Daniel Jackson, and John P. Lehoczky. 1996. A quantitative Approach to the Formal Verification of Real-Time Systems. Ph.D. Dissertation. School of Computer Science, Carnegie Mellon University, Pittsburgh (Sep. 1996). Google Scholar
Digital Library
- Michele Cirinei and Theodore P. Baker. 2007. Edzl scheduling analysis. In Proceedings of the 19th Euromicro Conference on Real-Time Systems, ser. ECRTS ’07 (July 2007), 9--18. Google Scholar
Digital Library
- Robert I. Davis and Alan Burns. 2011. A survey of hard real-time scheduling for multiprocessor systems. J. ACM Comput. Surv. 43, 4(Oct. 2011), 1--44. DOI:http://doi.acm.org/10.1145/1978802.1978814 Google Scholar
Digital Library
- Robert I. Davis. 2014. A Review of fixed priority and EDF scheduling for hard real-time uniprocessor systems. J. ACM Trans. Embedd. Comput. Syst., 11, 1 (Feb. 2014), 8--19. Google Scholar
Digital Library
- Sudarshan K. Dhall and C. L. Liu. 1978. On a real-time scheduling problem. Operat. Res. 26, 127--140. Google Scholar
Digital Library
- Abdullah Elewi, Mohamed Shalan, Medhat Awadalla, and EL Sayed M. Saad. 2014. Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems. J. ACM Trans. Embedd. Comput. Syst. 13, 2 (Jan. 2014), 1--27. DOI:http://dx.doi.org/10.1145/2544375.2544391 Google Scholar
Digital Library
- Joel Goosens, Shelby Funk, and Sanjoy Baruah. 2003. Priority-driven scheduling of periodic task systems on multiprocessors. J. Real-Time Syst. 25, 187--205. Google Scholar
Digital Library
- N. Guan, M. Stigge, W. Yi, and G. Yu. 2010. 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 on Systems, Ser. RTAS’10 (April 2010), 165--174. Google Scholar
Digital Library
- Shinpei. Kato and Nobuyuki Yamasaki. 2007. Real-time scheduling with task splitting on multiprocessors. In Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, ser. RTCSA’07. IEEE Computer Society, Washington, DC, 441_450. DOI:http://dx.doi.org/10.1109/RTCSA.2007.61 Google Scholar
Digital Library
- Shinpei Kato and Nobuyuki Yamasaki. 2008. Portioned EDF-based scheduling on multiprocessors. In Proceedings of the 8th ACM/IEEE International Conference on Embedded Software. 139--148. Google Scholar
Digital Library
- Karthik Lakshmanan, Ragunathan Raj Rajkumar, and John P. Lehoczky. 2009. Partitioned fixed-priority preemptive scheduling for multi-core processors. In Proceedings of the 21th Euromicro Conference on Real-Time Systems, ser. ECRTS’09. IEEE Computer Society, Washington, DC (Jul. 2009), 239--248. DOI:http://dx.doi.org/10.1109/ECRTS.2009.33 Google Scholar
Digital Library
- Sylvain Lauzac, Rami Melhem, and Daniel Mossé. 2003. An improved rate-monotonic admission control and its applications. IEEE Trans Comput. 52, 3 (Mar. 2003), 337--350. Google Scholar
Digital Library
- Greg Levin, Shelby Funk, Caitlin Sadowski, Ian Pye, and Scott Brandt. 2010. Dp-fair: A simple model for understanding optimal multiprocessor scheduling. In Proceedings of the 22nd Euromicro Conference on Real-Time Systems, ser. ECRTS’10 (Jul. 2010), 3--13. Google Scholar
Digital Library
- C. L. Liu and J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1 (Jan. 1973), 46--61. DOI:http://doi.acm.org/10.1145/321738.321743 Google Scholar
Digital Library
- J. Liu. 2000. Real-Time Systems. Prentice Hall, Upper Saddle River, NJ.Google Scholar
- C. Douglass Locke, David R. Vogel, and Thomas I. Mesler. 1991. Building a predictable avionics platform in ada: A case study. In Proceedings of the 12th Real-Time Systems Symposium (Dec. 1991), 181--189.Google Scholar
- J. M. Lopez, J. L. Diaz, and D. F. Garcia. 2004. Bounds for EDF scheduling on real-time multiprocessor systems. J. Real-Time Syst. 28, 39--68. Google Scholar
Digital Library
- Geoff Lowney. 2006. Why intel is designing multi-core processors. In Proceedings of the 25th International Symposium on Parallelism in Algorithms and Architectures, Montreal, Canada. Google Scholar
Digital Library
- Lars Lundberg. 2002. Analyzing fixed-priority global multiprocessor scheduling. In Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium, Ser. RTAS’02. Google Scholar
Digital Library
- Mahmoud Naghibzadeh and Amin Rezaeian. 2014. Overrun-freeness verification of rate-monotonic least-splitting real-time scheduler on multicores. In Proceedings of the 26th Euromicro Conference on Real-Time Systems.Google Scholar
- Mahmoud Naghibzadeh, Peyman Neamatollahi, Reza Ramezani, Amin Rezaeian, and Toktam Dehghani. 2013. Efficient semi-partitioning and rate-monotonic scheduling hard real-time tasks on multi-core systems. In Proceedings of the 8th IEEE International Symposium on Industrial Embedded Systems. (SIES) ser. RTSS’08 (June 2013). IEEE Computer Society, Washington, DC, 85--88.Google Scholar
Cross Ref
- Srikanth Ramamurthy. 2002. Scheduling periodic hard real-time tasks with arbitrary deadlines on multiprocessors. In Proceedings of the 23rd IEEE Real-Time Systems Symposium, Ser. RTSS’02. 59--68. Google Scholar
Digital Library
- A. C. Sodan, Jacob Machina, Arash Deshmeh, Kevin Macnaughton, and Bryan Esbaugh. 2011. Parallelism via multithreaded and multicore cpus. J. Comput. 99, 1--1. Google Scholar
Digital Library
- John A. Stankovic. 1988. Misconceptions about real-time computing: A serious problem for next-generation systems. J. Comput. 21, 10 (Oct. 1988), 10--19. Google Scholar
Digital Library
- Angela Uvarov, Lisa DiPippo, Victor Fay-Wolfe, Kevin Bryan, Patrick Gadrow, Timothy Henry, Matthew Murphy, Paul R. Work, and Louis P. DiPalma. 2004. Static real-time data distribution. In Proceedings of the 10th IEEE International Symposium on Real-Time and Embedded Technology and Applications (May 2004), 25--28.Google Scholar
- Mr. Vishal Vora1 and Dr. Ajay Somkuwar. 2012. Implementation & performance analysis of real time scheduling algorithms for three industrial embedded applications (IEA). In Proceedings of the International Journal of Information Technology Convergence and Services (IJITCS) (Dec. 2012).Google Scholar
- Wayne Wolf, Ahmed Amine Jerraya, and Grant Martin. 2008. Multiprocessor system-on-chip (mpsoc) technology. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 27, 10 (Oct 2008), 1701--1713. Google Scholar
Digital Library
- Chao Xu and Ying Ding. 2010. An Improved Static-Priority Scheduling Algorithm for Multi-Processor Real-Time Systems. Master of Science thesis in Secure and Dependable Computer System. University of Gothenburg, Göteborg, Sweden.Google Scholar
- O. Zapata and P. Alvarez. 2005. EDF and RM multiprocessor scheduling algorithms: Survey and performance evaluation. Tech. rep., CINVESTAV-IPN, Secci’on de Computaci’on, Mexico, 1--24.Google Scholar
Index Terms
Harmonic Segment-Based Semi-Partitioning Scheduling on Multi-Core Real-Time Systems
Recommendations
Harmonic-Fit Partitioned Scheduling for Fixed-Priority Real-Time Tasks on the Multiprocessor Platform
EUC '11: Proceedings of the 2011 IFIP 9th International Conference on Embedded and Ubiquitous ComputingOne common approach for partitioned multiprocessor scheduling problem is to transform this problem into a traditional bin-packing problem, with the utilization of a task being the "size" of the object and the utilization bound of a processor being the "...
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform
DATE '12: Proceedings of the Conference on Design, Automation and Test in EuropeThis paper presents a new semi-partitioned approach to schedule sporadic tasks on multi-core platform based on the Rate Monotonic Scheduling (RMS) policy. Our approach exploits the well known fact that harmonic tasks have better schedulablility than non-...
Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors
ISORC '15: Proceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed ComputingExisting real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and ...






Comments