2013 IEEE Eighth International Conference on Networking, Architecture and Storage最新文献_第2页

Comparisons of Memory Virtualization Solutions for Architectures with Software-Managed TLBs 采用软件管理的tlb架构的内存虚拟化解决方案的比较

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.22

Yunfang Tai, Wanwei Cai, Qi Liu, Ge Zhang, Wenzhi Wang

{"title":"Comparisons of Memory Virtualization Solutions for Architectures with Software-Managed TLBs","authors":"Yunfang Tai, Wanwei Cai, Qi Liu, Ge Zhang, Wenzhi Wang","doi":"10.1109/NAS.2013.22","DOIUrl":"https://doi.org/10.1109/NAS.2013.22","url":null,"abstract":"Memory virtualization plays an important role in system virtualization. However, traditional memory virtualization solutions are usually for those architectures with hardware-managed TLBs, such as x86, ARM and so on. The solutions for architectures with software-managed TLBs are rarely mentioned. This paper presents three different memory virtualization solutions for architectures with software-managed TLBs. The difference is that different methods are used to tackle guest TLBs. One is emulating the guest TLBs by software, another is eliminating the guest TLBs and the third is emulating guest TLBs by hardware. After comparisons on hardware platform with MIPS CPUs, it can be seen that the method eliminating guest TLBs can increase the memory bandwidth by more than 100% on average compared to the method emulating guest TLBs by software. After comparisons on simulation platform with MIPS CPUs, it can be seen that the method emulating guest TLBs by hardware would cause about 135% more extra exceptions than the method eliminating guest TLBs. The method eliminating guest TLBs is a good choice when full virtualization is not necessary on the CPUs with software-managed TLBs.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570044","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

A Mechanism of Maintaining the Survivability of Streaming Media Service in Overlay Networks 覆盖网络中流媒体服务生存性的维持机制

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.16

Bo Bai, Ji-hong Zhao, Hua Qu

引用次数: 1

Improve Effective Capacity and Lifetime of Solid State Drives 提高固态硬盘的有效容量和使用寿命

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.13

Ping-Hsiu Huang, Guang Wan, Ke Zhou, Miaoqing Huang, Chun-hua Li, Hua Wang

{"title":"Improve Effective Capacity and Lifetime of Solid State Drives","authors":"Ping-Hsiu Huang, Guang Wan, Ke Zhou, Miaoqing Huang, Chun-hua Li, Hua Wang","doi":"10.1109/NAS.2013.13","DOIUrl":"https://doi.org/10.1109/NAS.2013.13","url":null,"abstract":"Flash-based SSDs are becoming increasingly popular in modern storage systems, especially in high-performance computing infrastructures. However, several inherent technical limitations still remain to prevent their widespread deployment. One of the critical concerns is their limited lifetime, which is directly relevant to the total writes experienced by SSDs. In this paper, we present a Content and semantics Aware File System (CSA-FS) which is able to reduce write traffic to SSDs. It employs deduplication and delta-encoding techniques to file system data blocks and semantic blocks, respectively. It is motivated by two important observations: (1) there exists a huge amount of content redundancy within primary storage systems, and (2) semantic blocks are visited much more frequently than data blocks, with each update bringing very minimal changes. By separately deduplicating redundant data blocks and delta-encoding similar semantic blocks, CSA-FS can significantly reduce the total write traffic to SSDs and greatly improve their lifetime correspondingly, at an acceptable cost of at most 7% performance degradation across a variety of workloads.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894831","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

A New Metadata Update Method for Fast Recovery of SSD Cache 一种新的SSD Cache快速恢复元数据更新方法

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.14

J. Yang, Q. Yang

引用次数: 0

DynaM: Dynamic Multiresolution Data Representation for Large-Scale Scientific Analysis 动态:大规模科学分析的动态多分辨率数据表示

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.21

Yuan Tian, S. Klasky, Weikuan Yu, Bin Wang, H. Abbasi, N. Podhorszki, R. Grout

{"title":"DynaM: Dynamic Multiresolution Data Representation for Large-Scale Scientific Analysis","authors":"Yuan Tian, S. Klasky, Weikuan Yu, Bin Wang, H. Abbasi, N. Podhorszki, R. Grout","doi":"10.1109/NAS.2013.21","DOIUrl":"https://doi.org/10.1109/NAS.2013.21","url":null,"abstract":"Fast growing large-scale systems enable scientific applications to run at a much larger scale and accordingly produce gigantic volumes of simulation output. Such data imposes a grand challenge to post-processing tasks such as visualization and data analysis, because these tasks are often performed at a host machine that is remotely located and equipped with much less memory and storage resources. During the simulation runs, it is also desirable for scientists to be able to interactively monitor and steer the progress of simulation. This requires scientific data to be represented in an efficient form for initial exploration and computation steering. In this paper, we propose DynaM a software framework that can represent scientific data in a multiresolution form, and dynamically organize data blocks into an optimized layout for efficient scientific analysis. DynaM supports a convolution-based multiresolution data representation for abstracting scientific data for visualization at a wide spectrum of resolution. To support the efficient generation and retrieval of different data granularities from such representation, a dynamic data organization in DynaM is enabled to cater distinct peculiarities of different size data blocks for efficient and balanced I/O performance. Our experimental results demonstrate that DynaM can efficiently represent large scientific dataset and speed up the visualization of multidimensional scientific data. An up to 29 times speedup is achieved on Jaguar supercomputer at Oak Ridge National Laboratory.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130156569","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

BFEPM: Best Fit Energy Prediction Modeling Based on CPU Utilization 基于CPU利用率的最佳拟合能量预测模型

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.12

Xiao Zhang, Jian-Jun Lu, X. Qin

引用次数: 18

PEAM: Predictive Energy-Aware Management for Storage Systems 存储系统的预测性能源感知管理

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.20

Xunfei Jiang, Ji Zhang, Mohammed I. Alghamdi, X. Qin, Minghua Jiang

引用次数: 4

Chariot: A High Compatible Architecture to Improve Virtual Machine Reliability 战车:一个提高虚拟机可靠性的高兼容架构

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.23

Haoquiang Zheng, Xiaoshe Dong, Endong Wang, Baoke Chen, Weifeng Gong, Xingjun Zhang

{"title":"Chariot: A High Compatible Architecture to Improve Virtual Machine Reliability","authors":"Haoquiang Zheng, Xiaoshe Dong, Endong Wang, Baoke Chen, Weifeng Gong, Xingjun Zhang","doi":"10.1109/NAS.2013.23","DOIUrl":"https://doi.org/10.1109/NAS.2013.23","url":null,"abstract":"Currently, the virtualization technologies can integrate multiple operating systems into a high-performance server to maximize the utilization of the server's resources. This server can serves more users. However, the driver faults in virtual machine still seriously affect the reliability of the virtual machine, and even affect the reliability of the entire server. This paper presents Chariot, a high compatible architecture to improve virtual machine reliability. If the driver is loaded by the Chariot's isolation loading mechanism, its memory usage will be timely monitored by Chariot, and its access control table will be established. Through setting the corresponding shadow page table of the whole kernel space of the virtual machine, Chariot captures the write operations of the isolated driver. Combing the access control table, Chariot can determine the correctness of these writing operations. Chariot has an effective errors isolation capability, and is easy to develop. Also Chariot has an excellent compatibility and needs not to modify the drivers and the operation system in the virtual machine. Experimental results show that Chariot can effectively isolate the driver faults, and improve the reliability of operation system in the virtual machine environments.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121245315","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

High-Speed Multicast Scheduling for All-Optical Packet Switches 全光分组交换机高速组播调度

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.26

Zhiyang Guo, Yuanyuan Yang

{"title":"High-Speed Multicast Scheduling for All-Optical Packet Switches","authors":"Zhiyang Guo, Yuanyuan Yang","doi":"10.1109/NAS.2013.26","DOIUrl":"https://doi.org/10.1109/NAS.2013.26","url":null,"abstract":"In this paper, we study multicast scheduling in all-optical packet switches. We first propose a novel optical buffer called multicast-enabled Fiber-Delay-Lines (M-FDLs), which can provide flexible delay for copies of multicast packets using only a small number of FDL segments. We then present a Delay-Guaranteed Multicast Scheduling (DGMS) algorithm that considers the schedule of each arriving packet for multiple time slots. We show that DGMS has several desirable features, such as guaranteed delay upper bound and adaptivity to transmission requirements. To relax the time constraint of DGMS, we further propose a parallel and pipeline architecture for DGMS that distributes the scheduling task to multiple pipelined processing stages, with N processors in each stage, where N is the switch size. Finally, by using a simple combination logic circuit, we show that each processor can finish the scheduling for one time slot in O(1) time. The performance of DGMS is tested extensively against statistical traffic models and real Internet traffic, and the results show that the proposed DGMS algorithm can achieve ultra-low average packet delay with minimum packet drop ratio.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132750251","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

Parallel Algorithm for Approximate String Matching with K Differences K差近似字符串匹配的并行算法

2013 IEEE Eighth International Conference on Networking, Architecture and Storage Pub Date : 2013-07-17 DOI: 10.1109/NAS.2013.40

Longjiang Guo, Shufang Du, Meirui Ren, Yu Liu, Jinbao Li, J. He, Ning Tian, Keqin Li

引用次数: 8