{"title":"Error-driven QoS management in imprecise real-time databases","authors":"M. Amirijoo, J. Hansson, S. Son","doi":"10.1109/EMRTS.2003.1212729","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212729","url":null,"abstract":"In applications such as Web-applications, e-commerce (electronic commerce), and engine control, the demand for real-time data services has increased. In these applications, requests have to be processed within their deadlines using fresh data. Since the workload of these systems cannot be precisely predicted, they can become overloaded and as a result, deadline and freshness violations may occur. To address this problem we propose a QoS-sensitive (quality of service) approach based on imprecise computation, applied on transactions and data objects. We propose two algorithms FCS-HEF (feedback control scheduling) (highest error first) and FCS-HEDF (feedback control scheduling) (highest error density first) that give a robust and controlled behavior of RTDB (real-time database) in terms of transaction and data preciseness, even for transient overloads and with inaccurate run-time estimates of the transactions. Further, performance experiments show that the propose algorithms out perform a set of baseline algorithms including FCS-EDF (feedback control scheduling) (earliest deadline first), which schedules the transactions using EDF (earliest deadline first).","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127806498","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":"Timing constraints of MPEG-2 decoding for high quality video: misconceptions and realistic assumptions","authors":"D. Isovic, G. Fohler, Elisabeth F. M. Steffens","doi":"10.1109/EMRTS.2003.1212730","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212730","url":null,"abstract":"Decoding MPEG-2 video streams imposes hard real-time constraints for consumer devices such as TV sets. The freedom of encoding choices provided by the MPEG-2 standard results in high variability inside streams, in particular with respect to frame structures and their sizes. In this paper, we identify realistic timing constraints demanded by MPEG-2 video decoding. We present results from a study of realistic MPEG-2 video streams to analyze the validity of common assumptions for software decoding and identify a number of misconceptions. Furthermore, we identify constraints imposed by frame buffer handling and discussed their implications on decoding architecture and timing constraints.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126744356","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 capacity of implicit EDF in wireless sensor networks","authors":"M. Caccamo, L. Y. Zhang","doi":"10.1109/EMRTS.2003.1212752","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212752","url":null,"abstract":"Distributed networks of wireless sensors/actuators will enable the reliable monitoring and intelligent control of the physical environment accomplishing different tasks ranging from space monitoring and surveillance to homeland security without human intervention. Motivated by the observation that many of these applications are safety critical and have hard real-time requirements, this paper focuses on the problem of providing delay and throughput guarantee to real-time messages in wireless sensor networks. It extends the cellular structure described by M. Caccamo et al. (2002) and analyzes the sensor network capacity when messages are scheduled with the implicit-EDF (earliest deadline first) algorithm.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127657408","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 fixed-priority scheduling with restricted interprocessor migrations","authors":"Sanjoy Baruah, John Carpenter","doi":"10.1109/EMRTS.2003.1212744","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212744","url":null,"abstract":"The priority-driven scheduling of periodic and sporadic task systems upon identical multiprocessor platforms is considered, under the restrictions that (i) each job may be assigned exactly one priority throughout its lifetime, and (ii) each job may execute upon only a single processor. It is shown that the feasibility-analysis under these restrictions is intractable (NP-hard in the strong sense). A scheduling algorithm is presented that satisfies these restrictions, and that has a worst-case utilization bound comparable to the worst-case utilization bounds of partitioned scheduling algorithms, and of scheduling algorithms that retain the priority-assignment restriction but allow arbitrary interprocessor migration.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123845839","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 general mathematical model for run-time distributions in a passively replicated fault tolerant system","authors":"Å. Tjora, A. Skavhaug","doi":"10.1109/EMRTS.2003.1212755","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212755","url":null,"abstract":"In many systems, passive replication is used as a method for fault tolerance. A problem with using passive replication in real-time systems is that it can be difficult to analyze the time used by the system if a fault should occur. In this paper, we present a general mathematical model for the run-time distribution of a method in a fault tolerant system where a passive replication technique is used. The model gives this distribution as a function of the run-time distribution of the method in a fault-free system. We also demonstrate how this can be used to compute the probability of a missed deadline in a simple fault-tolerant system.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195696","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 real-time RMI framework for the RTSJ","authors":"A. Borg, A. Wellings","doi":"10.1109/EMRTS.2003.1212749","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212749","url":null,"abstract":"The Real-Time Specification for Java (RTSJ) provides a platform for the development of real-time applications. However, the RTSJ does not take the distribution requirements of real-time applications into consideration. As distribution in Java is often implemented using Java's Remote Method Invocation (RMI), a real-time version of RMI between RTSJ implementations can provide a platform for writing distributed real-time systems. This paper describes a Real-Time RMI (RT-RMI) framework that supports timely invocation of remote objects. The thread classes defined by the RTSJ are used to provide the client and server threading mechanisms. The memory model of the RTSJ is considered to ensure that threads correctly use memory areas and avoid memory leaks in the absence of the garbage collector. New classes are developed to control the threads used throughout the invocation and to provide new semantics for remote objects that can be invoked in a timely fashion.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131208745","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 partitioning among real-time applications","authors":"G. Lipari, Enrico Bini","doi":"10.1109/EMRTS.2003.1212738","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212738","url":null,"abstract":"When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are not violated. A possible way of composing applications is through the resource reservation approach. Each application is handled by a dedicated server that is assigned a fraction of the processor. Using this approach, the system can be seen as a two-level hierarchical scheduler. A considerable amount of work has been recently addressed to the analysis of this kind of hierarchical systems. However, a question is still unanswered: given a set of real-time tasks to be handled by a server, how to assign the server parameters so that the task set is feasible? In this paper, we answer to the previous question for the case of fixed priority local scheduler by presenting a methodology for computing the class of server parameters that make the task set feasible.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131566384","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 utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%","authors":"Björn Andersson, Jan Jonsson","doi":"10.1109/EMRTS.2003.1212725","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212725","url":null,"abstract":"This paper studies preemptive static-priority scheduling on multiprocessors. We consider two approaches: global pfair static-priority scheduling and partitioned traditional static priority scheduling. We prove that if presented algorithms are used and if less than 50% of the capacity is used then all deadlines are met. It is known that no static-priority multiprocessor scheduling algorithm can achieve a utilization bound greater than 50%.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130638708","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":"Fault-tolerant clock synchronization for embedded distributed multi-cluster systems","authors":"M. Paulitsch, W. Steiner","doi":"10.1109/EMRTS.2003.1212750","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212750","url":null,"abstract":"When time-triggered (TT) systems are to be deployed for large embedded real-time (RT) control systems in cars and airplanes, one way to overcome bandwidth limitations and achieve complexity reduction is the organization in clusters of strongly interacting computing nodes with well-defined interfaces. In this case, clock synchronization of different cluster times supports meaningful exchange of time-related data between clusters and allows coordinated control. This paper addresses fault-tolerant clock synchronization of clusters for TT systems that are already internally synchronized. By addressing systematic and stochastic errors of cluster times differently, the influence of systematic errors is eliminated and the quality of synchronization only depends on stochastic errors. Since systematic errors of cluster times are at least an order of magnitude larger than stochastic errors for typical RT embedded control systems, the presented algorithm achieves a significant improvement to known synchronization algorithms. An implementation of the proposed clock synchronization algorithm on top of the Time-Triggered Architecture and experiments show that synchronization is achieved with accuracy values of less than one microsecond.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130661417","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":"Offset-based response time analysis of distributed systems scheduled under EDF","authors":"J. Palencia, M. G. Harbour","doi":"10.1109/EMRTS.2003.1212721","DOIUrl":"https://doi.org/10.1109/EMRTS.2003.1212721","url":null,"abstract":"Offset-based response time analysis of tasks scheduled with fixed priorities has demonstrated to be a powerful tool to analyze many task models with different kinds of timing constraints, like regular periodic tasks, suspending tasks, distributed systems, tasks with varying priorities, multi frame models, etc. Offset-based analysis techniques are capable of performing a global schedulability analysis in distributed systems, as opposed to the less efficient techniques that consider each processing or communication resource as independent. In this paper we extend the offset-based schedulability analysis techniques to system with EDF (earliest deadline first) scheduling, using analytical techniques that are similar to those developed for fixed priority scheduling. With this new analysis, we now have a complete set of techniques to perform the analysis of different task models in distributed heterogeneous systems, i.e., processors and communication networks having either fixed priority or EDF schedulers.","PeriodicalId":120694,"journal":{"name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127735204","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}