发布求助
文献互助 智能选刊 最新文献

2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)最新文献

筛选
英文 中文
Improving an Artificial Hormone System’s Time Bounds Using Task Allocation Signals 利用任务分配信号改进人工激素系统的时间限制
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812838
Eric Hutter, Robin Lakos, U. Brinkschulte
{"title":"Improving an Artificial Hormone System’s Time Bounds Using Task Allocation Signals","authors":"Eric Hutter, Robin Lakos, U. Brinkschulte","doi":"10.1109/ISORC52572.2022.9812838","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812838","url":null,"abstract":"This paper proposes an extension to the Artificial Hormone System (AHS) in order to improve its time bounds. The AHS is a middleware to distribute tasks to a distributed system’s nodes in a decentralized manner based on Organic Computing principles. The AHS’ task distribution has previously been extended by a priority-based approach that allows to prioritize tasks, allowing to control the order of their allocation during the system’s initial self-configuration or self-healing after a node failure. However, this extension worsens the hard time bounds guaranteed by the AHS compared to its original implementation without priority support. We thus propose so-called task allocation signals that improve these time bounds. This approach results in a speedup factor of up to (2 − 1/m) where m is the number of tasks to distribute in the system, restoring the original AHS’ time bounds while keeping the priority support intact. Evaluations conducted using a cycle-accurate AHS simulator fully confirm the theoretical results presented.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133779752","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
Assessing Intel’s Memory Bandwidth Allocation for resource limitation in real-time systems 评估英特尔的内存带宽分配在实时系统中的资源限制
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812757
Giorgio Farina, Gautam Gala, M. Cinque, G. Fohler
{"title":"Assessing Intel’s Memory Bandwidth Allocation for resource limitation in real-time systems","authors":"Giorgio Farina, Gautam Gala, M. Cinque, G. Fohler","doi":"10.1109/ISORC52572.2022.9812757","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812757","url":null,"abstract":"Industries are recently considering the adoption of cloud computing for hosting safety critical applications. However, the use of multicore processors usually adopted in the cloud introduces temporal anomalies due to contention for shared resources, such as the memory subsystem. In this paper we explore the potential of Intel’s Memory Bandwidth Allocation (MBA) technology, available on Xeon Scalable processors. By adopting a systematic measurement approach on real hardware, we assess the indirect memory bandwidth limitation achievable by applying MBA delays, showing that only given delay values (namely 70, 80 and 90) are effective in our setting. We also test the derived bandwidth assured to a hypothetical critical core when interfering cores (e.g., generating a concurrent memory access workload) are present on the same machine. Our results can support designers by providing understanding of impact of the shared memory to enable predictable progress of safety critical applications in cloud environments.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116634435","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}
引用次数: 3
LRP-based Policy Pruning and Distillation of Reinforcement Learning Agents for Embedded Systems 基于lrp的嵌入式系统强化学习代理策略修剪与提炼
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812837
Rui Xu, Siyu Luan, Zonghua Gu, Qingling Zhao, Gang Chen
{"title":"LRP-based Policy Pruning and Distillation of Reinforcement Learning Agents for Embedded Systems","authors":"Rui Xu, Siyu Luan, Zonghua Gu, Qingling Zhao, Gang Chen","doi":"10.1109/ISORC52572.2022.9812837","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812837","url":null,"abstract":"Reinforcement Learning (RL) is an effective approach to developing control policies by maximizing the agent’s reward. Deep Reinforcement Learning (DRL) uses Deep Neural Networks (DNNs) for function approximation in RL, and has achieved tremendous success in recent years. Large DNNs often incur significant memory size and computational overheads, which greatly impedes their deployment into resource-constrained embedded systems. For deployment of a trained RL agent on embedded systems, it is necessary to compress the Policy Network of the RL agent to improve its memory and computation efficiency. In this paper, we perform model compression of the Policy Network of an RL agent by leveraging the relevance scores computed by Layer-wise Relevance Propagation (LRP), a technique for Explainable AI (XAI), to rank and prune the convolutional filters in the Policy Network, combined with fine-tuning with Policy Distillation. Performance evaluation based on several Atari games indicates that our proposed approach is effective in reducing model size and inference time of RL agents.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"17 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120870180","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}
引用次数: 4
PSIC: Priority-Strict Multi-Core IRQ Processing 优先级严格的多核IRQ处理
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812796
M. Bargholz, Christian J. Dietrich, D. Lohmann
{"title":"PSIC: Priority-Strict Multi-Core IRQ Processing","authors":"M. Bargholz, Christian J. Dietrich, D. Lohmann","doi":"10.1109/ISORC52572.2022.9812796","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812796","url":null,"abstract":"While processing external events, in the form of interrupt requests (IRQs), is a key concern of digital control systems, processing these events can be of different importance for a system’s functionality. Therefore, it is necessary, especially for real-time systems, to ensure that the handling of low-priority IRQs does not interfere with high-priority interrupt-service routines (ISRs) to prevent priority inversions. While prioritizing ISRs on single-core machines is a long-solved problem, priority-strict IRQ handling in multi-core systems is, as we will show, quite challenging with current interrupt controllers.With PSIC, we propose a hardware/software co-design that ensures the priority-strict execution of the top-m ISRs on an m-core machine at minimal interruption-induced overheads. We developed a drop-in replacement for an off-the-shelf interrupt controller that delivers IRQs in strict priority order while achieving low delivering delays at moderate hardware costs. Combined with a minimal IRQ software subsystem, which requires no inter-core synchronization, PSIC guarantees a priority-strict ISR execution on multiple cores.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129321379","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
Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems 利用Kronecker代数检测分布式系统中的意外行为
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812832
P. Denzler, Johann Blieberger, W. Kastner
{"title":"Utilising Kronecker Algebra to Detect Unexpected Behaviour in Distributed Systems","authors":"P. Denzler, Johann Blieberger, W. Kastner","doi":"10.1109/ISORC52572.2022.9812832","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812832","url":null,"abstract":"Current industrial trends require flexible and reconfigurable manufacturing systems, with Cyber-Physical Production Systems (CPPS) playing a crucial role. However, the increased flexibility and decentralisation increase the risk of unexpected or emerging system behaviour. Message sequence charts (MSCs) have proven helpful in the early stages of system design to capture intended scenarios. This paper introduces a process that utilises MSCs to identify unexpected system behaviour. After synthesising the MSCs into finite state machines, the process suggests applying Kronecker algebra to verify intended and identify unintended scenarios. The process is illustrated by an example depicting an auto-lock mechanism. The paper concludes by outlining further research focusing on implementing the process and identifying emergence at runtime.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010466","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
Denial-of-Service Attacks on Shared Resources in Intel’s Integrated CPU-GPU Platforms 英特尔CPU-GPU集成平台中共享资源的拒绝服务攻击
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812711
M. Bechtel, H. Yun
{"title":"Denial-of-Service Attacks on Shared Resources in Intel’s Integrated CPU-GPU Platforms","authors":"M. Bechtel, H. Yun","doi":"10.1109/ISORC52572.2022.9812711","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812711","url":null,"abstract":"In this paper, we study the effectiveness of denial-of-service (DoS) attacks on Intel’s heterogeneous multicore system-on-chips with integrated GPU (iGPU) in which the last level cache (LLC) and the main memory subsystem are shared between the multicore CPU and the iGPU. Using two Intel processors with iGPU, we evaluate four different DoS attacks, three CPU based and one iGPU based, and show they can induce very high degree of shared resource contention and thus dramatically slowdown the victim’s execution time. We further evaluate the effectiveness of Intel’s recent hardware based shared resource isolation mechanisms, namely Intel Cache Allocation Technology (CAT) and Graphics Technology Class of Service (GT COS), which provide shared LLC partitioning capability for the CPU cores and the iGPU, respectively, in defending against these DoS attacks. Using both synthetic and real-world benchmarks, we find that hardware based LLC partitioning mechanisms does provide spatial LLC space isolation but does not necessarily provide temporal isolation.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115477917","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}
引用次数: 2
Security-Cognizant Real-Time Scheduling 安全认知实时调度
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812766
Sanjoy Baruah
{"title":"Security-Cognizant Real-Time Scheduling","authors":"Sanjoy Baruah","doi":"10.1109/ISORC52572.2022.9812766","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812766","url":null,"abstract":"The often very limited computational capacity available upon resource-constrained safety-critical embedded systems (such as unmanned aerial vehicles) must be carefully managed in order that they may provide the enhanced functionalities expected of them. Such systems are increasingly becoming a target of hacker attacks; hence there is an increased recognition of the need for real-time resource-allocation techniques that are resistant to such attacks. To meet this need we (i) propose a natural security-cognizant extension of the sporadic task model that is currently widely used in real-time computing; and (ii) develop a scheduling algorithm and associated schedulability test for this task model that guarantees correctness of both timing and security properties.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701073","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}
引用次数: 5
Optimal Order Assignment Algorithms for Single-Rate Time-Driven AFAP Cyclic Executives 单速率时间驱动AFAP循环执行器的最优顺序分配算法
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812791
R. J. Bril
{"title":"Optimal Order Assignment Algorithms for Single-Rate Time-Driven AFAP Cyclic Executives","authors":"R. J. Bril","doi":"10.1109/ISORC52572.2022.9812791","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812791","url":null,"abstract":"In a recent survey, it was observed that the majority of the respondents to the question which task scheduling policy/policies are used in considered systems answered “static cycle/table driven/time-triggered”. Cyclic executives, though hardly addressed in contemporary text books, if at all, are therefore still in use in practice. Hence, there is a need for analysis techniques for these executives.In earlier work, exact analysis for single-rate AFAP (as fast as possible) and single-rate time-driven AFAP cyclic executives, scheduling a given sequence of independent hard real-time polling tasks in single-processor systems, have been presented. Unlike the analysis for single-rate AFAP cyclic executives, the analysis for single-rate time-driven AFAP cyclic executives depends on the order of the tasks in the cycle. In this paper, we present two optimal order assignment (OOA) algorithms for single-rate time-driven AFAP cyclic executives. The first algorithm yields a schedulable order of tasks if and only if such an order exists. The second algorithm enhances the first by yielding an order that maximizes the cycle time of the executive, effectively maximizing energy efficiency or improving the average response times of background tasks.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130273211","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
Using Reservoir Sampling and Parallelization to Improve Dynamic Binary Instrumentation 利用储层采样和并行化改进动态二进制仪器
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812825
Brandon E. Upp, Sai Pavan Kumar Meruga, James H. Hill
{"title":"Using Reservoir Sampling and Parallelization to Improve Dynamic Binary Instrumentation","authors":"Brandon E. Upp, Sai Pavan Kumar Meruga, James H. Hill","doi":"10.1109/ISORC52572.2022.9812825","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812825","url":null,"abstract":"This paper investigates two aspects of using dynamic binary instrumentation for real-time instrumentation of a distributed software systems. First, this paper investigates techniques for achieving different levels of visibility (i.e., ensuring all parts of a system are represented, or visible, in final results) into a software system without compromising software system performance. Secondly, this paper investigates how using reservoir sampling can be used to further reduce instrumentation overhead. The results of the research show that reservoir sampling can be used to reduce instrumentation overhead when compared to regular sampling methods like Constant, Percentage and Exhaustive sampling while also providing the desired system visibility.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060936","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
Evaluation of Conditional Tasks in an Artificial DNA System 人工DNA系统中条件任务的评价
2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC) Pub Date : 2022-05-17 DOI: 10.1109/ISORC52572.2022.9812764
Philipp Homann, Mathias Pacher, U. Brinkschulte
{"title":"Evaluation of Conditional Tasks in an Artificial DNA System","authors":"Philipp Homann, Mathias Pacher, U. Brinkschulte","doi":"10.1109/ISORC52572.2022.9812764","DOIUrl":"https://doi.org/10.1109/ISORC52572.2022.9812764","url":null,"abstract":"Artificial DNA (ADNA) is a powerful tool to build embedded systems in a dependable and self-organizing way which is simple to use for programmers. We present an optimization approach for the ADNA system in this paper: The tasks described by the ADNA are statically allocated as of yet. This is critical if the processor load is high and not all of the ADNA’s tasks have to be allocated during the entire run-time of the system. Therefore, we present a conditional ADNA system which is able to conditionally allocate and deallocate tasks at run-time depending on a user-defined condition logic. We evaluate and compare the impact of the expected values of allocated tasks for both the original ADNA and the conditional ADNA system. In addition, we evaluate the conditional tasks’ activation and deactivation times which is important since the ADNA system is designed for real-time systems. The evaluations show that previous time-bounds are met with only a small overhead.","PeriodicalId":379473,"journal":{"name":"2022 IEEE 25th International Symposium On Real-Time Distributed Computing (ISORC)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128449694","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书