{"title":"The FTT-ethernet protocol: merging flexibility, timeliness and efficiency","authors":"P. Pedreiras, L. Almeida, Paolo Gai","doi":"10.1109/EMRTS.2002.1019195","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019195","url":null,"abstract":"Despite having been designed to interconnect office equipment such as computers and printers, since its early daysEthernet has also been considered for use in the industrial domain. However, it was not originally developed to meet the requirements of real-time industrial automation systems and it was commonly considered unsuited for applications at the field level, i.e.to interconnect sensors, actuators and controllers. Therefore, along its 30 years of existence, several proposals have been presented to make this protocol exhibit real-timebehaviour. Nevertheless, these proposals either require specialised hardware, or are suited to soft-real-time operation only, or are bandwidth or response-time inefficient. This paper presents an overview about the work previously done towards real-time communication on Ethernet. Then, it presents a new protocol, FTT-Ethernet, which relies on common network adapters and on a new transmission control named master/multi-slave that efficiently supports hard-real-time operation in a flexible way.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129745901","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}
Rodrigo M. Santos, J. Urriza, Jorge Santos, J. Orozco
{"title":"Heuristic use of singularities for on-line shcheduling of real-time mandatory/reward-based optional systems","authors":"Rodrigo M. Santos, J. Urriza, Jorge Santos, J. Orozco","doi":"10.1109/EMRTS.2002.1019190","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019190","url":null,"abstract":"The paper addresses the problem of on-line scheduling of mandatory/reward-based systems in which tasks have a hard real-time mandatory part and an optional part with a non-decreasing reward function associated to its execution. Four methods, generically called SH, are proposed. They are based on the detection of singularities, special instants that appear along the execution of the system. By applying some heuristic rules, the singularities and some of the following slots are used to process optional parts. To the best of the authors' knowledge, papers published up to now on the subject of reward maximization require the functions to be continuously differentiable. Moreover, they cannot be executed on-line. On the contrary, the only requirement of the SH methods is that the functions are computable at every instant. After the system is proved to be schedulable by any of the available exact test off-line techniques, SH methods can be executed on-line. Their performance is evaluated using simulations performed on a synthetic set of tasks proposed in one of the outstanding papers on the subject and on sets of tasks randomly generated. The results are analysed and explained. The main conclusionis that , in all cases, the SH methods outperform the Best Incremental Return, often used as a yardstick.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439742","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}
M. Alves, E. Tovar, F. Vasques, G. Hammer, Klaus Röther
{"title":"Real-time communications over hybrid wired/wireless PROFIBUS-based networks","authors":"M. Alves, E. Tovar, F. Vasques, G. Hammer, Klaus Röther","doi":"10.1109/EMRTS.2002.1019194","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019194","url":null,"abstract":"PROFIBUS is an international standard (IEC 61158) for factory-floor communications, with some hundreds of thousands of world-wide installations. However, it does not include any wireless capabilities. In this paper we propose a hybrid wired/wireless PROFIBUS solution where most of the design options are made in order to guarantee the proper real-time behaviour of the overall network. We address the timing unpredictability problems placed by the co-existence of heterogeneous transmission media in the same network. Moreover, we propose a novel solution to provide inter-cell mobility to PROFIBUS wireless nodes.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056389","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":"Weakly hard real-time constraints on controller area network","authors":"I. Broster, G. Bernat, A. Burns","doi":"10.1109/EMRTS.2002.1019193","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019193","url":null,"abstract":"For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with bounded network faults. However the worst-case scenario (the critical instant) used by the analysis is extremely pessimistic compared to the rest of the invocations in the hyperperiod. We use weakly hard constraints to provide upper bounds on the maximum number of missed deadlines under fault conditions. By allowing some deadlines to be missed (around the critical instant) the weakly-hard schedulability of the system can be guaranteed at much higher levels of faults. This paper presents a response time based formulation that provides a guarantee on the weakly-hard schedulability of messages. Simulation results based on CAN and the Latest Send Time-CAN protocol show that because of the pessimism of the approach, in fact almost all messages meet their deadlines.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126062093","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}
Dag Nyström, A. Tesanovic, C. Norström, J. Hansson, Nils-Erik Bånkestad
{"title":"Data management issues in vehicle control systems: a case study","authors":"Dag Nyström, A. Tesanovic, C. Norström, J. Hansson, Nils-Erik Bånkestad","doi":"10.1109/EMRTS.2002.1019205","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019205","url":null,"abstract":"We present a case study of a class of embedded hard real-time control applications in the vehicular industry which, in addition to meeting transaction and task deadlines, emphasize data validity requirements. We elaborate on how a database could be integrated into the studied application and how the database management system (DBMS) could be designed to suit this particular class of systems.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114218243","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":"Multiprocessor DSP scheduling in system-on-a-chip architectures","authors":"Paolo Gai, Luca Abeni, G. Buttazzo","doi":"10.1109/EMRTS.2002.1019203","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019203","url":null,"abstract":"Next generation embedded systems will demand applications with increasing complexity, so a standard uniprocessor microcontroller architecture will likely be unsuited to support. A possible solution to cope with embedded applications with high computational requirements is to adopt multiple-processor-on-a-chip architectures. The paper discusses the problem of multiprocessor scheduling for asymmetric architectures composed of a general purpose CPU and a DSP. The challenging issue addressed in this work is to verify whether the use of a dedicated processor can effectively enhance the performance of an embedded system, still maintaining some kind of real-time guarantee. In particular, we provide a method for increasing the schedulability bound in the considered architecture, allowing a more efficient use of the computational resources.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123101278","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}
Saowanee Saewong, R. Rajkumar, J. Lehoczky, M. Klein
{"title":"Analysis of hierar hical fixed-priority scheduling","authors":"Saowanee Saewong, R. Rajkumar, J. Lehoczky, M. Klein","doi":"10.1109/EMRTS.2002.1019197","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019197","url":null,"abstract":"Reservation-based operating systems provide applications with guaranteed and timely access to system resources. One of their chief benefits is temporal isolation, which prevents the timing mis-behavior of one task from interfering with other tasks. Such a benefit is appealing enough that many systems [2, 8] desire to recursively apply this reservation model to each of their components. This recursive application provides flexible load isolation among applications, users and other high-level resource management entities such as aggregated flows for network bandwith. The hierarchical reservation study can be applied to hierarchical schedulers [5, 6], that support heterogenous scheduling algorithms. We propose and analyze a hierarchical reservation model in the context of fixed-priority scheduling, rate-monotonic and deadline-monotonic, as used in systems such as the Resource Kernel [11]. Detailed schedulability analyses under both deferrable-server and sporadic-server replenishment schemes, including exact completion time tests under hierarchical deadline-monotonic schedulers, are presented. We also derive the least upper scheduling bound for hierarchicalrate-monotonic schedulers. Finally, we describe how to apply multi-reserve PCP [4 ], an extension of the Priority Ceiling Protocol for reservation-based systems, to allow tasks to share non-preemptable resources across the hierarchy.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134269879","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":"Integrating a periodic and recurrent tasks on fair-scheduled multiprocessors","authors":"A. Srinivasan, Philip Holman, James H. Anderson","doi":"10.1109/EMRTS.2002.1019182","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019182","url":null,"abstract":"We propose two server implementations for multiplexing aperiodic and recurrent real-time tasks in fair-scheduled multiprocessor systems. We also provide admission-control tests for scheduling hard aperiodic tasks. Further, we consider several complexities, most of which arise because of the parallelism available in multiprocessor systems, and present techniques to handle them. Finally, we present experimental results that demonstrate the effectiveness of our implementations.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116361283","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":"Enhancing the flexibility and the quality of service of autonomous mobile robotic applications","authors":"H. Hassan, José-Enrique Simó-Ten, A. Crespo","doi":"10.1109/EMRTS.2002.1019201","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019201","url":null,"abstract":"Autonomous mobile robots perform their activities in unstructured, dynamic and unpredictable environments. The robot state, the objectives to be fulfilled and the environmental conditions have influence in the variability of the system load. In the face of such environmental uncertainty, the computational requirements of recognition tasks are variable and dependent on the number of objects perceived in the scenes. It also arises that to ensure robot safety, the temporal requirements of reactive tasks have to be proportionally adjusted to the actual robot speed. Traditional robot control architectures have been designed ignoring these aspects and hence lead to extremely expensive and underutilised system designs. To overcome such drawbacks a feedback control scheduler (FCS) together with a task model that permit the adaptation of the temporal requirements of the tasks depending on the robot speed and on the environmental conditions are proposed. Furthermore, to undertake robot QoS improvement, a flexible server (FS) is integrated with the FCS in a global real-time architecture.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980093","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":"POSIX-compatible application-defined scheduling in MaRTE OS","authors":"M. A. Rivas, M. G. Harbour","doi":"10.1109/EMRTS.2002.1019186","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019186","url":null,"abstract":"Presents an application program interface (API) that enables applications to use application-defined scheduling algorithms in a way compatible with the scheduling model defined in POSIX. Several application-defined schedulers, implemented as special user threads, can coexist in the system in a predictable way. This API is currently implemented on our operating system MaRTE OS. We plan to propose it for a future revision of the POSIX standard.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121972324","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}