{"title":"Thermal-Aware Schedulability Analysis for Fixed-Priority Non-preemptive Real-Time Systems","authors":"Javier Pérez-Rodríguez, P. Yomsi","doi":"10.1109/RTSS46320.2019.00024","DOIUrl":"https://doi.org/10.1109/RTSS46320.2019.00024","url":null,"abstract":"Technology advances in microprocessor design have resulted in high device density and performance during the last decades. More components are fabricated on the chip die and millions, if not billions, of instructions can now be executed within microseconds. A consequence of this advancement is heat dissipation by the microprocessors. In this context, elevated on-chip temperature issues have become an important subject for the design of future generations of microprocessors, especially in avionics and automotive industries. In this paper, we address the scheduling problem of non-preemptive periodic tasks on a single processor platform under thermal-aware design. We assume that the tasks are scheduled by following any Fixed-Task-Priority (FTP) scheduler (e.g., Rate Monotonic (RM) or Deadline Monotonic (DM)) and we propose a unique framework wherein we capture both the temporal and thermal behavior of the system. Then, we present two new thermal-aware scheduling strategies, referred to as NP-HBC and NP-CBH, to keep the system temperature within specified parameters and we derive their respective schedulability analysis. Finally, we evaluate the performance of the proposed theoretical results through intensive simulations.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132592376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Road Ahead: It Doesn't Get Any Easier","authors":"A. V. Tilborg","doi":"10.1109/REAL.2004.54","DOIUrl":"https://doi.org/10.1109/REAL.2004.54","url":null,"abstract":"The accomplishments of the real-time systems research community over the past 25 years have been substantial. Starting from a diffuse base of ideas from computer science, software engineering, operations research, queuing theory and other related disciplines, the real-time systems community established its distinct identity as a mainline research field able to achieve big impacts in real-world systems. Whether in networks and telecommunications, vehicle management systems, industrial process control, avionics and spacecraft, or many other applications, the real-time computing research community devised concrete techniques and technologies to ensure predictable, safe, and reliable operation of complex automated systems constrained by deadlines. But the story of the real-time computing research community does not end with these successes. The time-driven systems envisioned for the future present new challenges not even imagined at the first RTSS event a generation ago. At this Symposium, we have an opportunity to reminisce proudly about the accomplishments of the past quarter century, and to draw a bead on the challenges of the future.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"21 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Let's Get the Real into Real-Time Computing","authors":"J. Stankovic","doi":"10.1109/REAL.2004.28","DOIUrl":"https://doi.org/10.1109/REAL.2004.28","url":null,"abstract":"Since this is the 25 anniversary of RTSS, I begin this Keynote presentation by highlighting, with a critical eye, a number of key technical successes from the past 25 years. While it is satisfying that our field has been very successful and productive, I prefer to emphasize the future. Consequently, a large part of the presentation focuses on multiple technical ideas and research directions for the future of real-time computing. One theme for the proposed future directions is “We need to get the real into real-time computing.” If I am feeling brave I will conclude with several things we should not be pursuing.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling Real-Time Systems","authors":"J. Sifakis","doi":"10.1109/REAL.2004.34","DOIUrl":"https://doi.org/10.1109/REAL.2004.34","url":null,"abstract":"Modeling real-time systems raises non trivial problems for the definition of usable modeling languages and the application of model-based development approaches. We identify key problems and present corresponding research directions for the incremental construction of timed models for real-time systems. We present a framework that may provide some solutions and an associated methodology for model construction. Timed models of real-time systems are obtained by adding timing constraints to their application software. These constraints take into account execution times of atomic statements, the dynamics of the external environment, as well as quality of service requirements. The framework combines two kinds of composition operators for timed components: x Restriction operators which are unary operators parameterized by a safety property. Their application on a component restricts its behavior so as to meet the associated property. Dynamic priorities correspond to a class of restriction operators which preserve deadlockfreedom of their arguments. x Parallel composition operators, parameterized by interaction models. These models describe interactions between actions offered by the composed components and their associated synchronization requirements. We show that the combination of parallel composition and restriction operators allows compositional modeling of real-time systems, in particular of aspects related to heterogeneous interaction and execution, resource sharing and scheduling. Scheduling policies are modeled by dynamic priorities. The framework supports composition of scheduling policies and provides compositionality and composability results for deadlock-freedom of scheduled systems. We show applications of these results, including model-based development of applications in Esterel and real-time Java, as well as a partial implementation of the framework in Verimag’s IF toolset.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132056331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sun-Tae Chung, O. González, K. Ramamritham, Chia Shen
{"title":"CReMeS: A CORBA Compliant Reflective Memory Communication Service","authors":"Sun-Tae Chung, O. González, K. Ramamritham, Chia Shen","doi":"10.1109/REAL.2000.895995","DOIUrl":"https://doi.org/10.1109/REAL.2000.895995","url":null,"abstract":"We present CReMeS a CORBA-compliant design and implementation of a new real-time communication service. It provides for efficient predictable and scalable communication between information producers and consumers. The CReMeS architecture is based on MidART's Real-Time Channel-based Reflective Memory (RT-CRM) abstraction. This architecture supports the separation of QoS specification between producer and consumer of data and employs a user-level scheduling scheme for communicating real-time tasks. These help us achieve end-to-end predictability and allows our service to scale. The CReMeS architecture provides a CORBA interface to applications and demands no changes to the ORB layer and the language mapping layer. Thus it can run on non real-time Off-The-Shelf ORBs enables applications on these ORBs to have scalable and end-to-end predictable asynchronous communication facility. In addition an application designer can select whether to use an out-of-band channel or the ORB GIOP/IIOP for data communication. This permits a trade-off between performance predictability and reliability. Experimental results demonstrate that our architecture can achieve better performance and predictability than a real-time implementation of the CORBA Even Service when the out-of-band channel is employed for data communication it delivers better predictability with comparable performance when the ORB GIOP/IIOP is used.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128708789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scheduling The Can Bus With Earliest Deadline Techniques","authors":"M. Natale","doi":"10.1109/REAL.2000.896015","DOIUrl":"https://doi.org/10.1109/REAL.2000.896015","url":null,"abstract":"Controller area networks (CANs) are widely used in real-time automobile control and are gaining wider acceptance as a standard for factory automation. This paper discusses the applicability of earliest-deadline-first (EDF) techniques to the scheduling of CAN messages. EDF can guarantee higher network utilization than fixed-priority schemes like deadline- or rate-monotonic (DM, RM), but it is difficult to implement in local area networks or local buses. The reason is the need for updating the deadlines (priorities) at each scheduling round and the limited number of priority levels offered by the arbitration protocol. This deadline encoding problem results in an additional priority inversion factor when considering the schedulability analysis of hard real-time messages. This paper describes an effective deadline encoding method and discusses its implementation and its effects on the guarantee analysis. In spite of a limited processor overhead (less than 5% of CPU time), the proposed EDF implementation allows an increase (up to 20%) in the feasible network workload. This tradeoff will be made more convenient as controller technology evolves.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122454370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"It's Time to Get Physical","authors":"D. Tennenhouse","doi":"10.1109/RTSS.1999.10001","DOIUrl":"https://doi.org/10.1109/RTSS.1999.10001","url":null,"abstract":"","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalable Network Support for Multimedia, Real-Time Communication","authors":"J. Kurose","doi":"10.1109/RTSS.1999.10002","DOIUrl":"https://doi.org/10.1109/RTSS.1999.10002","url":null,"abstract":"","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124270382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing Interprocess Communication for Embedded Real-Time Systems","authors":"S. Poledna","doi":"10.1109/REAL.1996.563727","DOIUrl":"https://doi.org/10.1109/REAL.1996.563727","url":null,"abstract":"S. Poledna Abstract: This paper discusses the problem of message-based interprocess communication in embedded real-time control systems and its appropriate operating system support. Based on state message semantics a novel optimization approach for interprocess communication is introduced. This approach provides high efficiency with respect to execution time and memory requirements. Its high efficiency is achieved by exploiting a priori available knowledge about the static system structure in an embedded system for optimizations. The operating system can thus provide a general purpose state message communication mechanism. But instead of using a general purpose implementation the actual implementation is tailored for a given application scenario. A case study based on a real application in the context of automotive electronics is carried out. This study shows the superior performance of the presented optimization strategy compared to event-messages and unoptimized state messages. Furthermore, it shows that systematic application of message-based interprocess communication becomes possible with the optimized communication mechanism. The optimized state message mechanism presented here has influenced the design of the operating system ERCOS [17] which will be used by Bosch for a next generation of automotive control units. for a given application scenario. A case study based on a real application in the context of automotive electronics is carried out. This study shows the superior performance of the presented optimization strategy compared to event-messages and unoptimized state messages. Furthermore, it shows that systematic application of message-based interprocess communication becomes possible with the optimized communication mechanism. The optimized state message mechanism presented here has influenced the design of the operating system ERCOS [17] which will be used by Bosch for a next generation of automotive control units.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reducing the number of clock variables of timed automata","authors":"C. Daws, S. Yovine","doi":"10.1109/REAL.1996.563702","DOIUrl":"https://doi.org/10.1109/REAL.1996.563702","url":null,"abstract":"We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks whose values are relevant for the evolution of the system. The second one detects sets of clocks that are always equal. We implemented the algorithms and applied them to several case studies. These experimental results show that an appropriate encoding of the state space, based on the output of the algorithms, leads to a considerable reduction of the memory space allowing a more eficient Verification.","PeriodicalId":228151,"journal":{"name":"IEEE Real-Time Systems Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114260408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
