{"title":"EEDS/spl I.bar/NR: an online energy-efficient I/O device scheduling algorithm for hard real-time systems with non-preemptible resources","authors":"Hui-Sheng Cheng, S. Goddard","doi":"10.1109/ECRTS.2006.9","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.9","url":null,"abstract":"The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of online energy-aware I/O scheduling/or hard real-time systems based on the preemptive periodic task model with non-preemptible shared resources. We extend the concept of device slack to support non-preemptible shared resources; and propose an online energy-aware I/O scheduling algorithm: energy-efficient device scheduling with non-preemptible resources (EEDS_NR). The EEDS_NR algorithm utilizes device slack to perform device power state transitions to save energy, without jeopardizing temporal correctness. An evaluation of the approach shows that it yields significant energy savings","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126010513","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 feasibility analysis of multiprocessor real-time systems","authors":"Sanjoy Baruah, N. Fisher","doi":"10.1109/ECRTS.2006.29","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.29","url":null,"abstract":"The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for determining whether a given collection of jobs can be scheduled to meet all deadlines upon a specified multiprocessor platform - these tests may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826459","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":"Design and performance of a fault-tolerant real-time CORBA event service","authors":"H. Huang, C. Gill","doi":"10.1109/ECRTS.2006.8","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.8","url":null,"abstract":"Developing distributed real-time and embedded (DRE) systems in which multiple quality-of-service (QoS) dimensions must be managed is an important and challenging problem. This paper makes three contributions to research on multi-dimensional QoS for DRE systems. First, it describes the design and implementation of a fault-tolerant real-time CORBA event service for the ACE ORB (TAO). Second, it describes our enhancements and extensions to features in TAO, to integrate real-time and fault tolerance properties. Third, it presents an empirical evaluation of our approach. Our results show that with some refinements, real-time and fault-tolerance features can be integrated effectively and efficiently in a CORBA event service","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128021127","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":"i-GAME: an implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks","authors":"A. Koubâa, M. Alves, E. Tovar","doi":"10.1109/ECRTS.2006.13","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.13","url":null,"abstract":"The IEEE 802.15.4 medium access control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its guaranteed-time slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may be only partially used, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS allocation mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384577","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":"Hierarchical event streams and event dependency graphs: a new computational model for embedded real-time systems","authors":"K. Albers, F. Bodmann, F. Slomka","doi":"10.1109/ECRTS.2006.12","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.12","url":null,"abstract":"One of the important aspects of schedulability analysis is the model used to describe the system and its timing behavior. On one side, the accuracy of the test strongly depends on the accuracy of the model. On the other side, a detailed model could lead to an unaccaptable evaluation time. In this paper we propose a new model, the hierarchical event streams, which allows a high accuracy. We provide an efficient feasibility test for the model based on the context of demand and request bound function. Additionally we will provide a methodology to extract this model out of a control-flow graph efficiently. Together this allows a more accurate and efficient schedulability analysis of event driven real-time systems","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982250","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":"Real-time multi-agent support for decentralized management of electric power","authors":"H. Wedde, S. Lehnhoff, E. Handschin, O. Krause","doi":"10.1109/ECRTS.2006.22","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.22","url":null,"abstract":"Establishing clean or renewable energy sources involves the problem of adequate management for the networked power sources, in particular since producers are at the same time also consumers, and vice versa. We describe the first phases of the joint R&D project DEZENT between the School of Computer Science and the College of Electrical Engineering at the University of Dortmund, devoted to decentralized and adaptive electric power management through a distributed real-time multi-agent architecture. Unpredictable consumer requests or producer problems, under distributed control or local autonomy will be the major novelty. We present a distributed real-time negotiation algorithm involving agents on different levels of negotiation, on behalf of producers and consumers of electric energy. Despite the lack of global overview we are able to prove that in our model no coalition of malicious users could take advantage of extreme situations like arising from an abundance as much as from any (artificial) shortage of electric power that are typical problems in \"free\" or deregulated markets. Our multi-agent system exhibits a very high robustness against power failures compared to centrally controlled architectures. In extensive experiments we demonstrate how, in realistic settings of the German power system structure, the novel algorithms can cope with unforeseen needs and production specifics in a very flexible and adaptive way, taking care of most of the potentially hard deadlines already on the local group level (corresponding to a small subdivision). We further demonstrate that under our decentralized approach customers pay less than under any conventional (global) management policy or structure","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"6 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116870041","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":"Clairvoyant non-preemptive EDF scheduling","authors":"Cecilia Ekelin","doi":"10.1109/ECRTS.2006.7","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.7","url":null,"abstract":"It is well-known that although EDF is optimal for preemptive systems this is not the case in non-preemptive ones. The problem is that for a non-preemptive scheduler to be optimal, it must sometimes use inserted idle times. In this paper we show how the performance of non-preemptive EDF can be improved by using a form of lookahead that identifies when idle time insertion is necessary. Experiments show that this modification increases the number of schedulable task sets by up to 100%. Furthermore, by using a form of lazy evaluation the algorithm runs in O(nlog n) which is the same as plain EDF","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801591","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":"Optimal on-line scheduling of multiple control tasks: a case study","authors":"A. Cervin, P. Alriksson","doi":"10.1109/ECRTS.2006.18","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.18","url":null,"abstract":"We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy that is optimal in the sense that it minimizes a quadratic performance criterion for the overall system. The optimal scheduling decision at each point in time is a function of the states of the controlled plants. To be able to solve the scheduling problem for realistic examples, we use the technique of relaxed dynamic programming to compute suboptimal solutions with error bounds. The approach is compared to earlier approaches in a case study involving simultaneous control of one ball-and-beam process and two DC-servo processes. We also show how the scheduling policy can be modified to allow for background tasks to execute when the need for control is small","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121145855","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":"A formal approach to multi-dimensional sensitivity analysis of embedded real-time systems","authors":"R. Racu, A. Hamann, R. Ernst","doi":"10.1109/ECRTS.2006.5","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.5","url":null,"abstract":"System robustness is a major concern in the design of efficient and reliable state-of-the-art heterogenous embedded real-time systems. Due to complex component interactions, resource sharing and functional dependencies, one-dimensional sensitivity analysis cannot cover all effects that modifications of one system property may have on system performance. One reason is that the variation of one property can also affect the values of other system properties requiring new approaches to keep track of simultaneous parameter changes. In this paper we present a heuristic and a stochastic approach suited for the multi-dimensional sensitivity analysis of large heterogenous embedded systems with complex timing constraints","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131047964","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":"Resource management for control tasks based on the transient dynamics of closed-loop systems","authors":"R. Castane, P. Martí, M. Velasco, A. Cervin","doi":"10.1109/ECRTS.2006.24","DOIUrl":"https://doi.org/10.1109/ECRTS.2006.24","url":null,"abstract":"This paper presents a resource management strategy for control tasks that maximizes control performance within the available resources by readjusting the task periods at runtime. A feedback scheduler is used to determine on-line the optimal task periods considering the response over a finite time horizon of the plants controlled by arbitrary linear control laws. We show how this problem can be expressed as an optimization problem, where the objective function relates the sampling periods to the transient responses of the controlled plants, and where restrictions are based on EDF schedulability constraints. For the general case, the solution of the optimization problem is computationally expensive, and thus, an approximate procedure to be executed on-line has been developed. We present simulation results that validate the presented approach","PeriodicalId":145339,"journal":{"name":"18th Euromicro Conference on Real-Time Systems (ECRTS'06)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121489115","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}