Proceedings of the 15th ACM International Conference on Computing Frontiers最新文献

Digital signatures and signcryption schemes on embedded devices: a trade-off between computation and storage 嵌入式设备上的数字签名和签名加密方案:计算和存储之间的权衡

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3206426

J. Winderickx, An Braeken, Dave Singelée, R. Peeters, T. Vandenryt, R. Thoelen, N. Mentens

引用次数: 1

On the theory of speculative checkpointing: time and energy considerations 论投机检查点理论:时间和精力的考虑

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3203232

Omer Subasi, S. Krishnamoorthy

{"title":"On the theory of speculative checkpointing: time and energy considerations","authors":"Omer Subasi, S. Krishnamoorthy","doi":"10.1145/3203217.3203232","DOIUrl":"https://doi.org/10.1145/3203217.3203232","url":null,"abstract":"Collective checkpoint/rollback is the most popular approach for dealing with fail-stop errors on high-performance computing platforms. Prior work has focused on choosing checkpoint intervals that minimize the total cost of checkpoint/rollback. This work introduces the notion of speculative checkpointing, where we probabilistically skip some checkpoints. The careful selection of checkpoints either to be taken or skipped has the potential to reduce the total checkpoint/rollback overhead. We mathematically formulate the overall checkpoint/rollback cost in the presence of speculation. We consider the choice of speculation as a fixed probability or a probability distribution. We formulate two criteria to be minimized: total execution time and approximate total energy. We derive the criteria for beneficial speculative checkpointing for exponential and arbitrary failure distributions. Furthermore, we analyze the joint optimization of energy and time to express the trade-offs mathematically. We validate the formulations and evaluate various scenarios using discrete-event simulation. Experimental evaluation validates the models and demonstrates that employing speculation and choosing to speculate by sampling a distribution derived from the failure distribution achieves the best performance.","PeriodicalId":127096,"journal":{"name":"Proceedings of the 15th ACM International Conference on Computing Frontiers","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122535667","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

A constrained extremum-seeking control for CPU thermal management CPU热管理的约束极值寻优控制

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3204464

F. Reghenzani, S. Formentin, G. Massari, W. Fornaciari

引用次数: 4

Automatic instrumentation of dataflow applications using PAPI 使用PAPI的数据流应用程序的自动检测

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3209886

D. Madroñal, Antoine Morvan, R. Lazcano, R. Salvador, K. Desnos, E. J. Martínez, C. Sanz

{"title":"Automatic instrumentation of dataflow applications using PAPI","authors":"D. Madroñal, Antoine Morvan, R. Lazcano, R. Salvador, K. Desnos, E. J. Martínez, C. Sanz","doi":"10.1145/3203217.3209886","DOIUrl":"https://doi.org/10.1145/3203217.3209886","url":null,"abstract":"The widening of the complexity-productivity gap witnessed in the last years is becoming unaffordable from the application development point of view. New design methods try to automate most designers tasks in order to bridge this gap. In addition, new Models of Computation (MoC), as those dataflow-based, ease the expression of parallelism within applications and lead to higher productivity. Rapid prototyping design tools offer fast estimations of the soundness of design choices. A key step when prototyping an application is to have representative performance indicators to estimate the validity of the design choices. Such indicators can be obtained using hardware information through the Performance API (PAPI). In this work, PAPI and a dataflow MoC are integrated within a Y-chart design flow. The implementation takes the form of a dedicated automatic code generation scheme within the Preesm tool. Preliminary results show that depending on the complexity of the application, the computation time overhead due to monitoring varies from being almost negligible to more than 50%. Also, on top of offering accurate hardware performance indicators, the extracted values can be combined to estimate power or energy consumption.","PeriodicalId":127096,"journal":{"name":"Proceedings of the 15th ACM International Conference on Computing Frontiers","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134086375","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

Similarity based classification of ADHD using singular value decomposition 基于相似性的ADHD奇异值分解分类

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3203239

Taban Eslami, F. Saeed

{"title":"Similarity based classification of ADHD using singular value decomposition","authors":"Taban Eslami, F. Saeed","doi":"10.1145/3203217.3203239","DOIUrl":"https://doi.org/10.1145/3203217.3203239","url":null,"abstract":"Attention deficit hyperactivity disorder (ADHD) is one of the most common brain disorders among children. This disorder is considered as a big threat for public health and causes attention, focus and organizing difficulties for children and even adults. Since the cause of ADHD is not known yet, data mining algorithms are being used to help discover patterns which discriminate healthy from ADHD subjects. Numerous efforts are underway with the goal of developing classification tools for ADHD diagnosis based on functional and structural magnetic resonance imaging data of the brain. In this paper, we used Eros, which is a technique for computing similarity between two multivariate time series along with k-Nearest-Neighbor classifier, to classify healthy vs ADHD children. We designed a model selection scheme called J-Eros which is able to pick the optimum value of k for k-Nearest-Neighbor from the training data. We applied this technique to the public data provided by ADHD-200 Consortium competition and our results show that J-Eros is capable of discriminating healthy from ADHD children such that we outperformed the best results reported by ADHD-200 competition about 20 percent for two datasets. The implemented code is available as GPL license on GitHub portal of our lab at https://github.com/pcdslab/J-Eros.","PeriodicalId":127096,"journal":{"name":"Proceedings of the 15th ACM International Conference on Computing Frontiers","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114983545","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}

引用次数: 24

Data cube and cloud resources as platform for seamless geospatial computation 数据立方体和云资源作为无缝地理空间计算的平台

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3205861

G. Pagani, L. Trani

引用次数: 4

CMH: compression management for improving capacity in the hybrid memory cube CMH:用于提高混合内存多维数据集容量的压缩管理

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3203235

Cheng Qian, Libo Huang, Qi Yu, Zhiying Wang, B. Childers

{"title":"CMH: compression management for improving capacity in the hybrid memory cube","authors":"Cheng Qian, Libo Huang, Qi Yu, Zhiying Wang, B. Childers","doi":"10.1145/3203217.3203235","DOIUrl":"https://doi.org/10.1145/3203217.3203235","url":null,"abstract":"The Hybrid Memory Cube (HMC) is a novel 3D memory architecture that efficiently improves bandwidth and saves energy. However, due to limitations in scalability and power density of a DRAM bit cell, the physical data capacity of an individual HMC is relatively modest and unlikely to grow significantly and it is likely to be a challenge in adopting the HMC for big data in high-performance computing. In this paper, we propose a new strategy to increase the effective data capacity of the HMC, called Compression Management for HMC (CMH). CMH is incorporated in the logic layer of the HMC. By selectively compressing data during transmission and storing the selectively compressed data in the 3D memory stack, CMH increases data capacity while also improving effective bandwidth. For several memory-intensive benchmarks, our results show that CMH reduces pressure on memory capacity by 64.4%, and improves bandwidth by 42.4%. Similarly good results are observed for multi-programmed workloads, reducing capacity 66.2% and improving bandwidth 47.8%. Although compression has latency overhead, by introducing a small cache in the HMC logic layer to store metadata for compression, CMH mitigates any increase in transaction latency. The overhead in instructions per cycle is a minimal 1.2% and 1.5%, respectively, for single-core and multi-core workloads. The IPC is stable and is not harmed by the inclusion of compression.","PeriodicalId":127096,"journal":{"name":"Proceedings of the 15th ACM International Conference on Computing Frontiers","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609811","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}

引用次数: 7

Network-on-chip evaluation for a novel neural architecture 一种新型神经结构的片上网络评价

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3203268

Markos Kynigos, J. Navaridas, L. Plana, S. Furber

引用次数: 3

GraphBLAS: handling performance concerns in large graph analytics GraphBLAS:处理大型图形分析中的性能问题

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3205342

Manoj Kumar, J. Moreira, P. Pattnaik

{"title":"GraphBLAS: handling performance concerns in large graph analytics","authors":"Manoj Kumar, J. Moreira, P. Pattnaik","doi":"10.1145/3203217.3205342","DOIUrl":"https://doi.org/10.1145/3203217.3205342","url":null,"abstract":"Emerging applications in health-care, social media analytics, cyber-security, homeland security, and marketing require large graph analytics. Attaining good performance on these applications on modern day hardware is challenging because of the complex pipelines and deep memory hierarchy of these machines. In this paper, we review the linear algebra formulation of graph-analytics and show that it effectively handles the separation of performance concerns, best handled by system developers, from application logic concerns. The linear algebra formulation leverages the community experience in optimizing both hardware and software for applications that have a substantial linear algebra component. We review the GraphBLAS API, a compact C API for linear algebra formulation of graph algorithms. The core semiring operations are described first, followed by the rest of the API. We then illustrate how commonly used graph algorithms are implemented using the main GraphBLAS API calls. Executing these algorithms on a highly optimized linear algebra run-time validates that the time spent in execution of the algorithm is indeed almost entirely in the library, thus delegating the performance concerns solely to the library developer. Furthermore, the linear algebra formulation consistently outperforms the textbook version of these algorithms by a factor of two to five. Vector and matrix multiplications consume the majority of the computational time, particularly as problem size increases, putting them in the cross hairs for performance optimization.","PeriodicalId":127096,"journal":{"name":"Proceedings of the 15th ACM International Conference on Computing Frontiers","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133739406","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

D3NoC: a dynamic data-driven hybrid photonic plasmonic NoC D3NoC:动态数据驱动的混合光子等离子体NoC

Proceedings of the 15th ACM International Conference on Computing Frontiers Pub Date : 2018-05-08 DOI: 10.1145/3203217.3203272

A. Mehrabian, Shuai Sun, Vikram K. Narayana, Jeff Anderson, Jiaxin Peng, V. Sorger, T. El-Ghazawi

引用次数: 1