2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing最新文献

筛选
英文 中文
Bit-Flip Aware Control-Flow Error Detection 位翻转感知控制流错误检测
G. Nazarian, Diego G. Rodrigues, Álvaro Freitas Moreira, L. Carro, G. Gaydadjiev
{"title":"Bit-Flip Aware Control-Flow Error Detection","authors":"G. Nazarian, Diego G. Rodrigues, Álvaro Freitas Moreira, L. Carro, G. Gaydadjiev","doi":"10.1109/PDP.2015.114","DOIUrl":"https://doi.org/10.1109/PDP.2015.114","url":null,"abstract":"Recent increase of transient fault rates has made processor reliability a major concern. Moreover performance improvements are required for many of today's embedded systems. At the same time software implemented fault detection remains the only option for off-the-shelf processors. Software methods, however, introduce significant performance overheads due to the additional instructions required for the detection. A good observation is that often code segments not susceptible to faults are protected. In this paper we propose a technique for systematic analysis of the bit-flip effects on the program control-flow in order to identify only those locations susceptible to control-flow errors and hence minimize the number of fault detection assertions. We instrument the code with minimal overhead, while maintaining high fault coverage level. Our experiments show that using the result of our bit-flip analysis and limiting the code instrumentation to only the susceptible locations releases 28.9% (on average) of the memory while the level of fault coverage remains the same as with full instrumentation.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114074592","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
Design of Integrated Vulnerabilities Database for Computer Networks Security Analysis 面向计算机网络安全分析的综合漏洞数据库设计
A. Fedorchenko, Igor Kotenko, A. Chechulin
{"title":"Design of Integrated Vulnerabilities Database for Computer Networks Security Analysis","authors":"A. Fedorchenko, Igor Kotenko, A. Chechulin","doi":"10.1109/PDP.2015.38","DOIUrl":"https://doi.org/10.1109/PDP.2015.38","url":null,"abstract":"Integration of existing open vulnerabilities databases allows to increase the probability of detection of vulnerable software and hardware that are used in computer networks and improve the quality of security analysis. The paper is dedicated to investigation of open vulnerabilities databases and of process of their integration for further application in the security analysis system. The object of investigation is the process of integration of vulnerabilities databases. The main distinct of the designed integrated vulnerabilities database is its orientation to operative receiving of results of appropriate vulnerabilities search. The model of the process of the vulnerabilities database generation and the structure of the integrated vulnerabilities database are suggested. The description of the designed prototype and the results of its testing are outlined.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"9 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128256304","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
Optimizing OLAP Cubes Construction by Improving Data Placement on Multi-nodes Clusters 通过改进多节点集群上的数据放置来优化OLAP多维数据集构造
Billel Arres, N. Kabachi, Omar Boussaïd
{"title":"Optimizing OLAP Cubes Construction by Improving Data Placement on Multi-nodes Clusters","authors":"Billel Arres, N. Kabachi, Omar Boussaïd","doi":"10.1109/PDP.2015.45","DOIUrl":"https://doi.org/10.1109/PDP.2015.45","url":null,"abstract":"The increasing volumes of relational data let us find an alternative to cope with them. The Hadoop framework - which is an open source project based on the MapReduce paradigm - is a popular choice for big data analytics. However, the performance gained from Hadoop's features is currently limited by its default block placement policy, which does not take any data characteristics into account. Indeed, the efficiency of many operations can be improved by a careful data placement, including indexing, grouping, aggregation and joins. In this paper we propose a data warehouse placement policy to improve query gain performances on multi nodes clusters, especially Hadoop clusters. We investigate the performance gain for OLAP cube construction query with and without data organization. And this, by varying the number of nodes and data warehouse size. It has been found that, the proposed data placement policy has lowered global execution time for building OLAP data cubes up to 20 percent compared to default data placement.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040378","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}
引用次数: 6
Impact of Data Sharing on Co-Running Embedded Applications in Multi-core System 数据共享对多核系统协同运行嵌入式应用的影响
A. Korotaeva, W. Nebel
{"title":"Impact of Data Sharing on Co-Running Embedded Applications in Multi-core System","authors":"A. Korotaeva, W. Nebel","doi":"10.1109/PDP.2015.88","DOIUrl":"https://doi.org/10.1109/PDP.2015.88","url":null,"abstract":"This work studies utilization of shared caches by applications running concurrently on different cores of multicore systems. Knowledge about program contention due to shared resources is important for various design problems concerning multicore architectures. It is needed for power estimation, scheduling of parallel applications and design of shared memories. Moreover, deep understanding of programs behavior is especially needed for the development of accurate models that are able to predict misses caused by shared resources in multicore systems. We present a methodology that is able to examine the interaction of applications in shared caches. Our experiments show a positive impact of data sharing by minimizing misses in shared L2 caches over a wide range of L2 cache sizes for applications from the Media bench suite. Up to 25% lower misses in the last level cache can be observed for embedded applications, when data are allowed to be shared among programs running on different cores.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130626981","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
System-Level State Equality Detection for the Formal Dynamic Verification of Legacy Distributed Applications 遗留分布式应用形式化动态验证的系统级状态相等检测
Marion Guthmuller, M. Quinson, G. Corona
{"title":"System-Level State Equality Detection for the Formal Dynamic Verification of Legacy Distributed Applications","authors":"Marion Guthmuller, M. Quinson, G. Corona","doi":"10.1109/PDP.2015.95","DOIUrl":"https://doi.org/10.1109/PDP.2015.95","url":null,"abstract":"The ever increasing complexity of distributed systems mandates to formally verify their design and implementation. Unfortunately, the common approaches and existing tools to formally establish the correctness of these systems remain hardly applicable to the kind of legacy applications that are commonly found in the HPC community. We present how system-level memory introspection can be achieved directly at runtime without relying on the source code analysis. We use this mechanism to detect the equality of the application's state at system level. As the storage of the system state may be memory expensive, we compact the memory by sharing unchanged memory pages between snapshots. This enables the automated verification of safety and liveness properties on legacy distributed applications written in Fortran or C/C++ using the MPI standard. We demonstrate the effectiveness of our approach on several programs from the MPICH3 test suite.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133971733","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
Heterogeneous Acceleration of Volumetric JPEG 2000 体积JPEG 2000的异构加速
Jan G. Cornelis, J. Lemeire, T. Bruylants, P. Schelkens
{"title":"Heterogeneous Acceleration of Volumetric JPEG 2000","authors":"Jan G. Cornelis, J. Lemeire, T. Bruylants, P. Schelkens","doi":"10.1109/PDP.2015.112","DOIUrl":"https://doi.org/10.1109/PDP.2015.112","url":null,"abstract":"We present the implementation of a volumetric JPEG 2000 codec as a real-world use case of software acceleration with GPUs and multi-core CPUs. We present a generic methodology to accelerate existing code written in C with OpenCL. Furthermore, we account for the volumetric nature of the processed data and formulate associated optimization guidelines. The resulting software can exploit different accelerator types - GPUs and multi-core CPUs - and delivers a decent speedup on a variety of hardware platforms for a relatively small effort.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036372","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
The Tag Filter Cache: An Energy-Efficient Approach 标签过滤器缓存:一种节能方法
Joan J. Valls, J. Sahuquillo, Alberto Ros, M. E. Gómez
{"title":"The Tag Filter Cache: An Energy-Efficient Approach","authors":"Joan J. Valls, J. Sahuquillo, Alberto Ros, M. E. Gómez","doi":"10.1109/PDP.2015.58","DOIUrl":"https://doi.org/10.1109/PDP.2015.58","url":null,"abstract":"Power consumption in current high-performance chip multiprocessors (CMPs) has become a major design concern. The current trend of increasing the core count aggravates this problem. On-chip caches consume a significant fraction of the total power budget. Most of the proposed techniques to reduce the energy consumption of these memory structures are at the cost of performance, which may become unacceptable for high-performance CMPs. On-chip caches in multi-core systems are usually deployed with a high associativity degree in order to enhance performance. Even first-level caches are currently implemented with eight ways. The concurrent access to all the ways in the cache set is costly in terms of energy. In this paper we propose an energy-efficient cache design, namely the Tag Filter Cache (TF-Cache) architecture, that filters some of the set ways during cache accesses, allowing to access only a subset of them without hurting the performance. Our cache for each way stores the lowest order tag bits in an auxiliary bit array and these bits are used to filter the ways that do not match those bits in the searched block tag. Experimental results show that, on average, the TF-Cache architecture reduces the dynamic power consumption up to 74.9% and 85.9% when applied to the L1 and L2 cache, respectively, for the studied applications.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936202","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
Dynamic Guaranteed Service Communication on Best-Effort Networks-on-Chip 片上网络的动态保证服务通信
Peter Munk, Matthias Freier, Jan Richling, Jian-Jia Chen
{"title":"Dynamic Guaranteed Service Communication on Best-Effort Networks-on-Chip","authors":"Peter Munk, Matthias Freier, Jan Richling, Jian-Jia Chen","doi":"10.1109/PDP.2015.47","DOIUrl":"https://doi.org/10.1109/PDP.2015.47","url":null,"abstract":"In order to execute applications under real-time constraints on many-core processors with a Network-on-Chip (NoC), guaranteed service (GS) communication with guaranteed end-to-end latency and bandwidth is required. Several hardware-based solutions for GS communication have been proposed in literature. However, commercially available many-core processors, e.g., Tilera's Tile Pro64 or Adapt Eva's Epiphany, do not support such features. In this paper, we propose a software solution that allows GS communication on 2D-mesh packet-switching NoCs. Our investigation is based on a hardware model that is applicable to commercially available processors, which include multiple NoCs to separate request and response packets and support only best-effort communication. We prove that a common upper bound of the injection rate for all sources limits the congestion which leads to an upper bound of the worst-case transmission latency (WCTL) for any transmission, i.e., the combination of a request and a response packet. Furthermore, our approach supports arbitrary transmission streams that can be modified at runtime without violating the upper bound of the WCTL, as long as the injection rate is not violated. This enables adaptive features such as task migration or dynamic scheduling policies. Experiments evaluate our solution for different traffic patterns.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123945489","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}
引用次数: 12
Mutual Influence of Application- and Platform-Level Adaptations on Energy-Efficient Computing 应用级和平台级适应对节能计算的相互影响
K. Rybina, W. Dargie, René Schöne, S. Malakuti
{"title":"Mutual Influence of Application- and Platform-Level Adaptations on Energy-Efficient Computing","authors":"K. Rybina, W. Dargie, René Schöne, S. Malakuti","doi":"10.1109/PDP.2015.9","DOIUrl":"https://doi.org/10.1109/PDP.2015.9","url":null,"abstract":"We experimentally investigate the mutual influence of application- and platform-level adaptations in a virtualized cluster environment. At the application level, applications can adapt to a changing execution environment by dynamically exchanging components that enable them to trade energy for utility and vice versa. Likewise, at the platform level, virtual machine monitors can migrate virtual machines from one server to another either to consolidate workloads and switch-off underutilized servers or to distribute the workload of overloaded servers. Our experiment quantify impacts of various types of adaptations on QoS, power consumption, and energy-overhead.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102118","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
An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem 求解可满足性问题的高效GPU蚁群算法
Hassan A. Youness, Aziza Ibraheim, M. Moness, M. Osama
{"title":"An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem","authors":"Hassan A. Youness, Aziza Ibraheim, M. Moness, M. Osama","doi":"10.1109/PDP.2015.59","DOIUrl":"https://doi.org/10.1109/PDP.2015.59","url":null,"abstract":"This paper focuses on solving the Boolean Satisfiability (SAT) problem using a parallel implementation of the Ant Colony Optimization (ACO) algorithm for execution on the Graphics Processing Unit (GPU) using NVIDIA CUDA (Compute Unified Device Architecture). We propose a new efficient parallel strategy for the ACO algorithm executed entirely on the CUDA architecture, and perform experiments to compare it with the best sequential version exists implemented on CPU with incomplete approaches. We show how SAT problem can benefit from the GPU solutions, leading to significant improvements in speed-up even though keeping the quality of the solution. Our results shows that the new parallel implementation executes up to 21x faster compared to its sequential counterpart.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116050702","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}
引用次数: 10
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学术官方微信