2013 25th Euromicro Conference on Real-Time Systems最新文献

Reducing Tardiness under Global Scheduling by Splitting Jobs 通过拆分作业减少全局调度下的延迟

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.13

J. Erickson, James H. Anderson

引用次数: 8

A Game-Theoretic Resource Manager for RT Applications RT应用的博弈论资源管理器

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.17

M. Maggio, Enrico Bini, Georgios C. Chasparis, Karl-Erik Årzén

引用次数: 30

A Schedulability Compatible Multiprocessor Resource Sharing Protocol -- MrsP 兼容可调度性的多处理器资源共享协议

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.37

A. Burns, A. Wellings

引用次数: 75

A Dynamic Scratchpad Memory Unit for Predictable Real-Time Embedded Systems 一种用于可预测实时嵌入式系统的动态刮记板存储单元

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.28

Saud Wasly, R. Pellizzoni

引用次数: 36

Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling 非抢占式实时调度的次优性量化

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.22

Abhilash Thekkilakattil, R. Dobrin, S. Punnekkat

{"title":"Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling","authors":"Abhilash Thekkilakattil, R. Dobrin, S. Punnekkat","doi":"10.1109/ECRTS.2013.22","DOIUrl":"https://doi.org/10.1109/ECRTS.2013.22","url":null,"abstract":"A number of preemptive real-time scheduling algorithms, such as Earliest Deadline First (EDF), are known to be optimal on uni-processor systems under specified assumptions. However, no uni-processor optimal algorithm exists under the non-preemptive scheduling paradigm. Hence preemptive schemes strictly dominate non-preemptive schemes with respect to uni-processor feasibility. However, the 'goodness' of non-preemptive schemes, compared to uni-processor optimal preemptive scheduling schemes such as EDF, which can also be referred to as its sub-optimality, has not been fully investigated yet. In this paper, we apply resource augmentation, specifically processor speed-up, to quantify the sub-optimality of non-preemptive scheduling with respect to EDF, and apply the results to guarantee user specified upper-bounds on the preemption related scheduling costs. In particular, we derive an upper bound on the minimum processor speed-up required to guarantee the non-preemptive feasibility of tasks that are deemed feasible under the preemptive EDF, and we prove that, in the cases where, for all tasks in the task set, the largest execution requirement is not greater than the shortest deadline, this bound is equal to 4. We also show how the proposed approach enables a system designer to choose an optimal processor, in order to, e.g., guarantee specified upper bounds on the preemption related overheads.","PeriodicalId":247550,"journal":{"name":"2013 25th Euromicro Conference on Real-Time Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125368036","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}

引用次数: 16

Interconnection Optimization for Multi-cluster Avionics Networks 多集群航电网络互连优化

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.25

H. Ayed, A. Mifdaoui, C. Fraboul

引用次数: 7

Response-Time Analysis of Parallel Fork-Join Workloads with Real-Time Constraints 具有实时约束的并行Fork-Join工作负载响应时间分析

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.31

Philip Axer, Sophie Quinton, M. Neukirchner, R. Ernst, Björn Döbel, Hermann Härtig

{"title":"Response-Time Analysis of Parallel Fork-Join Workloads with Real-Time Constraints","authors":"Philip Axer, Sophie Quinton, M. Neukirchner, R. Ernst, Björn Döbel, Hermann Härtig","doi":"10.1109/ECRTS.2013.31","DOIUrl":"https://doi.org/10.1109/ECRTS.2013.31","url":null,"abstract":"The advent of multi- and many-core processors comes with new challenges and opportunities for the designer of embedded real-time applications. By using parallel programming techniques (e.g. OpenMP) software engineers can leverage from the available hardware parallelism and speed up the algorithms. The inherent redundancy of multi-core architectures can also be used to implement fault-tolerance by executing code redundantly on multiple cores in parallel. Parallel programming and redundant execution are typical examples for fork-join tasks in which the program is partially parallelized. However, complex synchronization of parallel segments across multiple cores can cause unanticipated effects. This is especially problematic in hard real-time applications where data must be available in bounded time (e.g. stereo vision for pedestrian detection). The contribution of this work is a novel worst-case response time analysis which accounts for synchronization of fork-join tasks with arbitrary deadlines. We apply the analysis to the Romain framework which extends the L4 micro kernel by redundant multithreading targeted towards fault-tolerant embedded systems. By using formal analysis, we show that parallelizing workloads can lead to drastic performance impairments compared to traditional sequential execution if not done carefully.","PeriodicalId":247550,"journal":{"name":"2013 25th Euromicro Conference on Real-Time Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128114405","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}

引用次数: 57

Outstanding Paper Award: Using Max-Plus Algebra to Improve the Analysis of Non-cyclic Task Models 杰出论文奖:利用Max-Plus代数改进非循环任务模型的分析

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.30

Haibo Zeng, M. Natale

引用次数: 12

Computation Offloading for Frame-Based Real-Time Tasks with Resource Reservation Servers 资源预留服务器下基于帧的实时任务的计算分流

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.21

Anas Toma, Jian-Jia Chen

{"title":"Computation Offloading for Frame-Based Real-Time Tasks with Resource Reservation Servers","authors":"Anas Toma, Jian-Jia Chen","doi":"10.1109/ECRTS.2013.21","DOIUrl":"https://doi.org/10.1109/ECRTS.2013.21","url":null,"abstract":"Computation offloading concept has been recently adopted to improve the performance of embedded systems by moving some computation-intensive tasks (partially or wholly) to a powerful remote server. In this paper, we consider a computation offloading problem for frame-based real-time tasks, in which all the tasks have the same arrival time and the same relative deadline/period, by adopting the total bandwidth server (TBS) as resource reservations in the server side (remote execution unit). We prove that the problem is N P-complete and propose two algorithms in this paper. The first algorithm is a greedy algorithm with low complexity and provides a quick heuristic approach to decide which tasks to be offloaded and how the tasks are scheduled. The maximum finishing time of the solution derived from the greedy algorithm is at most twice of the finishing time (make span, maximal on the client and on the server) of any schedule. The second algorithm is a dynamic programming approach, which builds a three-dimensional table and requires pseudo-polynomial time complexity, to make an optimal decision for computation offloading. The algorithms are evaluated with a case study of a surveillance system and synthesized benchmarks.","PeriodicalId":247550,"journal":{"name":"2013 25th Euromicro Conference on Real-Time Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235552","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}

引用次数: 22

Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms 多核平台同步并行任务的全局EDF可调度性分析

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1109/ECRTS.2013.14

H. Chwa, Jinkyu Lee, Kieu-My Phan, A. Easwaran, I. Shin

{"title":"Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms","authors":"H. Chwa, Jinkyu Lee, Kieu-My Phan, A. Easwaran, I. Shin","doi":"10.1109/ECRTS.2013.14","DOIUrl":"https://doi.org/10.1109/ECRTS.2013.14","url":null,"abstract":"The trend towards multi-core/many-core architectures is well underway. It is therefore becoming very important to develop software in ways that take advantage of such parallel architectures. This particularly entails a shift in programming paradigms towards fine-grained, thread-parallel computing. Many parallel programming models have been introduced targeting such intra-task thread-level parallelism. However, most successful results on traditional multi-core real-time scheduling are focused on sequential programming models. For example, thread-level parallelism is not properly captured into the concept of interference, which is key to many schedulability analysis techniques. Thereby, most interference-based analysis techniques are not directly applicable to parallel programming models. Motivated by this, we extend the notion of interference to capture thread-level parallelism more accurately. We then leverage the proposed notion of parallelism-aware interference to derive efficient EDF schedulability tests that are directly applicable to synchronous parallel task models on multi-core platforms. Our evaluation results indicate that the proposed analysis significantly advances the state-of-the-art in EDF schedulability analysis for synchronous parallel tasks.","PeriodicalId":247550,"journal":{"name":"2013 25th Euromicro Conference on Real-Time Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220629","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}

引用次数: 64