2013 25th Euromicro Conference on Real-Time Systems最新文献_第3页

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications 面向延迟敏感型实时应用的全抢占式多处理器信号量协议

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

Björn B. Brandenburg

引用次数: 32

Outstanding Paper Award: Making Shared Caches More Predictable on Multicore Platforms 杰出论文奖:使共享缓存在多核平台上更可预测

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

Bryan C. Ward, Jonathan L. Herman, C. Kenna, James H. Anderson

引用次数: 185

Suspension-Aware Analysis for Hard Real-Time Multiprocessor Scheduling 硬实时多处理器调度的悬架感知分析

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

Cong Liu, James H. Anderson

引用次数: 40

Mixed Critical Earliest Deadline First 混合临界最早截止日期第一

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

Dario Socci, P. Poplavko, S. Bensalem, M. Bozga

引用次数: 47

Probabilistic Timing Analysis for the Dynamic Segment of FlexRay FlexRay动态段的概率时序分析

2013 25th Euromicro Conference on Real-Time Systems Pub Date : 2013-07-09 DOI: 10.1145/2870635

Bogdan Tanasa, Unmesh D. Bordoloi, P. Eles, Zebo Peng

引用次数: 10

Outstanding Paper Award: Schedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities 杰出论文奖:具有任意处理器亲和性的Linux推拉调度程序的可调度性分析

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

A. Gujarati, Felipe Cerqueira, Björn B. Brandenburg

{"title":"Outstanding Paper Award: Schedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities","authors":"A. Gujarati, Felipe Cerqueira, Björn B. Brandenburg","doi":"10.1109/ECRTS.2013.18","DOIUrl":"https://doi.org/10.1109/ECRTS.2013.18","url":null,"abstract":"Contemporary multiprocessor real-time operating systems, such as VxWorks, LynxOS, QNX, and real-time variants of Linux, allow a process to have an arbitrary processor affinity, that is, a process may be pinned to an arbitrary subset of the processors in the system. Placing such a hard constraint on process migrations can help to improve cache performance of specific multi-threaded applications, achieve isolation among components, and aid in load-balancing. However, to date, the lack of schedulability analysis for such systems prevents the use of arbitrary processor affinities in predictable hard real-time applications. In this paper, it is shown that job-level fixed-priority scheduling with arbitrary processor affinities is strictly more general than global, clustered, and partitioned job-level fixed-priority scheduling. The Linux push and pull scheduler is studied as a reference implementation and techniques for the schedulability analysis of hard real-time tasks with arbitrary processor affinity masks are presented. The proposed tests work by reducing the scheduling problem to ``global-like'' sub-problems to which existing global schedulability tests can be applied. Schedulability experiments show the proposed techniques to be effective.","PeriodicalId":247550,"journal":{"name":"2013 25th Euromicro Conference on Real-Time Systems","volume":"75 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":"127227852","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}

引用次数: 29