2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)最新文献_第4页

A Generic Framework for Monitoring Timing Constraints over Uncertain Events 不确定事件时序约束监测的通用框架

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.6

Honguk Woo, A. Mok, Chan-Gun Lee

{"title":"A Generic Framework for Monitoring Timing Constraints over Uncertain Events","authors":"Honguk Woo, A. Mok, Chan-Gun Lee","doi":"10.1109/RTSS.2006.6","DOIUrl":"https://doi.org/10.1109/RTSS.2006.6","url":null,"abstract":"This paper provides a comprehensive approach to the problem of monitoring timing constraints over event streams for which the timestamp values are inherently uncertain. We first propose a generic framework for capturing the early detection of the violation of timing constraints, based on the notion of probabilistic violation time. In doing so, we provide a systemic approach for deriving a set of necessary constraints at compilation time. Our work is innovative in that the framework is formulated to be \"modular\" with respect to the probability distributions on timestamp values. We demonstrate the applicability of the framework for two different timestamp models, Gaussian and histogram. The Gaussian model is appropriate for representing event timing from a wide variety of sensors with well-modelled physical noise characteristics; we show how we can efficiently derive the probabilistic violation time of timing constraints by exploiting the relation between the Gaussian distribution parameters. The histogram model can be used where the timestamps of events are available from measurements only as arbitrary probability distributions: we show how to derive an efficient timing constraint monitoring method for the histogram model","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116378068","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}

引用次数: 8

Mutual Consistency in Real-Time Databases 实时数据库中的相互一致性

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.30

Abhay Jha, Ming Xiong, K. Ramamritham

{"title":"Mutual Consistency in Real-Time Databases","authors":"Abhay Jha, Ming Xiong, K. Ramamritham","doi":"10.1109/RTSS.2006.30","DOIUrl":"https://doi.org/10.1109/RTSS.2006.30","url":null,"abstract":"A real-time database is composed of real-time objects whose values remain valid only within their validity intervals. Each object in the database models a real world entity. The freshness of these objects is maintained by update transactions that sample the real world entities. The literature proposes various ways to derive a schedule of transactions that preserves the freshness (also known as absolute consistency) of these objects. But these approaches do not take care of the mutual consistency of the objects, i.e., whether together they represent a logical state of the system. We investigate the problem of checking whether, given an update transaction schedule, a periodic query would be able to read mutually consistent values. We propose solutions for both single- and multiple-query cases in the presence of non-preemptable query executions. Specifically, we first investigate formulas that give the maximal value of mutual gaps among a set of data read at a certain point in time. (A mutual gap for two object values read from the database refers to the difference between the times at which the two objects were updated.) We then propose design approaches to (1) decide the period and relative deadline of a query so that it would guarantee mutual consistency; (2) decide if a given set of queries with relative deadlines and periods can guarantee mutual consistency. Finally, we suggest ways of reducing the complexity of our proposed approaches for both harmonic periods and general cases","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114186373","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}

引用次数: 27

Principles for the Prediction of Video Decoding Times Applied to MPEG-1/2 and MPEG-4 Part 2 Video 应用于MPEG-1/2和MPEG-4视频解码时间预测的原理

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.36

M. Roitzsch, M. Pohlack

引用次数: 34

RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures RTSAT——一种解决分布式体系结构中任务分配问题的最优有效方法

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.44

Alexander Metzner, Christian Herde

引用次数: 65

Sensornet 2.0: The New Frontier 传感器网络2.0:新前沿

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.46

Feng Zhao

引用次数: 3

Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.42

Robert I. Davis, A. Burns

引用次数: 181

Interface-Based Rate Analysis of Embedded Systems 基于接口的嵌入式系统速率分析

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.26

S. Chakraborty, Yanhong Liu, N. Stoimenov, L. Thiele, E. Wandeler

{"title":"Interface-Based Rate Analysis of Embedded Systems","authors":"S. Chakraborty, Yanhong Liu, N. Stoimenov, L. Thiele, E. Wandeler","doi":"10.1109/RTSS.2006.26","DOIUrl":"https://doi.org/10.1109/RTSS.2006.26","url":null,"abstract":"Interface-based design is now considered to be one of the keys to tackling the increasing complexity of modern embedded systems. The central idea is that different components comprising such systems can be developed independently and a system designer can connect them together only if their interfaces match, without knowing the details of their internals. We use the concept of rate interfaces for compositional (correct-by-construction) design of embedded systems whose components communicate through data streams. Using the associated rate interface algebra, two components can be connected together if the output rate of one component is \"compatible\" with the input rate of the other component. We formalize this notion of compatibility and show that such an algebra is non-trivial because it has to accurately model the burstiness in the arrival rates of such data streams and the variability in their processing requirements. We discuss how rate interfaces simplify compositional design and at the same time help in functional and performance verification which would be difficult to address otherwise. Finally, we illustrate these advantages through a realistic case study involving a component-based design of a multiprocessor architecture running a picture-in-picture application","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134319716","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}

引用次数: 34

System-Level Energy Management for Periodic Real-Time Tasks 周期性实时任务的系统级能量管理

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.48

Hakan Aydin, V. Devadas, Dakai Zhu

引用次数: 143

Delay Analysis in Temperature-Constrained Hard Real-Time Systems with General Task Arrivals 具有一般任务到达的温度约束硬实时系统的延迟分析

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.16

Shengquan Wang, R. Bettati

引用次数: 80

Process-Aware Interrupt Scheduling and Accounting 进程感知中断调度和会计

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.37

Y. Zhang, R. West

{"title":"Process-Aware Interrupt Scheduling and Accounting","authors":"Y. Zhang, R. West","doi":"10.1109/RTSS.2006.37","DOIUrl":"https://doi.org/10.1109/RTSS.2006.37","url":null,"abstract":"In most operating systems, the handling of interrupts is typically performed within the address space of the kernel. Moreover, interrupt handlers are invoked asynchronously during the execution of arbitrary processes. Unfortunately, this allows for a process's time quantum to be consumed by arbitrary interrupt handling. To avoid significant impact to process execution and also to respond quickly enough to interrupts, interrupt servicing is usually split into two parts: a \"top\" and \"bottom\" half. The top half executes at interrupt time and is meant to be short enough to complete all necessary actions at the time of the interrupt. In contrast, the bottom half can be deferred to a more suitable point in time to complete servicing of a prior interrupt. Systems such as Linux may defer bottom half handling to a schedulable thread that may be arbitrarily delayed until there are no other processes to execute. A better approach would be to schedule bottom halves in accordance with the priorities of processes that are affected by their execution. Likewise, bottom half processing should be charged to the CPU-time usage of the affected process, or processes, where possible, to ensure fairer and more predictable resource management. This paper describes some of our approaches, both algorithmically and in terms of implementation on a Linux system, to combine interrupt scheduling and accountability. We show significant improvements in predictability of a Linux system by modifying the kernel to more accurately account for interrupt servicing costs and more precisely control when and to what extent interrupts can be serviced","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133574848","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}

引用次数: 70