{"title":"Exact best-case response time analysis of fixed priority scheduled tasks","authors":"Ola Redell, Martin Sanfridson","doi":"10.1109/EMRTS.2002.1019196","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019196","url":null,"abstract":"We present a solution for exact calculation of the best-case response times of a periodic task set with fixed priorities. The solution is based on the identification of the best-case phasing of a low priority task compared to the higher priority tasks. This phasing occurs when the low priority task is released such that it finishes simultaneously with the releases of all the higher priority tasks, when these have experienced their maximum release jitter. A recurrence equation is applied to find the best-case response time. The dualism between worst-case and best-case response time calculation is characterized. The most important application of the solution is in the analysis of response jitter.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"36 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":"125293189","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 hard real-time bus arbitration protocol based on EIA-709","authors":"A. Bauer, Peter Rössler","doi":"10.1109/EMRTS.2002.1019192","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019192","url":null,"abstract":"Field area networks (fieldbus) are used in a wide area of applications. A lot of different protocols satisfy the needs of the manifold demands of these applications. In process automation, hard real-time requirements make it difficult to use flexible, well established OSI fieldbus systems like e.g. LonWorks (standardized as ANSI/EIA-709) which is now mainly used for home and building automation. Companies developing LonWorks products are starting to evaluate the possibilities of using the same technology for high-speed and real-time applications in order to avoid the overhead of several different communication protocols. This paper describes the development and implementation of a hard real-time bus arbitration scheme for the high-speed network controller \"L-Chip\", which processes the lower three layers of the EIA-709 protocol. It is shown that the approach presented herein combines optimized bandwidth utilization, fault tolerance and compatibility to existing implementations with the adherence to hard deadlines.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"24 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":"122371796","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":"Formal data analysis of timed finite state systems","authors":"Jürgen Ruf, T. Kropf","doi":"10.1109/EMRTS.2002.1019206","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019206","url":null,"abstract":"Formal verification has become an alternative to simulation for the validation of systems. In particular, temporal logic model checking of finite state machines is a widely accepted verification technique. It automatically proves the correctness of design specifications. There exist several approaches extending model checking for the verification of timed systems. Things become more complex if additional multivalued signals are added to the systems. In this constellation, time effects and data dependencies merge. Therefore, a stand-alone model checking approach is in many cases not sufficient for verification, especially if extreme values of signals have to be determined. We extend an existing real-time finite state model by multivalued signals (ranges, enumerations and bit vectors). We present algorithms for computing minimal and maximal values of signals in specified states or within certain time bounds. We show the practicability of our approach by means of a case study.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"15 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":"123908652","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":"On relaxing task isolation in overrun handling to provide probabilistic guarantees to soft real-time tasks with varying execution times","authors":"Kanghee Kim, L. L. Bello, S. Min, O. Mirabella","doi":"10.1109/EMRTS.2002.1019199","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019199","url":null,"abstract":"Task-level or job-level isolation is commonly used in real-time systems to prevent a job that overruns from affecting jobs belonging to other tasks (task-level isolation) or to the same task (job-level isolation). Although such an isolation provides the desired protection and simplifies analysis, it often results in degraded performance (in terms of deadline meeting) because it limits the exploitation of residual processor time resulting from jobs that underruns. We propose a new overrun handling method called randomized dropping that relaxes the isolation to make effective use of such residual processor time. We apply the proposed randomized dropping to the EDF scheduling and give an analysis technique to compute the probability of deadline meeting. Experimental results show that the proposed overrun handling method outperforms previous approaches based task-level or job-level isolation.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"63 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":"128155694","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":"'QoS Safe' kernel extensions for real-time resource management","authors":"R. West, Jason Gloudon","doi":"10.1109/EMRTS.2002.1019188","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019188","url":null,"abstract":"General-purpose operating systems are ill-equipped to meet the quality of service (QoS) requirements of complex real-time applications. Consequently, many classes of realtime applications have either been carefully developed to compensate for inadequate system support, or they have been developed to run on special purpose systems. This paper focuses on a safe extension architecture for general purpose systems, to allow applications to customize the behavior of the system for their individual needs. Using Linux as the basis for our work, we describe how application programmers can safely incorporate `service extensions¿ into the kernel, so that application-specific QoS guarantees can be provided. We introduce the notion of `QoS safety¿, which is concerned with meeting the QoS constraints of applications while maintaining system integrity. Our safe extension architecture supports the dynamiclinking of code into the address space of the kernel, to affect service management decisions. Extensions are written in a type-safe language, to monitor and adapt resource usage on behalf of specific applications. Experimental results show that safe kernel extensions can lead to fewer service violations (and, hence, better qualities of service) for realtime tasks, compared to user-level methods that monitor and adapt system resources.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"94 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":"116962630","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":"Managing multi-mode tasks with time cost and quality levels using optimal discrete control synthesis","authors":"H. Marchand, É. Rutten","doi":"10.1109/EMRTS.2002.1019204","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019204","url":null,"abstract":"Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a functionality with different levels of quality (e.g., computation approximation), and cost (e.g., computation time, energy). It is complex to control the switching of modes in order to insure properties like bounding cost while maximizing quality. We outline a technique for the automatic generation of such controllers involving an automaton-based formal model, and using optimal discrete control synthesis.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"11 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":"122335928","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":"Robustness results concerning EDF scheduling upon uniform multiprocessors","authors":"Sanjoy Baruah","doi":"10.1109/EMRTS.2002.1019189","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019189","url":null,"abstract":"The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF-feasibility analysis algorithm, which is superior to previously-proposed algorithms.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"28 3 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":"131000871","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":"Scope-tree: a program representation for symbolic worst-case execution time analysis","authors":"Antoine Colin, G. Bernat","doi":"10.1109/EMRTS.2002.1019185","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019185","url":null,"abstract":"Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of code depends on the sizes or values of its input data or local parameters. The WCET of a function call may vary depending on the caller and parameters. We propose an approach to express the WCET of a program or sub-program as a symbolic expression. The obtained parametric WCET can then be later evaluated using the knowledge of input data and system configuration parameters. In this paper we present the concept of scope-tree as a generalisation of the traditional syntax tree representation of programs. In addition to their WCET, scopes are associated with an expression stating their maximum execution frequency and some variable declarations. These variables may be used for example to express data-dependent number of iterations or non-rectangular loops. We also present how the scope tree may be used to express inter-scope relations (e.g. mutually exclusive paths, loop down-sampling). Finally, this paper presents the use of scope-trees and scope-tree modifications on an example.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"3 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":"123938040","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 QoS-sensitive approach for timeliness and freshness guarantees in real-time databases","authors":"K. Kang, S. Son, J. Stankovic, T. Abdelzaher","doi":"10.1109/EMRTS.2002.1019200","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019200","url":null,"abstract":"The demand for real-time database services has been increasing recently. Examples include sensor data fusion, decision support, Web information services, and online trading. In these applications, it is desirable to execute transactions within their deadlines using temporally consistent data. Due to the high service demand, real-time databases can be overloaded. As a result, many transactions may miss their deadlines, or data temporal consistency constraints can be violated. To address these problems, we present a QoS management scheme to support guarantees on deadline miss ratio and data freshness (temporal consistency) even in the presence of unpredictable workloads and data access patterns. Using our approach, admitted user transactions can be processed in time using fresh data. A simulation study shows that our QoS-sensitive approach can achieve a significant performance improvement, in terms of deadline miss ratio and data freshness, compared to several baseline approaches. Furthermore, our approach shows a comparable performance to the theoretical oracle that is privileged by a complete future knowledge of data accesses.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"81 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":"125007969","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":"Schedulability analysis of window-constrained execution time tasks for real-time control","authors":"Patricia Balbastre Betoret, I. Ripoll, A. Crespo","doi":"10.1109/EMRTS.2002.1019181","DOIUrl":"https://doi.org/10.1109/EMRTS.2002.1019181","url":null,"abstract":"Feasibility tests for hard real-time systems provide information about the schedulability of a set of tasks. However, this information is a yes or no answer whether the task set achieves the test or not. From the system design point of view, it would be useful to have more information, for example, how much can one vary some task parameters, such as computation time, without jeopardizing the system feasibility. The aim of the work is to provide a method to determine how much a task can increase its computation time, maintaining the system feasibility under a dynamic priority scheduling. This extra time can be determined not only in all the task activations, but in n of a window of m task invocations. This is what we call a window-constrained execution time system. In control applications, this information can be used to execute supervision activities, such as model updating which is not required to be executed in all the periods, or to determine new controller parameters for the current operating conditions. In fault tolerance, this information allows us to recover n faults in m activations.","PeriodicalId":183227,"journal":{"name":"Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","volume":"8 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":"123177796","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}