2008 IEEE Real-Time and Embedded Technology and Applications Symposium最新文献_第2页

Automated Middleware QoS Configuration Techniques for Distributed Real-time and Embedded Systems 分布式实时和嵌入式系统的自动化中间件QoS配置技术

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.29

A. Kavimandan, A. Gokhale

{"title":"Automated Middleware QoS Configuration Techniques for Distributed Real-time and Embedded Systems","authors":"A. Kavimandan, A. Gokhale","doi":"10.1109/RTAS.2008.29","DOIUrl":"https://doi.org/10.1109/RTAS.2008.29","url":null,"abstract":"Quite often the modeling tools used in the development lifecycle of distributed real-time and embedded (DRE) systems are middleware-specific, where they elevate middleware artifacts, such as configuration options, to first class modeling entities. Unfortunately, this level of abstraction does not resolve the complex issues in middleware configuration process for QoS assurance. This paper describes GT-QMAP (graph transformation for QoS mapping) model-driven engineering toolchain that combines (1) domain-specific modeling, to simplify specifying the QoS requirements of DRE systems intuitively, and (2) model transformations, to automate the mapping of domain-specific QoS requirements to middleware-specific QoS configuration options. The paper evaluates the automation capabilities of GT-QMAP in the context of three DRE system case studies. The results indicate that on an average the modeling effort is reduced by over 75%. Further, the results also indicate that GT-QMAP provides significant benefits in terms of scalability and automation as DRE system QoS requirements evolve during its entire development lifecycle.","PeriodicalId":130593,"journal":{"name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126705196","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}

引用次数: 11

Distributed Resource Kernels: OS Support for End-To-End Resource Isolation 分布式资源内核:对端到端资源隔离的操作系统支持

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.37

Karthik Lakshmanan, R. Rajkumar

{"title":"Distributed Resource Kernels: OS Support for End-To-End Resource Isolation","authors":"Karthik Lakshmanan, R. Rajkumar","doi":"10.1109/RTAS.2008.37","DOIUrl":"https://doi.org/10.1109/RTAS.2008.37","url":null,"abstract":"The notion of resource reservation for obtaining real-time scheduling guarantees and enforcement of resource usage has gained strong support in recent years. However, much work on resource reservation has primarily focused on single-processor systems. In this paper, we propose the distributed resource kernel frame wo rk to deploy distributed real-time applications with end-to-end timing constraints, and to efficiently enforce and monitor their usage. Modern distributed real-time systems host multiple applications, where each application can span two or more processors. Timing bugs in one distributed application can affect the timing properties of other applications in the system. Our framework introduces the abstraction of a distributed resource container as an isolated virtual operating environment for a distributed real-time application. We have implemented this framework by extending our open-source single- node Linux/RK platform (R. Rajkumar et al., 1998). A deployment and monitoring tool called dMon is also provided. We evaluate the framework's ability to provide timing guarantees by stress-testing the system using the Distributed Hartstone benchmarks. An audio processing pipeline is then used to illustrate the temporal isolation support provided by the Distributed RK framework. The distributed container abstraction can also be extended in the future to support security and fault-tolerance attributes.","PeriodicalId":130593,"journal":{"name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122907448","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}

引用次数: 35

Hybrid Timing Analysis of Modern Processor Pipelines via Hardware/Software Interactions 基于硬件/软件交互的现代处理器流水线混合时序分析

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.19

Sibin Mohan, F. Mueller

{"title":"Hybrid Timing Analysis of Modern Processor Pipelines via Hardware/Software Interactions","authors":"Sibin Mohan, F. Mueller","doi":"10.1109/RTAS.2008.19","DOIUrl":"https://doi.org/10.1109/RTAS.2008.19","url":null,"abstract":"Embedded systems are often subject to constraints that require determinism to ensure that task deadlines are met. Such systems are referred to as real-time systems. Schedulability analysis provides a firm basis to ensure that tasks meet their deadlines for which knowledge of worst-case execution time (WCET) bounds is a critical piece of information. Static timing analysis techniques are used to derive these WCET bounds. A limiting factor for designing realtime systems is the class of processors that can be used. Typically, modern, complex processor pipelines cannot be used in real-time systems design. Contemporary processors with their advanced architectural features, such as out-of-order execution, branch prediction, speculation, prefetching, etc., cannot be statically analyzed to obtain tight WCET bounds for tasks. This is caused by the non-determinism of these features, which surfaces in full only at runtime. In this paper, we introduce a new paradigm to perform timing analysis of tasks for real-time systems running on modern processor architectures. We propose minor enhancements to the processor architecture to enable this process. These features, on interaction with software modules, are able to obtain tight, accurate timing analysis results for modern processors. We also briefly present analysis techniques that, combined with our timing analysis methods, reduce the complexity of worst-case estimations for loops. To the best of our knowledge, this method of constant interactions between hardware and software to calculate WCET bounds for out-of-order processors is the first of its kind.","PeriodicalId":130593,"journal":{"name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116742068","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}

引用次数: 11

Access Control for Adaptive Reservations on Multi-User Systems 多用户系统中自适应预约的访问控制

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.16

T. Cucinotta

引用次数: 13

Physical Assembly Mapper: A Model-Driven Optimization Tool for QoS-Enabled Component Middleware 物理装配映射器:用于支持qos的组件中间件的模型驱动优化工具

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.36

K. Balasubramanian, D. Schmidt

引用次数: 9

Equivalence between Schedule Representations: Theory and Applications 表表示的等价:理论与应用

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.17

Matthieu Lemerre, V. David, Christophe Aussaguès, G. Vidal-Naquet

{"title":"Equivalence between Schedule Representations: Theory and Applications","authors":"Matthieu Lemerre, V. David, Christophe Aussaguès, G. Vidal-Naquet","doi":"10.1109/RTAS.2008.17","DOIUrl":"https://doi.org/10.1109/RTAS.2008.17","url":null,"abstract":"Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order to overcome these difficulties, by allowing processors to be fractionally allocated. We prove that these representations are equivalent to the standard representations when preemptive scheduling is allowed. This allows the creation of scheduling algorithms and the study of feasibility in the simpler representations. We apply this method throughout the paper. Then, we use it to provide new simple solutions to the previously solved implicit-deadline periodic scheduling problem. We also tackle the more general problem of scheduling arbitrary time-triggered tasks, and thus in particular solve the open multiprocessor general periodic tasks scheduling problem. Contrary to previous solutions like the PFair class of algorithms, the proposed solution also works when processors have different speeds. We complete the method by providing an online schedule transformation algorithm, that allows the efficient handling of both time-triggered and event-triggered tasks, as well as the creation of online rate-based scheduling algorithms on multiprocessors.","PeriodicalId":130593,"journal":{"name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124954101","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}

引用次数: 21

Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions 非抢占区域任务的最坏情况响应时间边界

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.18

H. Ramaprasad, F. Mueller

{"title":"Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions","authors":"H. Ramaprasad, F. Mueller","doi":"10.1109/RTAS.2008.18","DOIUrl":"https://doi.org/10.1109/RTAS.2008.18","url":null,"abstract":"Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a scheduling policy that determines priorities among tasks. Such policies can be non-preemptive or preemptive. While the former reduces analysis complexity and overhead in implementation, the latter provides increased flexibility in terms of schedulability for higher utilizations of arbitrary task sets. In practice, tasks often have non-preemptive regions but are otherwise scheduled preemptively. To bound the WCET of tasks, architectural features have to be considered in the context of a scheduling scheme. In particular, preemption affects caches, which can be modeled by bounding the cache-related preemption delay (CRPD) of a task. In this paper, we propose a framework that provides safe and tight bounds of the data-cache related preemption delay (D-CRPD), the WCET and the worst-case response times, not just for homogeneous tasks under fully preemptive or fully non-preemptive systems, but for tasks with a non-preemptive region. By retaining the option of preemption where legal, task sets become schedulable that might otherwise not be. Yet, by requiring a region within a task to be non-preemptive, correctness is ensured in terms of arbitration of access to shared resources. Experimental results confirm an increase in schedulability of a task set with non- preemptive regions over an equivalent task set where only those tasks with non-preemptive regions are scheduled non- preemptively altogether. Quantitative results further indicate that D-CRPD bounds and response-time bounds comparable to task sets with fully non-preemptive tasks can be retained in the presence of short non-preemptive regions. To the best of our knowledge, this is the first framework that performs D-CRPD calculations in a system for tasks with a non-preemptive region.","PeriodicalId":130593,"journal":{"name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123341211","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}

引用次数: 30

Hybrid Hardware-Software Architecture for Reconfigurable Real-Time Systems 可重构实时系统的混合软硬件体系结构

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.14

R. Pellizzoni, M. Caccamo

引用次数: 10

Virtualizing Disk Performance 虚拟化磁盘性能

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.31

T. Kaldewey, T. Wong, Richard A. Golding, A. Povzner, S. Brandt, C. Maltzahn

引用次数: 25

Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems 资源共享偶发任务系统的混合优先级调度

2008 IEEE Real-Time and Embedded Technology and Applications Symposium Pub Date : 2008-04-22 DOI: 10.1109/RTAS.2008.7

Sanjoy Baruah, N. Fisher

引用次数: 6