2011 IEEE Sixth International Conference on Networking, Architecture, and Storage最新文献

Coherent Temporal Streams in PARSEC PARSEC中的相干时间流

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.11

M. A. Mughal, Haixia Wang, Dongsheng Wang

{"title":"Coherent Temporal Streams in PARSEC","authors":"M. A. Mughal, Haixia Wang, Dongsheng Wang","doi":"10.1109/NAS.2011.11","DOIUrl":"https://doi.org/10.1109/NAS.2011.11","url":null,"abstract":"Off-Chip miss latency remains a bottleneck even in the modern chip multiprocessors. Recent research advocates memory streaming techniques to alleviate the performance bottleneck caused by the high latencies of off-chip memory accesses. Memory streaming prefetches data by predicting recurring sequences of misses. Coherent read misses are one of the contributors in off-chip read misses for multithread workloads running on multi-chip multiprocessors. In this paper, we investigate off-chip coherent read misses using information-theoretic analysis of coherent read misses collected using execution-driven simulation of Princeton Application Repository for Shared-Memory Computers PARSEC). We found that coherent read misses recur system-wide in the same order forming sequences of two or more misses called streams. We show that 54% to 95% misses are part of streams. Our investigations have proved to be useful that streaming using multiple recurrences of the same stream cannot predict certain fraction of stream misses i.e. at least 10% to 60%. We demonstrate that 80% to 90% streams have length less than or equal to 8, 45% to 60% streams recur two times and then never repeat, finally streams recur after hundreds or thousands of misses.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"7 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122364325","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

Hybrid Co-scheduling Optimizations for Concurrent Applications in Virtualized Environments 虚拟化环境下并发应用的混合协同调度优化

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.30

Yulong Yu, Yuxin Wang, He Guo, Xubin He

{"title":"Hybrid Co-scheduling Optimizations for Concurrent Applications in Virtualized Environments","authors":"Yulong Yu, Yuxin Wang, He Guo, Xubin He","doi":"10.1109/NAS.2011.30","DOIUrl":"https://doi.org/10.1109/NAS.2011.30","url":null,"abstract":"Concurrent applications in virtualized environments (VE) encounter synchronization problems such as Lock Holder Preemption (LHP). Hybrid co-scheduling is an effective approach to address such problems. However, the contention and exclusiveness between multiple concurrent domains in hybrid co-scheduling cause a serious performance degradation and unfairness. To keep the benefits brought by hybrid co-scheduling for multiple concurrent domains in VE, we propose two optimization schemes named Partial Co-Scheduling (PCS) and Boost Co-Scheduling (BCS) using finer space granularity. Instead of raising co-scheduling signals for all online CPUs, PCS scheme raises the co-scheduling signals only for the indispensable CPUs, while the rest CPUs are untouched. BCS scheme boosts the priorities for co-scheduled virtual CPUs (VCPUs) to induce the scheduler to pick the appropriate VCPUs. We implement both PCS and BCS into Credit Scheduler in Xen 4.0.1 and evaluate their performance compared with original hybrid co-scheduling and co-descheduling under different scenarios. The experimental results show that our proposals effectively alleviate the CPU run-time contention and achieve better performance and fairness compared to traditional hybrid co-scheduling.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122749690","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}

引用次数: 11

A Novel Highly Scalable Architecture with Partially Distributed Pipeline and Hardware/Software Instruction Encoding 一种具有部分分布式管道和硬件/软件指令编码的新型高可扩展性体系结构

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.41

Hu Chen, Sheng Liu, Shuming Chen

{"title":"A Novel Highly Scalable Architecture with Partially Distributed Pipeline and Hardware/Software Instruction Encoding","authors":"Hu Chen, Sheng Liu, Shuming Chen","doi":"10.1109/NAS.2011.41","DOIUrl":"https://doi.org/10.1109/NAS.2011.41","url":null,"abstract":"The partitioning resources like pipelines and register files among clusters is proved to be an effective way to improve performance and scalability. However, improvement in scalability is limited by traditional instruction encoding schemes that quickly run out of bits in fixed-length instruction words to encode multiple register operands. Meanwhile, clustered processors may come at a cost of performance degradation, the major cause of which is the limited data locality arising from the lack of available registers and functional units. This paper introduces a highly scalable clustered architecture (HiSCA) to improve the scalability and performance of clustered processors. The pipeline of HiSCA provides high performance through in-order issuing, out-of-order execution and parallel but in-order commitment, while releasing instruction issuing from the heavy burden of dynamic scheduling. The hardware/software instruction encoding scheme of HiSCA splits instruction stream into chains of instructions (packs), and provides common information of instructions in the same packs in dedicated instruction words, thus reducing the total amount of information encoded in the instructions within the packs. HiSCA scales efficiently to 32 clusters with 1024 general purpose registers. Experiment results show that, for a 4-cluster and 8-issue configuration, HiSCA can achieve a 4.6% improvement in frequency with minimal hardware overhead, and an average of 13.3% performance speedup at the cost of 1.9% overhead to code size, compared with a traditional clustered processor with nearly the same hardware complexity.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114315568","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

Evaluating Energy and Performance for Server-Class Hardware Configurations

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.23

Cheng-Lun Liu, Jianzhong Huang, Q. Cao, Shenggang Wan, C. Xie

{"title":"Evaluating Energy and Performance for Server-Class Hardware Configurations","authors":"Cheng-Lun Liu, Jianzhong Huang, Q. Cao, Shenggang Wan, C. Xie","doi":"10.1109/NAS.2011.23","DOIUrl":"https://doi.org/10.1109/NAS.2011.23","url":null,"abstract":"The improvement for energy efficiency has been increasingly becoming a major consideration in server and data center design, especially for the power-hungry ones. Numerous studies have provided various new methods or proposals for the building of \"green\" server and data center, but this paper concentrates on how different configuration schemes in a server effect practical performance and power consumption for specific applications. It is completely necessary to obtain thin provisioning for the particular applications to meet performance requirements with minimal energy consumption. This paper evaluates the different hardware configurations' impact on energy consumption and performance for typical applications, hoping for offering evidences or clues to subsequent researches. The File Bench is used to generate four sever workloads and ZH-101 is employed to collect relevant real-time power consumptions. Our result shows that different workloads need different hardware configurations at the demands of both energy-efficiency and performance. And running multiple workloads on a reduced hardware configuration is a wise choice.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124084341","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

Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays 检测重复在滑动窗口与ram高效分离计数布隆过滤器阵列

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.37

Jiansheng Wei, Hong Jiang, Ke Zhou, D. Feng, Hua Wang

{"title":"Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays","authors":"Jiansheng Wei, Hong Jiang, Ke Zhou, D. Feng, Hua Wang","doi":"10.1109/NAS.2011.37","DOIUrl":"https://doi.org/10.1109/NAS.2011.37","url":null,"abstract":"Detecting duplicates over sliding windows is an important technique for monitoring and analysing data streams. Since recording the exact information of elements in a sliding window can be RAM-resource-intensive and introduce an unacceptable search complexity, several approximate membership representation schemes have been proposed to build in-memory fast indices. However, various challenges facing RAM utilization and scalability remain. This paper proposes a Detached Counting Bloom filter Array (DCBA) to flexibly and efficiently detect duplicates over sliding windows. A DCBA consists of an array of detached counting Bloom filters (DCBFs), where each DCBF is essentially a Bloom filter that is associated with a detached timer (counter) array. The DCBA scheme functions as a circular FIFO queue and keeps a filling DCBF for accommodating fresh elements and a decaying DCBF for evicting stale elements. DCBA allows the timer arrays belonging to fully filled DCBFs to be offloaded to disks to greatly improve the memory space efficiency. The fully filled DCBFs will remain stable until their elements become stale, which allows a DCBA to be efficiently replicated for the purpose of data reliability or information sharing. Further, DCBA can be cooperatively maintained by clustered nodes, which provides scalable solution for mining massive data streams. Mathematical analysis and experimental results show that a DCBA (containing 64 DCBFs) requires less than 10% of its components to be kept in RAM while maintaining more than 95% of its query performance, which significantly outperforms existing schemes in memory efficiency and scalability.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980957","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

Feedback Based Sparse Recovery for Motion Tracking in RF Sensor Networks 基于反馈稀疏恢复的射频传感器网络运动跟踪

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.9

Heping Song, Tong Liu, Xiaomu Luo, Guoli Wang

引用次数: 12

EMFS: Email-based Personal Cloud Storage EMFS:基于电子邮件的个人云存储

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.55

J. Srinivasan, Wei Wei, Xiaosong Ma, Ting Yu

{"title":"EMFS: Email-based Personal Cloud Storage","authors":"J. Srinivasan, Wei Wei, Xiaosong Ma, Ting Yu","doi":"10.1109/NAS.2011.55","DOIUrl":"https://doi.org/10.1109/NAS.2011.55","url":null,"abstract":"Though a variety of cloud storage services have been offered recently, they have not yet provided users with transparent and cost-effective personal data storage. Services like Google Docs offer easy file access and sharing, but tie storage with internal data formats and specific applications. Meanwhile, services like Drop box offer general-purpose storage. Yet they have not been widely utilized, partly due to their fee-charging nature and long-term service availability concerns. Web-based email services, on the other hand, have been offering growing email storage capacity, reliable service, and powerful search capability, making them appealing as storage resources. In this paper, we examine the efficacy of leveraging web-based email services to build a personal storage cloud. We present EMFS, which aggregates back-end storage by establishing a RAID-like system on top of virtual email disks formed by email accounts. In particular, by replicating data across accounts from different service providers, highly available storage services can be constructed based on already reliable, cloud-based email storage. This paper discusses the design and implementation of EMFS, focusing on unique challenges and opportunities associated with utilizing email services for file transfer and storage, such as email based data organization, metadata format and management, and handling provider-imposed anti-spam usage restrictions. We evaluated EMFS extensively with multiple benchmarks, and compared its performance with NFS, AFS, and a non-free cloud storage service built upon Amazon S3. Our results indicate that while EMFS cannot match the performance of highly optimized distributed file systems with dedicated servers, it performs quite closely to the commercial cloud storage solution.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133131207","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}

引用次数: 19

Processes Scheduling on Heterogeneous Multi-core Architecture with Hardware Support 基于硬件支持的异构多核架构进程调度

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.26

Shouqing Hao, Qi Liu, Longbing Zhang, Jian Wang

{"title":"Processes Scheduling on Heterogeneous Multi-core Architecture with Hardware Support","authors":"Shouqing Hao, Qi Liu, Longbing Zhang, Jian Wang","doi":"10.1109/NAS.2011.26","DOIUrl":"https://doi.org/10.1109/NAS.2011.26","url":null,"abstract":"Heterogeneous Chip Multi-Processors (heter-CMP) provide suitable resources to various applications and could get more benefits on performance than homogeneous CMP. To fully develop the performance of the heter-CMP system, the applications should be scheduled to the proper cores by the scheduler of the operating system according to their behaviours. Besides, the last level cache (LLC) miss rate is often used as the metric to identify the application features. However, the LLC miss rate could not reflect the application behaviours accurately since the memory access delay, the most important application character is related to patterns of the memory access and many other issues. To improve the accuracy of scheduling on the heter-CMP system, this paper supplies performance counters for the LLC miss penalty to monitor application behaviours. Based on that, the latency-aware scheduling algorithm for asymmetry chip multi-processors (LA-ACMP) is proposed and implemented. Those hardware supports are implemented on the Godson-3 multi-core RTL and simulator and the LA-ACMP algorithm is integrated to the Linux kernel. The performance evaluation on those platforms shows that the LA-ACMP algorithm with LLC miss penalty outperforms the algorithm with LLC miss rate about 32.4%, and outperforms the original schedule algorithm about 18.4%.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123633397","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}

引用次数: 11

JVM Virtual Method Invoking Optimization Based on CAM Table 基于CAM表的JVM虚拟方法调用优化

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.13

Songsong Cai, Yongqiang Yang, Chuanwen Lin, Qi Liu

引用次数: 0

Scalable Index Update for Block-Level Continuous Data Protection 块级连续数据保护的可扩展索引更新

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.54

Maohua Lu, D. Simha, T. Chiueh

{"title":"Scalable Index Update for Block-Level Continuous Data Protection","authors":"Maohua Lu, D. Simha, T. Chiueh","doi":"10.1109/NAS.2011.54","DOIUrl":"https://doi.org/10.1109/NAS.2011.54","url":null,"abstract":"A block-level continuous data protection (CDP) system logs every disk update to a network storage server it protects, so as to support more flexible recovery time objective (RTO) and recovery point objective (RPO). To provide efficient access to historical snapshots, block-level CDP systems maintain multiple index structures, each of which needs to be updated whenever a disk block update operation is logged. Because these index structures are too large to be held in memory, updating their on-disk versions in real time becomes a major performance bottleneck that prevents existing CDP systems from scaling to large data backup applications. This paper describes the design and implementation of a high-performance index update mechanism that logs index updates, batches them in memory, and commits them using mostly sequential disk I/O. Sequential commit greatly reduces the cost of bringing in and writing back each on-disk index page. Update batching further amortizes this cost over multiple index update operations. Empirical performance measurements demonstrate that the proposed technique improves the index update throughput by more than an order of magnitude and reduces the performance overhead associated with index updates from 95% to under 15%.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"51 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114011022","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