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

Private inter-network routing for Wireless Sensor Networks and the Internet of Things 无线传感器网络和物联网的专用网络间路由

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

P. Palmieri, L. Calderoni, D. Maio

{"title":"Private inter-network routing for Wireless Sensor Networks and the Internet of Things","authors":"P. Palmieri, L. Calderoni, D. Maio","doi":"10.1145/3075564.3079068","DOIUrl":"https://doi.org/10.1145/3075564.3079068","url":null,"abstract":"As computing becomes increasingly pervasive, different heterogeneous networks are connected and integrated. This is especially true in the Internet of Things (IoT) and Wireless Sensor Networks (WSN) settings. However, as different networks managed by different parties and with different security requirements are integrated, security becomes a primary concern. WSN nodes, in particular, are often deployed \"in the open\", where a potential attacker can gain physical access to the device. As nodes can be deployed in hostile or difficult scenarios, such as military battlefields or disaster recovery settings, it is crucial to avoid escalation from successful attacks on a single node to the whole network, and from there to other connected networks. It is therefore crucial to secure the communication within the WSN, and in particular, maintain context information, such as the network topology and the location and identity of base stations (which collect data gathered by the sensors) private. In this paper, we propose a protocol achieving anonymous routing between different interconnected IoT or WSN networks, based on the Spatial Bloom Filter (SBF) data structure. The protocol enables communications between the nodes through the use of anonymous identifiers, thus hiding the location and identity of the nodes within the network. The proposed routing strategy preserves context privacy, and prevents adversaries from learning the network structure and topology, as routing information is encrypted using a homomorphic encryption scheme, and computed only in the encrypted domain. Preserving context privacy is crucial in preventing adversaries from gaining valuable network information from a successful attacks on a single node of the network, and reduces the potential for attack escalation.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"14 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":"114064139","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

Brain-Inspired Memory Architecture for Sparse Nonlocal and Unstructured Workloads 稀疏非局部和非结构化工作负载的脑启发内存架构

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

Y. Katayama

引用次数: 0

Design of S-boxes Defined with Cellular Automata Rules 用元胞自动机规则定义的s盒设计

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

S. Picek, L. Mariot, Bohan Yang, D. Jakobović, N. Mentens

{"title":"Design of S-boxes Defined with Cellular Automata Rules","authors":"S. Picek, L. Mariot, Bohan Yang, D. Jakobović, N. Mentens","doi":"10.1145/3075564.3079069","DOIUrl":"https://doi.org/10.1145/3075564.3079069","url":null,"abstract":"The aim of this paper is to find cellular automata (CA) rules that are used to describe S-boxes with good cryptographic properties and low implementation cost. Up to now, CA rules have been used in several ciphers to define an S-box, but in all those ciphers, the same CA rule is used. This CA rule is best known as the one defining the Keccak χ transformation. Since there exists no straightforward method for constructing CA rules that define S-boxes with good cryptographic/implementation properties, we use a special kind of heuristics for that -- Genetic Programming (GP). Although it is not possible to theoretically prove the efficiency of such a method, our experimental results show that GP is able to find a large number of CA rules that define good S-boxes in a relatively easy way. We focus on the 4 x 4 and 5 x 5 sizes and we implement the S-boxes in hardware to examine implementation properties like latency, area, and power. Particularly interesting is the internal encoding of the solutions in the considered heuristics using combinatorial circuits; this makes it easy to approximate S-box implementation properties like latency and area a priori.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"10 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":"115130621","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}

引用次数: 39

Exploring the Performance Limits of Out-of-order Commit 探索乱序提交的性能限制

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

M. Alipour, Trevor E. Carlson, S. Kaxiras

{"title":"Exploring the Performance Limits of Out-of-order Commit","authors":"M. Alipour, Trevor E. Carlson, S. Kaxiras","doi":"10.1145/3075564.3075581","DOIUrl":"https://doi.org/10.1145/3075564.3075581","url":null,"abstract":"Out-of-order execution is essential for high performance, general-purpose computation, as it can find and execute useful work instead of stalling. However, it is limited by the requirement of visibly sequential, atomic instruction execution --- in other words in-order instruction commit. While in-order commit has its advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, registers) until they are released in program order. In contrast, out-of-order commit releases resources much earlier, yielding improved performance with fewer traditional hardware resources. However, out-of-order commit is limited in terms of correctness by the conditions described in the work of Bell and Lipasti. In this paper we revisit out-of-order commit from a different perspective, not by proposing another hardware technique, but by examining these conditions one by one and in combination with respect to their potential performance benefit for both non-speculative and speculative out-of-order commit. While correctly handling recovery for all out-of-order commit conditions currently requires complex tracking and expensive checkpointing, this work aims to demonstrate the potential for selective, speculative out-of-order commit using an oracle implementation without speculative rollback costs. We learn that: a) there is significant untapped potential for aggressive variants of out-of-order commit; b) it is important to optimize the commit depth, or the search distance for out-of-order commit, for a balanced design: smaller cores can benefit from shorter depths while larger cores continue to benefit from aggressive parameters; c) the focus on a subset of out-of-order commit conditions could lead to efficient implementations; d) the benefits for out-of-order commit increase with higher memory latency and works well in conjunction with prefetching to continue to improve performance.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"3 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":"124889400","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}

引用次数: 9

Designing and Programming the Configurable Cloud 可配置云的设计与编程

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

Andrew Putnam

{"title":"Designing and Programming the Configurable Cloud","authors":"Andrew Putnam","doi":"10.1145/3075564.3095083","DOIUrl":"https://doi.org/10.1145/3075564.3095083","url":null,"abstract":"Process technology improvements have historically allowed an effortless expansion of the capacity and capabilities of computers and the cloud with few changes to the underlying software or programming model. However, the end of Dennard Scaling means that performance and efficiency gains will rely on the customization of the hardware for each application. Yet customizing hardware for each application runs contrary to the trend to moving more and more applications to a common hardware infrastructure the Cloud. Microsofts Catapult project has brought the power and performance of FPGA-based reconfigurable computing to hyperscale datacenters, accelerating major production cloud applications such as Bing web search and Microsoft Azure, and enabling a new generation of machine learning and artificial intelligence applications. These diverse workloads are accelerated using the same underlying hardware by using highly programmable silicon. The presence of ubiquitous and programmable silicon in the datacenter enables a new era of hardware/software co-design across a wide variety of workloads, opening up affordable and efficient performance across an enormous set of workloads. Catapult is now deployed in nearly every new server across the more than a million machines that make up the Microsoft hyperscale cloud. In this talk, I will describe the next generation of the Catapult configurable cloud architecture, and the tools and techniques that have made Catapult successful to date. I will discuss areas where traditional hardware and software development flows fall short, the domains where this programmable hardware holds the most potential, and how this technology can enable new computing frontiers.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"1 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":"129778573","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

Recommending Resources to Cloud Applications based on Custom Templates Composition 基于自定义模板组合向云应用程序推荐资源

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

Ronny Bazan Antequera, P. Calyam, A. Chandrashekara, Shivoam Malhotra

{"title":"Recommending Resources to Cloud Applications based on Custom Templates Composition","authors":"Ronny Bazan Antequera, P. Calyam, A. Chandrashekara, Shivoam Malhotra","doi":"10.1145/3075564.3075582","DOIUrl":"https://doi.org/10.1145/3075564.3075582","url":null,"abstract":"Emerging interdisciplinary data-intensive applications in science and engineering fields (e.g. bioinformatics, cybermanufacturing) demand the use of high-performance computing resources. However, data-intensive applications' local resources usually present limited capacity and availability due to sizable upfront costs. The applications requirements warrant intelligent resource 'abstractions' coupled with 'reusable' approaches to save time and effort in deploying cyberinfrastructure (CI). In this paper, we present a novel 'custom templates' management middleware to overcome this scarcity of resources by use of advanced CI management technologies/protocols to on-demand deploy data-intensive applications across distributed/federated cloud resources. Our middleware comprises of a novel resource recommendation scheme that abstracts user requirements of data-intensive applications and matches them with federated cloud resources using custom templates in a catalog. We evaluate the accuracy of our recommendation scheme in two experiment scenarios. The experiments involve simulating a series of user interactions with diverse applications requirements, also feature a real-world data-intensive application case study. Our experiment results show that our scheme improves the resource recommendation accuracy by up to 21%, compared to the existing schemes.","PeriodicalId":398898,"journal":{"name":"Proceedings of the Computing Frontiers Conference","volume":"90 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":"126239564","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

CAROL-FI: an Efficient Fault-Injection Tool for Vulnerability Evaluation of Modern HPC Parallel Accelerators CAROL-FI:现代高性能计算并行加速器漏洞评估的高效故障注入工具

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

Daniel Oliveira, Vinicius Fratin, P. Navaux, I. Koren, P. Rech

引用次数: 12

Towards Big Data Visualization for Monitoring and Diagnostics of High Volume Semiconductor Manufacturing 面向大批量半导体制造监控与诊断的大数据可视化

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

D. Gkorou, A. Ypma, G. Tsirogiannis, Manuel Giollo, Dag Sonntag, Geert Vinken, Richard van Haren, Robert Jan van Wijk, Jelle Nije, Tomoko Hoogenboom

引用次数: 7

On Learning the Energy Model of an MPSoC for Convex Optimization 基于凸优化的MPSoC能量模型学习

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

Erwan Nogues, D. Ménard, Alexandre Mercat, M. Pelcat

引用次数: 1

DPA on hardware implementations of Ascon and Keyak Ascon和Keyak硬件实现的DPA

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

Niels Samwel, J. Daemen

引用次数: 25