2017 International Conference on Networking, Architecture, and Storage (NAS)最新文献_第2页

Data Block Partitioning for Recovering Stuck-at Faults in PCMs 基于数据块分区的pcm卡滞故障恢复

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026850

Marjan Asadinia, Majid Jalili, H. Sarbazi-Azad

{"title":"Data Block Partitioning for Recovering Stuck-at Faults in PCMs","authors":"Marjan Asadinia, Majid Jalili, H. Sarbazi-Azad","doi":"10.1109/NAS.2017.8026850","DOIUrl":"https://doi.org/10.1109/NAS.2017.8026850","url":null,"abstract":"Main burdens to the DRAM scalability are leakage and charge storage restrictions. Phase Change Memory (PCM) is being known as a promising candidate for the replacement of DRAM among competitive non-volatile memories. However, this memory suffers from low cell reliability due to limited write endurance. This problem can lead to some memory cells permanently stuck at either '0' or '1'. Therefore, a robust error recovery scheme is needed to overcome this problem and recover from hard errors. State-of-the-art solutions apply error correction and recovery techniques at inter- line or intra-line level. Precisely, they can improve PCM endurance either by remapping failed lines to spares (in inter-line level schemes) or by using data-block partitioning and bit- inversion scheme (in intra-line level schemes). Although techniques of the latter type are effective, proper partitioning of data blocks and spreading out faults across different groups are required. In this paper, we propose and evaluate a novel intra-line level scheme that statically partition a data-block into some groups and efficiently recover multi-bit stuck-at faults per partition. This method benefits from the advantage of a simple shifting mechanism in order to increase the chance of storing data in presence of failed cells. Evaluation results for multi- threaded workloads show enhancement in the number of recoverable failures and improvement of lifetime over existing techniques.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124075484","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

Automatic Collector for Dynamic Cloud Performance Information 动态云性能信息自动采集器

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026845

Olaf Elzinga, Spiros Koulouzis, Arie Taal, Junchao Wang, Yang Hu, Huan Zhou, Paul Martin, C. D. Laat, Zhiming Zhao

{"title":"Automatic Collector for Dynamic Cloud Performance Information","authors":"Olaf Elzinga, Spiros Koulouzis, Arie Taal, Junchao Wang, Yang Hu, Huan Zhou, Paul Martin, C. D. Laat, Zhiming Zhao","doi":"10.1109/NAS.2017.8026845","DOIUrl":"https://doi.org/10.1109/NAS.2017.8026845","url":null,"abstract":"When deploying an application in the cloud, a developer often wants to know which of the wide variety of cloud resources is best to use. Most cloud providers only provide static information about different cloud resources which is often not enough because static information does not take into account the hardware and software that is being used or the policy that has been applied by the cloud provider. Therefore, dynamic benchmarking of cloud resources is needed to find out how a certain workload is going to behave on a certain instance. However, benchmarking various cloud resources is a time consuming process. Thus, using a tool which automatically benchmarks various cloud resources will be of great use. % To maximize the effectiveness of such a tool, it will be helpful to maintain an up to date cloud information catalogue, so that users can share and compare their benchmark results to the results of other users. In this paper, we present the Cloud Performance Collector, a modular cloud benchmarking tool aimed to automatically benchmark a wide variety of applications. To demonstrate the benefit of the tool, we did three experiments with three synthetic benchmark applications and one real-world application using the ExoGENI testbed.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115927159","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

SimpleBP: A Lightweight Branch Prediction Simulator for Effective Design Exploration SimpleBP:用于有效设计探索的轻量级分支预测模拟器

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026877

Chaobing Zhou, Libo Huang, Zhisheng Li, Q. Dou

引用次数: 0

FlashStorageSim: Performance Modeling for SSD Architectures FlashStorageSim: SSD架构的性能建模

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026860

Krishna T. Malladi, Mu-Tien Chang, Dimin Niu, Hongzhong Zheng

引用次数: 5

hpFog: A FPGA-Based Fog Computing Platform hpFog:基于fpga的雾计算平台

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026862

Tze Hon Tan, C. Y. Ooi, M. N. Marsono

引用次数: 9

DD-L1D: Improving the Decoupled L1D Efficiency for GPU Architecture DD-L1D:提高GPU架构的解耦L1D效率

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026851

Weiguang Yang, Yuxin Wang, Yulong Yu, Guang-yuan Kan, He Guo

{"title":"DD-L1D: Improving the Decoupled L1D Efficiency for GPU Architecture","authors":"Weiguang Yang, Yuxin Wang, Yulong Yu, Guang-yuan Kan, He Guo","doi":"10.1109/NAS.2017.8026851","DOIUrl":"https://doi.org/10.1109/NAS.2017.8026851","url":null,"abstract":"GPU L1 data cache contention, caused by a huge amount of concurrent threads, leads to insufficient cache utilization and poor performance, especially for cache unfriendly applications. Cache bypassing is a widely- used method to alleviate this problem, and Decoupled L1D (D-L1D) is a preventive bypassing scheme, which achieves performance improvement for cache unfriendly applications by considering the data locality of memory access streams. However, our experiments and analyses show that limited performance gain by D-L1D is attained due to the pre-defined locality threshold. To address this issue, we propose a novel bypassing scheme named as Dynamic D-L1D (DD-L1D) that directs the L1 data cache to the less contention by dynamically updating the locality threshold during runtime. We evaluate four metrics in DD-L1D to indicate the L1 cache bypassing state, and choose bypassing miss rate in our final configuration. The experimental results demonstrate that DD-L1D improves the baseline performance by 1.45X on average for cache unfriendly benchmarks. It also outperforms D-L1D and the state-of-the-art GPU cache bypassing schemes with lower hardware overhead and memory traffic.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123358243","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

ALARM: A Location-Aware Redistribution Method to Improve 3D FG NAND Flash Reliability 报警:一种提高3D FG NAND闪存可靠性的位置感知重新分配方法

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026841

Yue Zhu, Fei Wu, Qin Xiong, Zhonghai Lu, C. Xie

{"title":"ALARM: A Location-Aware Redistribution Method to Improve 3D FG NAND Flash Reliability","authors":"Yue Zhu, Fei Wu, Qin Xiong, Zhonghai Lu, C. Xie","doi":"10.1109/NAS.2017.8026841","DOIUrl":"https://doi.org/10.1109/NAS.2017.8026841","url":null,"abstract":"3D NAND flash memory is enjoying an increasing popularity as it dramatically increases the bit density, presenting a grand opportunity to satisfy the growing demand on the storage capacity. However, this vertically stacked structure also introduces more serious read disturb problems compared with planar flash devices. Characterization results show that the read disturb errors on 3D floating gate (FG) MLC NAND flash chips exhibit a large discrepancy on the locations and types of pages, implying that pages should not be treated equally when designing migration schemes. This paper makes a thorough observation on read access characteristics by analyzing contemporary workloads collected from a wide range of applications with various read ratios. Based on the characterization results, we build a read disturb error model and propose a location-aware redistribution method (ALARM) that utilizes the intrinsic characteristics of the 3D floating gate NAND flash and redistributes read-hot pages to locations inducing less read disturb errors to improve its reliability. We implement the read disturb error model and our proposed design on an event-driven simulator, and the experimental results show that ALARM can reduce the maximum and average raw bit error rates (RBERs) by up to 99.49% and 91.80% with an operation overhead of 0.70%.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511048","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

Revisiting Updating Schemes for Erasure-Coded In-Memory Stores 重新审视擦除编码内存存储的更新方案

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026875

Jie Xia, Jianzhong Huang, X. Qin, Q. Cao, C. Xie

{"title":"Revisiting Updating Schemes for Erasure-Coded In-Memory Stores","authors":"Jie Xia, Jianzhong Huang, X. Qin, Q. Cao, C. Xie","doi":"10.1109/NAS.2017.8026875","DOIUrl":"https://doi.org/10.1109/NAS.2017.8026875","url":null,"abstract":"Erasure coding has been gradually adopted by existing data-intensive in-memory stores for 'hot' data; small writes lead to expensive updating overheads in such in-memory stores characterized by update-heavy workloads. There is a pressing demand to address the issue of data updates for erasure-coded in-memory stores. We revisit existing updating schemes in erasure-coded storage clusters by investigating the applicability of these updating schemes to erasure-coded in- memory stores. After an intensive analysis, we propose a grouping-update mechanism - GU - to handle small writes in in-memory stores. With GU in place, requests in an updating window are categorized into several updating groups, where multiple small updates in the same stripe can be executed concurrently. Furthermore, we bring forward a hybrid-updating scheme - Hybrid-U - to minimize total updating I/Os over network under common writes (e.g., small and large writes). We evaluate four dedicated updating schemes, four GU- based updating schemes and Hybrid-U. Our experiments illustrate that GU-based updating schemes and Hybrid-U outperform the four dedicated updating schemes in terms of updating time.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115490695","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

Privacy-Protected Data Collection in Wireless Medical Sensor Networks 无线医疗传感器网络中隐私保护的数据收集

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026872

Md. Zakirul Alam Bhuiyan, Mdaliuz Zaman, Guojun Wang, Tian Wang, Jie Wu

引用次数: 6

Contact Duration-Aware Routing in Delay Tolerant Networks 容忍延迟网络中的接触感知时间路由

2017 International Conference on Networking, Architecture, and Storage (NAS) Pub Date : 2017-08-01 DOI: 10.1109/NAS.2017.8026849

Tuan Le, M. Gerla

引用次数: 13