Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools最新文献

筛选
英文 中文
A Bank-Wise DRAM Power Model for System Simulations 用于系统仿真的银行智能DRAM功耗模型
Deepak M. Mathew, Éder F. Zulian, Subash Kannoth, Matthias Jung, C. Weis, N. Wehn
{"title":"A Bank-Wise DRAM Power Model for System Simulations","authors":"Deepak M. Mathew, Éder F. Zulian, Subash Kannoth, Matthias Jung, C. Weis, N. Wehn","doi":"10.1145/3023973.3023978","DOIUrl":"https://doi.org/10.1145/3023973.3023978","url":null,"abstract":"DRAM devices contribute significantly to the power consumption of today's computing systems. As the DRAM banks are getting denser, bank-wise power contribution is becoming more and more significant in modern DRAM devices. Therefore, DDR3 and LPDDR3/4 devices support Partial Array Self Refresh (PASR), while the latter and High Bandwidth Memory (HBM) provide additionally Per-Bank Refresh. To evaluate the benefits of these new sophisticated features in design space explorations, it is essential to have an accurate and fast Bank-Wise DRAM power model, which can be easily integrated into system level simulators. To the best of our knowledge, there exists no DRAM power model, which supports the aforementioned features. In this work, we present the fundamental equations for modeling bank-wise DRAM power. This model supports PASR and Per-Bank Refresh and is calibrated with measurements from various DRAM devices to improve the accuracy instead of using pessimistic datasheet values.","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126026064","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}
引用次数: 14
Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality Systems 基于约束的混合临界系统设计空间探索中的吞吐量传播
Kathrin Rosvall, N. Khalilzad, George Ungureanu, I. Sander
{"title":"Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality Systems","authors":"Kathrin Rosvall, N. Khalilzad, George Ungureanu, I. Sander","doi":"10.1145/3023973.3023977","DOIUrl":"https://doi.org/10.1145/3023973.3023977","url":null,"abstract":"When designing complex mixed-critical systems on multiprocessor platforms, a huge number of design alternatives has to be evaluated. Therefore, there is a need for tools which systematically find and analyze the ample alternatives and identify solutions that satisfy the design constraints. The recently proposed design space exploration (DSE) tool DeSyDe uses constraint programming (CP) to find implementations with performance guarantees for multiple applications with potentially mixed-critical design constraints on a shared platform. A key component of the DeSyDe tool is its throughput analysis component, called a throughput propagator in the context of CP. The throughput propagator guides the exploration by evaluating each design decision and is therefore executed excessively throughout the exploration. This paper presents two throughput propagators based on different analysis methods for DeSyDe. Their performance is evaluated in a range of experiments with six different application graphs, heterogeneous platform models and mixed-critical design constraints. The results suggest that the MCR throughput propagator is more efficient.","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132555784","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
Towards State-Based RT Analysis of FSM-SADFGs on MPSoCs with Shared Memory Communication 基于状态的共享内存通信mpsoc上fsm - sadfg的RT分析
R. Stemmer, Maher Fakih, Kim Grüttner, W. Nebel
{"title":"Towards State-Based RT Analysis of FSM-SADFGs on MPSoCs with Shared Memory Communication","authors":"R. Stemmer, Maher Fakih, Kim Grüttner, W. Nebel","doi":"10.1145/3023973.3023979","DOIUrl":"https://doi.org/10.1145/3023973.3023979","url":null,"abstract":"Scenario-Aware Data-Flow Graphs (SADFGs) were introduced to capture the behavior of embedded applications achieving a good trade-off between expressiveness and analyzability. On the one side, they support the timing analysis of real-time applications, especially those running on MPSoCs, due to the clean separation of computation and communication phases in their executing nodes. On the other side, SADFGs allow the expression of a more dynamic behaviors than Synchronous dataflow graphs by allowing dynamic token-rates of single nodes depending on pre-defined typical scenarios. The fact which leads to more efficiency and better throughput. In this paper, we describe the extension of a previous model-checking based real-time analysis approach to allow the analysis of timing bounds for FSM-SADFGs mapped on a shared memory multiprocessor architecture. We demonstrate our approach on an MPEG decoder application being viable to obtain the worst-case end-to-end latency of its implementation under different scenarios on a 2-tiles MPSoC.","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633920","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}
引用次数: 1
Early Stage Interference Checking for Automatic Design Space Exploration of Mixed Critical Systems 混合临界系统自动设计空间探索的早期干扰检测
E. Vitali, G. Palermo
{"title":"Early Stage Interference Checking for Automatic Design Space Exploration of Mixed Critical Systems","authors":"E. Vitali, G. Palermo","doi":"10.1145/3023973.3023976","DOIUrl":"https://doi.org/10.1145/3023973.3023976","url":null,"abstract":"Significant improvements have been made to support the design of mixed-critical systems by developing predictable computing platforms and mechanisms for temporal and spatial segregation between applications of different criticalities sharing the same computing platform. However the design of such Multi-Processor System-on-Chips (MPSoCs) supporting mixed-critical applications needs methodologies and tools to improve the analyzability regarding system configuration and application mapping. Among the required techniques, in this work we focus on the possibility to identify, at the early stages of the design, possible unexpected interactions among tasks relying to different criticalities. In particular, we introduce a dependency check tool to automatically find possible interactions between tasks during the design of a mixed critical embedded system. The proposed tool searches on an abstract system model for the possible interactions, thus helping pruning all the design configurations not respecting the considered criticality constraints. In this way the methodology can be used to speed-up the following design space exploration phase based on functional models (e.g. simulation based) avoiding costly evaluations. Even if the methodology is general, up to now only the timing aspect has been fully modeled and developed, so this paper will focus on this aspect.","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125009096","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
Adaptive Cache Warming for Faster Simulations 自适应缓存升温更快的模拟
Gustaf Borgström, Andreas Sembrant, D. Black-Schaffer
{"title":"Adaptive Cache Warming for Faster Simulations","authors":"Gustaf Borgström, Andreas Sembrant, D. Black-Schaffer","doi":"10.1145/3023973.3023974","DOIUrl":"https://doi.org/10.1145/3023973.3023974","url":null,"abstract":"The use of hardware-based virtualization allows modern simulators to very quickly fast-forward between sample points and regions of interest. This dramatically reduces the simulation time compared to traditional functional forwarding. However, as the fast-forwarding takes place through virtualized execution on the native hardware, it is unable to warm simulated structures, such as caches. As a result, sampled simulations taking advantage of virtualization for fast-forwarding find their execution time dominated by functional warming. To address the cost of warming, we present Adaptive Cache Warming (ACW), a new fast method that determines how much warming each sample/phase/application needs. ACW takes advantage of the virtualization-based fast-forwarding to search for the minimum warming time required during simulation. To determine when the cache is sufficiently warm, ACW uses heuristics based on the last-level cache's cold-set misses. Our results show that typical practice of conservatively warming last-level caches for around 100M instructions is a vast overkill for nearly all checkpoints. By using ACW, we can adapt the warming per-sample and speedup the simulation by 92--103× on average (512× speedup maximum) depending on cache size (2-32MB).","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122983","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
Accelerating MPSoC Simulation Using Parallel SystemC and Processor Sleep Models 使用并行系统和处理器睡眠模型加速MPSoC仿真
Jan Weinstock, R. Leupers, G. Ascheid
{"title":"Accelerating MPSoC Simulation Using Parallel SystemC and Processor Sleep Models","authors":"Jan Weinstock, R. Leupers, G. Ascheid","doi":"10.1145/3023973.3023975","DOIUrl":"https://doi.org/10.1145/3023973.3023975","url":null,"abstract":"High simulation speed is always a concern for developers of virtual platforms, especially given the ever increasing number of processors in modern designs. On the one hand, parallel simulation has appeared as a promising candidate, but has yet to be fully studied in realistic virtual platforms such as those deployed by the industry today. On the other hand, omission of unneeded simulation details, such as skipping simulation of processors in idle or low-power states, also improves performance. This work studies both approaches combined in a realistic virtual platform, achieving average performance gains of 3.2x over sequential simulation.","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126640188","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}
引用次数: 1
Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools 第九届快速仿真与性能评估研讨会论文集:方法与工具
{"title":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","authors":"","doi":"10.1145/3023973","DOIUrl":"https://doi.org/10.1145/3023973","url":null,"abstract":"","PeriodicalId":131314,"journal":{"name":"Proceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126387338","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学术文献互助群
群 号:481959085
Book学术官方微信