Proceedings of the Computing Frontiers Conference最新文献_第5页

AXIOM project: from applied research towards embedded systems AXIOM项目:从应用研究到嵌入式系统

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3095085

Davide Catani

引用次数: 0

Proceedings of the Computing Frontiers Conference 计算机前沿会议论文集

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564

R. Giorgi, M. Becchi, F. Palumbo

引用次数: 0

ARM HPC Ecosystem and the Reemergence of Vectors: Invited Paper ARM高性能计算生态系统和载体的重新出现:特邀论文

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3095086

Alejandro Rico, José A. Joao, Chris Adeniyi-Jones, E. V. Hensbergen

引用次数: 22

Using Tweaks To Design Fault Resistant Ciphers (Full Version) 使用微调设计抗故障密码(完整版)

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3091965

Sikhar Patranabis, Debapriya Basu Roy, Debdeep Mukhopadhyay

{"title":"Using Tweaks To Design Fault Resistant Ciphers (Full Version)","authors":"Sikhar Patranabis, Debapriya Basu Roy, Debdeep Mukhopadhyay","doi":"10.1145/3075564.3091965","DOIUrl":"https://doi.org/10.1145/3075564.3091965","url":null,"abstract":"Side channel analysis and active fault analysis are now major threats to even mathematically robust cryptographic algorithms that are otherwise resistant to classical cryptanalysis. It is necessary to design suitable countermeasures to protect cryptographic primitives against such attacks. This paper focuses on designing encryption schemes that are innately secure against fault analysis. The paper formally proves that one such design strategy namely the use of key-dependent S-Boxes, is only partially secure against DFA. The paper then examines the fault tolerance of encryption schemes that use a key-independent secret tweak value for randomization. In particular, the paper focuses on a linear tweak based and a non-linear tweak based version of a recently proposed block cipher DRECON. The paper demonstrates that while both versions are secure against classical DFA, the non-linear tweak based version provides greater fault coverage against stronger fault models. This fact, together with the DPA resistance provided by the use of variable S-Boxes, makes DRECON a strong candidate for the design of secure cryptographic primitives. All claims have been validated by experimental results on a SASEBO GII platform.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127671335","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

Finding Maximum Cliques on a Quantum Annealer 在量子退火炉上寻找最大团

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075575

Guillaume Chapuis, H. Djidjev, Georg Hahn, Guillaume Rizk

{"title":"Finding Maximum Cliques on a Quantum Annealer","authors":"Guillaume Chapuis, H. Djidjev, Georg Hahn, Guillaume Rizk","doi":"10.1145/3075564.3075575","DOIUrl":"https://doi.org/10.1145/3075564.3075575","url":null,"abstract":"This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, and compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914552","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}

引用次数: 23

Addressing Hadoop's Small File Problem With an Appendable Archive File Format 用可附加的存档文件格式解决Hadoop的小文件问题

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3078888

T. Renner, Johannes Müller, L. Thamsen, O. Kao

{"title":"Addressing Hadoop's Small File Problem With an Appendable Archive File Format","authors":"T. Renner, Johannes Müller, L. Thamsen, O. Kao","doi":"10.1145/3075564.3078888","DOIUrl":"https://doi.org/10.1145/3075564.3078888","url":null,"abstract":"Hadoop has been used widely for data analytic tasks in various domains. At the same time, data volume is expected to grow even further in the next years. Hadoop recently introduced the concept Archival Storage, an automated tiered storage technique for increasing storage capacity for long-term storage. However, Hadoop Distributed File System's scalability is limited by the total number of files that can be stored, and it is likely that the number of files increases fast when using it for archival purposes. This paper presents an approach for improving HDFS' scalability when using it as an archival storage. We present a tool that extends Hadoop Archive to an appendable file format. New files are appended to one of the existing archive data files efficiently without rewriting the whole archive. Therefore, a first fit algorithm is used to fill up the often not fully utilized fixed-sized data blocks of the archive data files. Index files are updated using a red-black tree providing guaranteed fast lookup and insert performance. We show that the tool performs well for different sizes of archives and number of files to add. By distributing new files efficiently, we also reduce the number of data blocks needed for archiving and, thus, reduce the memory footprint on the NameNode.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125916244","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}

引用次数: 8

Data mining the memory access stream to detect anomalous application behavior 数据挖掘内存访问流，以检测异常的应用程序行为

Proceedings of the Computing Frontiers Conference Pub Date : 2017-05-15 DOI: 10.1145/3075564.3075578

Francis B. Moreira, M. Diener, P. Navaux, I. Koren

{"title":"Data mining the memory access stream to detect anomalous application behavior","authors":"Francis B. Moreira, M. Diener, P. Navaux, I. Koren","doi":"10.1145/3075564.3075578","DOIUrl":"https://doi.org/10.1145/3075564.3075578","url":null,"abstract":"Detecting anomalous application executions is a challenging problem, due to the diversity of anomalies that can occur, such as programming bugs, silent data corruption, or even malicious code corruption. Moreover, the similarity to a regular execution that can occur in these cases, especially in silent data corruption, makes distinction from normal executions difficult. In this paper, we develop a mechanism that can detect such anomalous executions based on changes in the memory access pattern of an application. We analyze memory patterns using a two-level machine learning approach. First, we classify the behavior of different memory access periods within applications using Gaussian mixtures. Then, based on these classifications, we construct matrix representations of Markov chains to obtain information regarding the temporal behavior of these memory accesses. Based on metrics of matrix similarity, we can classify whether the application behaves as expected or anomalously. Using gradient boosting on the metrics of matrix similarity, our technique correctly classifies more than 85% of all executions, identifying instances of the same application and different applications. We can also detect a range of faulty executions caused by benign or malicious permanent bit flips in the code section.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128368770","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

Vectorization of Hybrid Breadth First Search on the Intel Xeon Phi 英特尔 Xeon Phi 上混合广度优先搜索的矢量化

Proceedings of the Computing Frontiers Conference Pub Date : 2017-04-07 DOI: 10.1145/3075564.3075573

Mireya Paredes, G. Riley, M. Luján

引用次数: 3

Runtime Aware Architectures 运行时感知架构

Proceedings of the Computing Frontiers Conference Pub Date : 2015-08-24 DOI: 10.1109/IPDPS.2017.130

M. Valero

引用次数: 2