28th IEEE International Real-Time Systems Symposium (RTSS 2007)最新文献_第3页

Bus Access Optimization for Predictable Implementation of Real-Time Applications on Multiprocessor Systems-on-Chip 多处理器片上系统实时应用可预测实现的总线访问优化

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/VLSI.2008.33

A. Andrei, P. Eles, Zebo Peng, Jakob Rosen

{"title":"Bus Access Optimization for Predictable Implementation of Real-Time Applications on Multiprocessor Systems-on-Chip","authors":"A. Andrei, P. Eles, Zebo Peng, Jakob Rosen","doi":"10.1109/VLSI.2008.33","DOIUrl":"https://doi.org/10.1109/VLSI.2008.33","url":null,"abstract":"In multiprocessor systems, the traffic on the bus does not solely originate from data transfers due to data dependencies between tasks, but is also affected by memory transfers as result of cache misses. This has a huge impact on worst-case execution time (WCET) analysis and, in general, on the predictability of real-time applications implemented on such systems. As opposed to the WCET analysis performed for a single processor system, where the cache miss penalty is considered constant, in a multiprocessor system each cache miss has a variable penalty, depending on the bus contention. This affects the tasks' WCET which, however, is needed in order to perform system scheduling. At the same time, the WCET depends on the system schedule due to the bus interference. In this paper we present an approach to worst-case execution time analysis and system scheduling for real-time applications implemented on multiprocessor SoC architectures. The emphasis of this paper is on the bus scheduling policy and its optimization, which is of huge importance for the performance of such a predictable multiprocessor application.","PeriodicalId":214762,"journal":{"name":"28th IEEE International Real-Time Systems Symposium (RTSS 2007)","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645663","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}

引用次数: 227

Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers 基于利用率约束的加权轮循调度程序可调度性分析

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.26

Jianjia Wu, Jyh-Charn S. Liu, Wei Zhao

引用次数: 16

Static Scheduling and Software Synthesis for Dataflow Graphs with Symbolic Model-Checking 具有符号模型校验的数据流图的静态调度与软件综合

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.51

Z. Gu, Mingxuan Yuan, Nan Guan, Mingsong Lv, Xiuqiang He, Qingxu Deng, Ge Yu

引用次数: 27

Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks 移动辅助无线传感器网络中的交会规划

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.44

G. Xing, Tian-sheng Wang, Zhihui Xie, W. Jia

{"title":"Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks","authors":"G. Xing, Tian-sheng Wang, Zhihui Xie, W. Jia","doi":"10.1109/RTSS.2007.44","DOIUrl":"https://doi.org/10.1109/RTSS.2007.44","url":null,"abstract":"Research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address this issue, we propose a rendezvous-based approach in which a subset of nodes serve as the rendezvous points (RPs) that buffer data originated from sources and transfer to MEs when they arrive. RPs enable MEs to collect a large volume of data at a time without traveling long distances, which can achieve a desirable balance between network energy saving and data collection delay. We develop two rendezvous planning algorithms, RP-CP and RP-UG. RP-CP finds the optimal RPs when MEs move along the data routing tree while RP-UG greedily chooses the RPs with maximum energy saving to travel distance ratios. We design the rendezvous-based data collection protocol that facilitates reliable data transfers from RPs to MEs in presence of significant unexpected delays in ME movement and network communication. Our approach is validated through extensive simulations.","PeriodicalId":214762,"journal":{"name":"28th IEEE International Real-Time Systems Symposium (RTSS 2007)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117168256","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}

引用次数: 125

Scenario Aware Analysis for Complex Event Models and Distributed Systems 复杂事件模型和分布式系统的场景感知分析

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.22

R. Henia, R. Ernst

引用次数: 68

Toward the Predictable Integration of Real-Time COTS Based Systems 面向实时COTS系统的可预测集成

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.15

R. Pellizzoni, M. Caccamo

引用次数: 51

Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources 小型或稀疏数据源的分布式最小时间收敛调度

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.13

Y. Zhang, S. Gandham, Qingfeng Huang

引用次数: 40

Optimal Discrete Rate Adaptation for Distributed Real-Time Systems 分布式实时系统的最优离散速率自适应

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.39

Yingming Chen, Chenyang Lu, X. Koutsoukos

引用次数: 32

Mutable Protection Domains: Towards a Component-Based System for Dependable and Predictable Computing 可变保护域:面向可靠和可预测计算的基于组件的系统

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.27

Gabriel Parmer, R. West

{"title":"Mutable Protection Domains: Towards a Component-Based System for Dependable and Predictable Computing","authors":"Gabriel Parmer, R. West","doi":"10.1109/RTSS.2007.27","DOIUrl":"https://doi.org/10.1109/RTSS.2007.27","url":null,"abstract":"The increasing complexity of software poses significant challenges for real-time and embedded systems beyond those based purely on timeliness. With embedded systems and applications running on everything from mobile phones, PDAs, to automobiles, aircraft and beyond, an emerging challenge is to ensure both the functional and timing correctness of complex software. We argue that static analysis of software is insufficient to verify the safety of all possible control flow interactions. Likewise, a static system structure upon which software can be isolated in separate protection domains, thereby defining immutable boundaries between system and application-level code, is too inflexible to the challenges faced by real-time applications with explicit timing requirements. This paper, therefore, investigates a concept called \"mutable protection domains\" that supports the notion of hardware-adaptable isolation boundaries between software components. In this way, a system can be dynamically reconfigured to maximize software fault isolation, increasing dependability, while guaranteeing various tasks are executed according to specific time constraints. Using a series of simulations on multidimensional, multiple-choice knapsack problems, we show how various heuristics compare in their ability to rapidly reorganize the fault isolation boundaries of a component- based system, to ensure resource constraints while simultaneously maximizing isolation benefit. Our ssh oneshot algorithm offers a promising approach to address system dynamics, including changing component invocation patterns, changing execution times, and mispredictions in isolation costs due to factors such as caching.","PeriodicalId":214762,"journal":{"name":"28th IEEE International Real-Time Systems Symposium (RTSS 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128950107","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}

引用次数: 97

Adapting Futures: Scalability for Real-World Computing 适应未来:现实世界计算的可扩展性

28th IEEE International Real-Time Systems Symposium (RTSS 2007) Pub Date : 2007-12-03 DOI: 10.1109/RTSS.2007.41

J. Helander, R. Serg, Margus Veanes, Pritam Roy

{"title":"Adapting Futures: Scalability for Real-World Computing","authors":"J. Helander, R. Serg, Margus Veanes, Pritam Roy","doi":"10.1109/RTSS.2007.41","DOIUrl":"https://doi.org/10.1109/RTSS.2007.41","url":null,"abstract":"Creating robust real-time embedded software is critical in combining the physical world with computing, such as in consumer electronics or robotics. One challenge is the complexity of dealing with time together with implementation details that often end up implicitly determining the temporal behavior of the program. In this paper we suggest deconstructing a program into two separate aspects, the functional implementation and a temporal pattern, each expressed separately in a different language. This separation enables independent specification, analysis and prediction of the temporal behavior without regard to the implementation. Meanwhile the implementation is optimized for platforms with different capabilities through a scalable programming model that automatically adapts the execution to the level of concurrency a platform can support. Finally the aspects are put together to create a working system. This paper presents the use of futures and partitures to achieve predictability and performance in embedded systems. A new real-time scheduler for partiture based futures execution is introduced, along with multiple implementations, including one for an 8-bit microcontroller. The paper explains how to create, model, and execute futures and partitures.","PeriodicalId":214762,"journal":{"name":"28th IEEE International Real-Time Systems Symposium (RTSS 2007)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166594","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