Daniel Casini
ABSTRACT
The Hard Constant Bandwidth Server (H-CBS) is a reservation-based scheduling algorithm often used to mix hard and soft real-time tasks on the same system. A number of variants of the H-CBS algorithm have been proposed in the last years, but all of them have been conceived for implicit server deadlines (i.e., equal to the server period). However, recent promising results on semi-partitioned scheduling together with the demand for new functionality claimed by the Linux community, urge the need for a reservation algorithm that is able to work with constrained deadlines. This paper presents three novel H-CBS algorithms that support constrained deadlines. The three algorithms are formally analyzed, and their performance are compared through an extensive set of simulations.
- L. Abeni, G. Lipari, and J. Lelli. 2014. Constant bandwidth server revisited. In Proceedings of the Embed With Linux 2014 Workshop (EWiLi 2014) (CEUR Workshop Proceedings), Vol. 1291. Lisboa, Portugal. http://ceur-ws.org/Vol-1291Google Scholar
- L. Abeni, L. Palopoli, C. Scordino, and G. Lipari. 2009. Resource Reservations for General Purpose Applications. IEEE Transactions on Industrial Informatics 5, 1 (Feb 2009), 12--21.Google ScholarCross Ref
- S. K. Baruah, L. E. Rosier, and R. R. Howell. 1990. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-time systems 2, 4 (1990), 301--324. Google ScholarDigital Library
- A. Biondi, A. Balsini, and M. Marinoni. 2015. Resource Reservation for Real-time Self-suspending Tasks: Theory and Practice. In Proc. of the 23rd International Conference on Real Time and Networks Systems (RTNS '15). ACM, 10. Google ScholarDigital Library
- A. Biondi, G. C. Buttazzo, and M. Bertogna. 2015. Supporting component-based development in partitioned multiprocessor real-time systems. In Proceedings of the 27th Euromicro Conference on Real-Time Systems (ECRTS 2015). Lund, Sweden. Google ScholarDigital Library
- A. Biondi, G. C. Buttazzo, and M. Bertogna. 2016. Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources. IEEE Trans. Comput. 65, 5 (2016), 1593--1605. Google ScholarDigital Library
- A. Biondi, A. Melani, and M. Bertogna. 2014. Hard Constant Bandwidth Server: Comprehensive Formulation and Critical Scenarios. In Proceedings of the 9th IEEE International Symposium on Industrial Embedded Systems (SIES 2014). Pisa, Italy.Google ScholarCross Ref
- B. Brandenburg and M. Gul. 2016. Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations. In Proceedings of the 37th IEEE Real-Time Systems Symposium (RTSS 2016). Porto, Portugal.Google Scholar
- B. B. Brandenburg and J. H. Anderson. 2007. Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors. In 19th Euromicro Conference on Real-Time Systems (ECRTS'07). 61--70. Google ScholarDigital Library
- A. Burns, R. Davis, P. Wang,, and F. Zhang. 2012. Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme. Real-Time Systems 48 (2012), 3--33. Google ScholarDigital Library
- G. C. Buttazzo. 2011. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Third Edition. Springer. Google ScholarDigital Library
- M. Caccamo, G. Buttazzo, and L. Sha. 2000. Capacity sharing for overrun control. In Proc. of the 21st IEEE conference on Real-time systems symposium. Orlando, Florida, USA. Google ScholarDigital Library
- D. Casini, A. Biondi, and G. Buttazzo. 2017. Semi-Partitioned Scheduling of Dynamic Real-Time Workload: A Practical Approach Based On Analysis-driven Load Balancing. In Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Dubrovnik, Croatia.Google Scholar
- J.J. Chen, G. Nelissen, and W.H. Huang. 2016. A unifying response time analysis framework for dynamic self-suspending tasks. In 28th Euromicro Conference on Real-Time Systems (ECRTS). IEEE.Google Scholar
- J.J. Chen, G. Nelissen, W.-H. Huang, M. Yang, K. Bletsas B. Brandenburg, C. Liu, P. Richard, F. Ridouard, N. Audsley, R. Rajkumar, and D. de Niz. 2016. Many suspensions, many problems: A review of selfsuspending tasks in real-time systems. Technical Report. Faculty of Informatik, TU Dortmund.Google Scholar
- U. M. C. Devi and J. H. Anderson. 2005. Tardiness bounds under global EDF scheduling on a multiprocessor. In 26th IEEE International Real-Time Systems Symposium (RTSS'05). 12 pp.--341. Google ScholarDigital Library
- P. Emberson, R. Stafford, and R. Davis. 2010. Techniques for the synthesis of multiprocessor tasksets. In Proc. of the 2nd International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS 2010). Brussels, Belgium.Google Scholar
- N. Fisher, T. P. Baker, and S. Baruah. 2006. Algorithms for Determining the Demand-Based Load of a Sporadic Task System. In 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06). Sydney, Australia. Google ScholarDigital Library
- J. Lelli, C. Scordino, L. Abeni, and D. Faggioli. 2016. Deadline Scheduling in the Linux kernel. Software: Practice and Experience 46, 6 (Jun 2016), 821--839. Google ScholarDigital Library
- L. Marzario, G. Lipari, P. Balbastre, and A. Crespo. 2004. IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems. In 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2004). Toronto, Canada. Google ScholarDigital Library
- C. W. Mercer, S. Savage, and H. Tokuda. 1994. Processor capacity reserves for multimedia operating systems. In Proceedings of IEEE international conference on Multimedia Computing and System. Boston, Massachusetts, USA.Google Scholar
- A. K. Mok, X. Feng, and D. Chen. 2001. Resource partition for real-time systems. In Proceedings Seventh IEEE Real-Time Technology and Applications Symposium (RTAS 2001). Google ScholarDigital Library
- R. Rajkumar, K. Juvva, A. Molano, and S. Oikawa. 1998. Resource kernels: A resource-centric approach to real-time and multimedia systems. In SPIE/ACM Conference on Multimedia Computing and Networking. San Jose, CA, USA. Google ScholarDigital Library
- I. Shin and I. Lee. 2004. Compositional real-time scheduling framework. In Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS 2004). Lisbon, Portugal. Google ScholarDigital Library
- F. Zhang and A. Burns. 2009. Schedulability Analysis for Real-Time Systems with EDF Scheduling. IEEE Trans. Computers 58, 9 (2009), 1250--1258. Google ScholarDigital Library
Index Terms
- Constant bandwidth servers with constrained deadlines
Recommendations
Scheduling Aperiodic Tasks Using Total Bandwidth Server on Multiprocessors
EUC '08: Proceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 01This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that ...
Designing network servers within a hierarchical scheduling framework
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied ComputingAs distributed applications are becoming more complex, compositionality achieves a stronger importance. Such property allows composing complex applications, integrating independently developed components while maintaining their properties upon ...
LLF Schedulability Analysis on Multiprocessor Platforms
RTSS '10: Proceedings of the 2010 31st IEEE Real-Time Systems SymposiumLLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms ...
Comments