2008 Euromicro Conference on Real-Time Systems最新文献

Sporadic Multiprocessor Scheduling with Few Preemptions 具有少量抢占的零星多处理器调度

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.9

Björn Andersson, K. Bletsas

引用次数: 94

Backlog Estimation and Management for Real-Time Data Services 实时数据服务的积压估计与管理

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.11

K. Kang, Jisu Oh, Yan Zhou

引用次数: 12

Dynamic Reconfiguration for Adaptive Multiversion Real-Time Systems 自适应多版本实时系统的动态重构

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.24

George Lima, E. Camponogara, Ana Carolina Sokolonski

引用次数: 12

Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors 多处理器虚拟集群的分层调度框架

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.28

I. Shin, A. Easwaran, Insup Lee

{"title":"Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors","authors":"I. Shin, A. Easwaran, Insup Lee","doi":"10.1109/ECRTS.2008.28","DOIUrl":"https://doi.org/10.1109/ECRTS.2008.28","url":null,"abstract":"Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and globalscheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster areglobally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize processor utilization of individual clusters. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved utilization bounds.","PeriodicalId":176327,"journal":{"name":"2008 Euromicro Conference on Real-Time Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632840","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}

引用次数: 186

A Schedulability Analysis of Deferrable Scheduling Using Patterns 基于模式的可延期调度可调度性分析

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.8

Song Han, Deji Chen, Ming Xiong, A. Mok

引用次数: 13

Advanced Hierachical Event-Stream Model 高级分层事件流模型

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.19

K. Albers, F. Bodmann, F. Slomka

引用次数: 18

Predictable Code and Data Paging for Real Time Systems 实时系统的可预测代码和数据分页

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.16

D. Hardy, I. Puaut

{"title":"Predictable Code and Data Paging for Real Time Systems","authors":"D. Hardy, I. Puaut","doi":"10.1109/ECRTS.2008.16","DOIUrl":"https://doi.org/10.1109/ECRTS.2008.16","url":null,"abstract":"There is a need for using virtual memory in real-time applications: using virtual addressing provides isolation between concurrent processes; in addition, paging allows the execution of applications whose size is larger than main memory capacity, which is useful in embedded systems where main memory is expensive and thus scarce. However, virtual memory is generally avoided when developing real-time and embedded applications due to predictability issues. In this paper we propose a predictable paging system in which the page loading and page eviction points are selected at compile-time. The contents of main memory is selected using an Integer Linear Programming (ILP) formulation. Our approach is applied to code, static data and stack regions of individual tasks. We show that the time required for selecting memory contents is reasonable for all applications including the largest ones, demonstrating the scalability of our approach. Experimental results compare our approach with a previous one, based on graph coloring. It shows that quality of page allocation is generally improved, with an average improvement of 30% over the previous approach. Another comparison with a state-of-the-art demand-paging system shows that predictability does not come at the price of performance loss.","PeriodicalId":176327,"journal":{"name":"2008 Euromicro Conference on Real-Time Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128644853","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}

引用次数: 18

Improving the First-Miss Computation in Set-Associative Instruction Caches 改进集关联指令缓存中的第一次遗漏计算

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.34

C. Ballabriga, H. Cassé

{"title":"Improving the First-Miss Computation in Set-Associative Instruction Caches","authors":"C. Ballabriga, H. Cassé","doi":"10.1109/ECRTS.2008.34","DOIUrl":"https://doi.org/10.1109/ECRTS.2008.34","url":null,"abstract":"The methods for worst case execution time (WCET) computation need to analyse both the control flow of the task, and the architecture effects involved by the hosting architecture. An important architectural effect that needs to be predicted is the instruction cache behavior. This prediction is commonly performed by assigning to each program instruction a category that describes its behavior. One of these categories, first miss, means that the first reference is a cache miss, while the subsequent references give hits. Yet, there is variations in the meanings of this category according to the used methods, capturing overlapping but not equivalents sets of cache behaviors. In this paper, we have analysed the shortcomings of the First-Miss computation methods, and we have deduced an improved first miss computation approach which captures a maximum of cache behaviors while eliminating some of the most time-consuming processing. We have implemented our method in the frame of C. Ferdinand's categorization method, enhancing his approach for first miss handling, and compared it with the non-enhanced versions. The results shows a tighter WCET, and a greatly reduced computation time.","PeriodicalId":176327,"journal":{"name":"2008 Euromicro Conference on Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132318983","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}

引用次数: 44

Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications 多临界规格下零星任务的可调度性分析

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.26

Sanjoy Baruah, S. Vestal

引用次数: 158

Response Time Analysis of Asynchronous Periodic and Sporadic Tasks Sheduled by a Fixed Priority Preemptive Algorithm 固定优先级抢占算法调度的异步周期性和偶发任务响应时间分析

2008 Euromicro Conference on Real-Time Systems Pub Date : 2008-07-02 DOI: 10.1109/ECRTS.2008.30

M. Coutinho, J. Rufino, C. Almeida

{"title":"Response Time Analysis of Asynchronous Periodic and Sporadic Tasks Sheduled by a Fixed Priority Preemptive Algorithm","authors":"M. Coutinho, J. Rufino, C. Almeida","doi":"10.1109/ECRTS.2008.30","DOIUrl":"https://doi.org/10.1109/ECRTS.2008.30","url":null,"abstract":"Real-time systems usually consist of a set of periodic and sporadic tasks. Periodic tasks can be divided into two classes: synchronous and asynchronous. The first type does not define the task first release, contrary to the second. Hence, synchronous periodic tasks are assumed to be released at the worst instant: the critical instant. The schedulability test is reduced to check a single execution of the task under analysis. The integration of sporadic tasks is also straightforward: they are treated as a periodic task with maximum arrival frequency. On the other hand, asynchronous periodic tasks require a test for each release in the hyper period and the integration of sporadic tasks is not trivial: the worst release instant is unknown a priori. However, they do not assume that the tasks are released at the worst instant.This paper presents a new schedulability analysis method based on the Response Time Analysis (RTA) to determine the worst response time of both asynchronous periodic and sporadic tasks, scheduled by a fixed-priority preemptive algorithm with general deadlines. It also presents another method that enables the introduction of a user configurable degree of pessimism, reducing the hyper period dependency.","PeriodicalId":176327,"journal":{"name":"2008 Euromicro Conference on Real-Time Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116027167","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}

引用次数: 17