Workload-aware shaping of shared resource accesses in mixed-criticality systems

For mixed-criticality systems, safety standards (e.g. ISO 26262) require sufficient independence among different criticality levels, unless the entire system is certified according to the highest applicable level. We present a resource arbitration scheme that provides sufficient independence among different criticality levels w.r.t. timing properties. We exploit throughput and latency slack of critical applications by prioritizing non-critical over critical accesses and only switching priorities when necessary. By using an accurate representation of resource access patterns and workloads, the proposed arbitration scheme achieves an improved resource utilization compared to classical approaches that use simple access counters. The approach allows to provide service guarantees for critical applications, while reducing the adverse effects through strict prioritization on non-critical applications.

[1]  Hiroyuki Tomiyama,et al.  CHStone: A benchmark program suite for practical C-based high-level synthesis , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[2]  Alois Knoll,et al.  Priority division: A high-speed shared-memory bus arbitration with bounded latency , 2011, 2011 Design, Automation & Test in Europe.

[3]  Rajeev Balasubramonian,et al.  Interconnect design considerations for large NUCA caches , 2007, ISCA '07.

[4]  Henrik Theiling,et al.  Multi-core Interference-Sensitive WCET Analysis Leveraging Runtime Resource Capacity Enforcement , 2014, 2014 26th Euromicro Conference on Real-Time Systems.

[5]  Lothar Thiele,et al.  Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling , 2005, EMSOFT.

[6]  Andrea Francini,et al.  Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[7]  Sanjoy K. Baruah,et al.  Towards the Design of Certifiable Mixed-criticality Systems , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.

[8]  Kees G. W. Goossens,et al.  Composable Resource Sharing Based on Latency-Rate Servers , 2009, 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools.

[9]  Kees G. W. Goossens,et al.  Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[10]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Rolf Ernst,et al.  System level performance analysis - the SymTA/S approach , 2005 .

[12]  Giorgio C. Buttazzo,et al.  Resource Reservation in Dynamic Real-Time Systems , 2004, Real-Time Systems.

[13]  Rolf Ernst,et al.  Traffic shaping for an FPGA based SDRAM controller with complex QoS requirements , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[14]  Bruce Jacob,et al.  Memory Systems: Cache, DRAM, Disk , 2007 .

[15]  Alan Burns,et al.  Analysis of hard real-time communications , 1995, Real-Time Systems.

[16]  Zonghua Gu,et al.  PT-AMC: Integrating Preemption Thresholds into Mixed-Criticality Scheduling , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[17]  Kai Richter.  Compositional scheduling analysis using standard event models: the SymTA/S approach , 2005 .

[18]  Andreas D. Bovopoulos,et al.  A simple and efficient bus management scheme that supports continuous streams , 1995, TOCS.

[19]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[20]  Jef L. van Meerbergen,et al.  Memory arbitration and cache management in stream-based systems , 2000, DATE '00.

[21]  Lothar Thiele,et al.  Real-time calculus for scheduling hard real-time systems , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[22]  Rolf Ernst,et al.  Monitoring of Workload Arrival Functions for Mixed-Criticality Systems , 2013, 2013 IEEE 34th Real-Time Systems Symposium.

[23]  Francisco J. Cazorla,et al.  Timing effects of DDR memory systems in hard real-time multicore architectures , 2013, ACM Trans. Embed. Comput. Syst..

[24]  Lothar Thiele,et al.  Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[25]  Lui Sha,et al.  Memory Access Control in Multiprocessor for Real-Time Systems with Mixed Criticality , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[26]  Kees G. W. Goossens,et al.  Predator: A predictable SDRAM memory controller , 2007, 2007 5th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).

[27]  Albert G. Greenberg,et al.  Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches , 1997, IEEE J. Sel. Areas Commun..

[28]  Michael Paulitsch,et al.  Quality of service capabilities for hard real-time applications on multi-core processors , 2013, RTNS '13.

[29]  Alan Burns,et al.  Dual Priority Assignment: A Practical Method For Increasing Processor Utilisation , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[30]  Nathan Fisher,et al.  Efficient Admission Control for Enforcing Arbitrary Real-Time Demand-Curve Interfaces , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[31]  Somayeh Sardashti,et al.  The gem5 simulator , 2011, CARN.

[32]  Alan Burns,et al.  Response-Time Analysis for Mixed Criticality Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.