2015 IEEE 18th International Symposium on Real-Time Distributed Computing最新文献_第2页

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors 面向COTS多核处理器的时间可组合任务分区研究

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.43

Gabriel Fernandez, J. Abella, E. Quiñones, L. Fossati, Marco Zulianello, T. Vardanega, F. Cazorla

{"title":"Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors","authors":"Gabriel Fernandez, J. Abella, E. Quiñones, L. Fossati, Marco Zulianello, T. Vardanega, F. Cazorla","doi":"10.1109/ISORC.2015.43","DOIUrl":"https://doi.org/10.1109/ISORC.2015.43","url":null,"abstract":"The timing verification of real-time single core systems involves a timing analysis step that yields an Execution Time Bound (ETB) for each task, followed by a schedulability analysis step, where the scheduling attributes of the individual tasks, including the ETB, are studied from the system level perspective. The transition between those two steps involves accounting for the interference effects that arise when tasks contend for access to shared resource. The advent of multicore processors challenges the viability of this two-step approach because several complex contention effects at the processor level arise that cause tasks to be unable to make progress while actually holding the CPU, which are very difficult to tightly capture by simply inflating the tasks' ETB. In this paper we show how contention on access to hardware shared resources creates a circular dependence between the determination of tasks' ETB and their scheduling at runtime. To help loosen this knot we present an approach that acknowledges different flavors of time compos ability, examining in detail the variant intended for partitioned scheduling, which we evaluate on two real processor boards used in the space domain.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126972454","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}

引用次数: 7

Towards Real-Time Result Verification Using Checkpointing in Volunteer Computing Systems 在志愿计算系统中使用检查点实现实时结果验证

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.31

Nouman M. Durrani, Tasmiyah Iqbal, J. Shamsi, Nadeem Kafi Khan

{"title":"Towards Real-Time Result Verification Using Checkpointing in Volunteer Computing Systems","authors":"Nouman M. Durrani, Tasmiyah Iqbal, J. Shamsi, Nadeem Kafi Khan","doi":"10.1109/ISORC.2015.31","DOIUrl":"https://doi.org/10.1109/ISORC.2015.31","url":null,"abstract":"Volunteer Computing is a form of network based distributed computing, which allows public participants to share their idle computing resources, and helps run computationally expensive projects. Many existing volunteer computing platforms consist of millions of users, providing huge amount of memory and processing. Due to the rapid growth in the volunteer computing projects, more researchers have been attracted to study and improve the existing volunteer computing system using heterogeneous set of resources. Also, the task distribution and result verification policies incorporated in the popular volunteer computing frameworks are not efficient because much of the user computation is wasted. This paper highlights the drawbacks of existing schemes and proposes a framework for real-time task division, distribution, early detection and mitigation of faults in a volunteer computing system. The main motivation behind this research is to devise a methodology that reduces the overhead incurred by replication. The check pointing scheme proposed triggers intermediate result verification and the grouping of resources aids in the efficient scheduling of work units which improves accuracy of the volunteer cloud. The research will enable the research community to study the available schemes used in volunteer computing and help them fill gaps in existing research.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124659867","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}

引用次数: 0

DIVIDER: Modelling and Evaluating Real-Time Service-Oriented Cyberphysical Co-Simulations 分隔:建模和评估实时面向服务的网络物理联合仿真

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.30

D. McKee, D. Webster, Jie Xu, D. Battersby

引用次数: 8

Hardware Locks with Priority Ceiling Emulation for a Java Chip-Multiprocessor 具有优先级上限仿真的Java芯片多处理器硬件锁

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.33

Tórur Biskopstø Strøm, Martin Schoeberl

引用次数: 1

Sensitivity Analysis of Dropped Samples for Performance-Oriented Controller Design 面向性能控制器设计的丢样灵敏度分析

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.16

T. Bund, F. Slomka

引用次数: 6

Buffer Sizing to Reduce Interference and Increase Throughput of Real-Time Stream Processing Applications 缓冲大小减少干扰和增加实时流处理应用程序的吞吐量

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.14

P. Wilmanns, Stefan J. Geuns, J. Hausmans, M. Bekooij

{"title":"Buffer Sizing to Reduce Interference and Increase Throughput of Real-Time Stream Processing Applications","authors":"P. Wilmanns, Stefan J. Geuns, J. Hausmans, M. Bekooij","doi":"10.1109/ISORC.2015.14","DOIUrl":"https://doi.org/10.1109/ISORC.2015.14","url":null,"abstract":"Existing temporal analysis and buffer sizing techniques for real-time stream processing applications ignore that FIFO buffers bound interference between tasks on the same processor. By considering this effect it can be shown that a reduction of buffer capacities can result in a higher throughput. However, the relation between buffer capacities and throughput is non-monotone in general, which makes an exploitation of the effect challenging. In this paper a buffer sizing approach is presented which exploits that FIFO buffers bound interference between tasks on shared processors. The approach combines temporal analysis using a cyclic dataflow model with computation of buffer capacities in an iterative manner and thereby enables higher throughput guarantees at smaller buffer capacities. It is shown that convergence of the proposed analysis flow is guaranteed. The benefits of the presented approach are demonstrated using a WLAN 802.11p transceiver application executed on a multiprocessor system with shared processors. If buffers without blocking writes are used an up to 25% higher guaranteeable throughput and up to 23% smaller buffer capacities can be determined compared to existing approaches. For systems using buffers with blocking writes the guaranteeable throughput is even up to 43% higher and buffer capacities up to 11% smaller.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116728822","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}

引用次数: 13

A Generator for Time-Predictable Code 时间可预测代码的生成器

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.40

Daniel Prokesch, Stefan Hepp, P. Puschner

引用次数: 13

Mobility-as-a-Service: A Distributed Real-Time Simulation with Carrera Slot-Cars 移动即服务:Carrera插槽车的分布式实时仿真

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.19

D. Richter, Andreas Grapentin, A. Polze

引用次数: 3

Modeling Network Medium Access Protocols for Network Quality of Service Analysis 基于网络服务质量分析的网络介质访问协议建模

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.47

W. Emfinger, G. Karsai

引用次数: 3

Code Optimization of Periodic Preemptive Hard Real-Time Multitasking Systems 周期性抢占式硬实时多任务系统的代码优化

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.8

Arno Luppold, H. Falk

引用次数: 8