2010 IEEE 16th International Conference on Parallel and Distributed Systems最新文献_第10页

Unifying Buffer Replacement and Prefetching with Data Migration for Heterogeneous Storage Devices 异构存储设备缓冲区替换和预取与数据迁移的统一

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.103

Sehwan Lee, K. Koh, H. Bahn

{"title":"Unifying Buffer Replacement and Prefetching with Data Migration for Heterogeneous Storage Devices","authors":"Sehwan Lee, K. Koh, H. Bahn","doi":"10.1109/ICPADS.2010.103","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.103","url":null,"abstract":"With the good properties of NAND flash memory such as small size, shock resistance, and low-power consumption, large capacity SSD (Solid State Disk) is anticipated to replace hard disk in high-end systems. However, the cost of NAND flash memory is still high to substitute for hard disk entirely. Using hard disk and NAND flash memory together as secondary storage is an alternative solution to provide relatively low response time, large capacity, and reasonable cost. In this paper, we present a new buffer cache management scheme with data migration that is optimized to use both NAND flash memory and hard disk together as secondary storage. The proposed scheme has three salient features. First, it detects I/O access patterns from each storage, and allocates the buffer cache space for each pattern by computing marginal gain adaptively considering the I/O cost of storage. Second, it prefetches data selectively according to their access pattern and storage devices. Third, it moves the evicted data from the buffer cache to hard disk or NAND flash memory considering the access patterns of block references on the reclamation. Trace-driven simulations show that the proposed scheme improves the I/O performance significantly. It enhances the buffer cache hit ratio by up to 29.9% and reduces the total I/O elapsed time by up to 49.5% compared to the well-acknowledged UBM scheme.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131445985","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

PGOS: An Architecture of a Personal Net Computing Platform PGOS:一种个人网络计算平台体系结构

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.50

Jie Liu, Yongqiang Zou

引用次数: 1

Utilizing RF Interference to Enable Private Estimation in RFID Systems 利用射频干扰实现RFID系统的私有估计

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.106

Lei Yang, Jinsong Han, Yong Qi, Cheng Wang, Zhuo Li, Qingsong Yao, Ying Chen, Xiao Zhong

{"title":"Utilizing RF Interference to Enable Private Estimation in RFID Systems","authors":"Lei Yang, Jinsong Han, Yong Qi, Cheng Wang, Zhuo Li, Qingsong Yao, Ying Chen, Xiao Zhong","doi":"10.1109/ICPADS.2010.106","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.106","url":null,"abstract":"Counting or estimating the number of tags is crucial for RFID system. Researchers have proposed several fast cardinality estimation schemes to estimate the quantity of a batch of tags within a short time frame. Existing estimation schemes scarcely consider the privacy issue. Without effective protection, the adversary can utilize the responding signals to estimate the number of tags as accurate as the valid reader. To address this issue, we propose a novel privacy-preserving estimation scheme, termed as MEAS, which provides an active RF countermeasure against the estimation from invalid readers. MEAS comprises of two components, an Estimation Interference Device (EID) and two well-designed Interference Blanking Estimators (IBE). EID is deployed with the tags to actively generate interfering signals, which introduce sufficiently large estimation errors to invalid or malicious readers. Using a secret interference factor shared with EID, a valid reader can perform accurate estimation via two IBEs. Our theoretical analysis and simulation results show the effectiveness of MEAS. Meanwhile, MEAS can also maintain a high estimation accuracy using IBEs.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367967","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

A Primal Dual Approach for Dynamic Bid Optimization 动态竞价优化的原始对偶方法

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.75

Lingfei Yu, Kun She, Changyuan Yu

引用次数: 0

General vs. Interval Mappings for Streaming Applications 流应用程序的通用映射与间隔映射

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.15

A. Benoit, Hinde-Lilia Bouziane, Y. Robert

{"title":"General vs. Interval Mappings for Streaming Applications","authors":"A. Benoit, Hinde-Lilia Bouziane, Y. Robert","doi":"10.1109/ICPADS.2010.15","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.15","url":null,"abstract":"This paper deals with the problem of mapping pipelined applications on heterogeneous platforms whose processors are subject to failures. We address a difficult bi-criteria problem, namely deciding which stages to replicate, and on which resources, in order to optimize the reliability of the schedule, while guaranteeing a minimal throughput. Previous work had addressed the complexity of interval mappings, where the application is partitioned into intervals of consecutive stages (which are then replicated and assigned to processors). In this paper we investigate general mappings, where stages may be partitioned without any constraint, thereby allowing a better usage of processors and communication network capabilities. The price to pay for general mappings is a dramatic increase in the problem complexity. We show that computing the period of a given general mapping is an NP-complete problem, and we provide polynomial bounds to determine a (conservative) approximated value. The bi-criteria mapping problem itself becomes NP-complete on homogeneous platforms, while it is polynomial with interval mappings. We design a set of efficient heuristics, which we compare with interval mapping strategies through extensive simulations.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129735917","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

Space Speedup and Its Relationship with Time Speedup 空间加速及其与时间加速的关系

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.68

Yue Hu, W. Tong, Xiaoli Zhi, Zhi-xun Gong

引用次数: 1

Vapor: Virtual Machine Based Parallel Program Profiling Framework 蒸汽:基于虚拟机的并行程序分析框架

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.59

Yusong Tan, Wei Chen, Q. Wu

引用次数: 1

Making Human Connectome Faster: GPU Acceleration of Brain Network Analysis 使人类连接组更快:GPU加速脑网络分析

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.105

Di Wu, Tianji Wu, Yi Shan, Yu Wang, Yong He, Ningyi Xu, Huazhong Yang

引用次数: 9

Smart: Service Model for Integrating Wireless Sensor Networks and the Internet 智能:无线传感器网络与互联网融合的服务模式

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.92

Jeisa P. O. Domingues, A. Dâmaso, N. Rosa

引用次数: 8

2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer 一种用于页面级Flash翻译层映射表的特殊缓存

2010 IEEE 16th International Conference on Parallel and Distributed Systems Pub Date : 2010-12-08 DOI: 10.1109/ICPADS.2010.60

Zhiguang Chen, Nong Xiao, Fang Liu, Yimo Du

{"title":"2F: A Special Cache for Mapping Table of Page-Level Flash Translation Layer","authors":"Zhiguang Chen, Nong Xiao, Fang Liu, Yimo Du","doi":"10.1109/ICPADS.2010.60","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.60","url":null,"abstract":"The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate the memory pressure introduced by the big mapping table. We argue that classic cache replacement policies aren’t competent for the page table cache of FTLs. The major contribution of this work is to design a dedicated cache replacement policy called Two Filters (abbreviated as 2F) for page-level mapping FTLs. 2F aims at two goals. The first is higher hit ratio as all the replacement policies pursue. As 2F not only protects frequently accessed pages, but also protects sequentially accessed pages at little cost, it does achieve a higher hit ratio. The second goal is to distinguish hot pages from the cold. This goal is special for page table of FTLs. If hot and cold pages are directed to separate blocks, garbage collection will be more efficient. In order to achieve this goal, 2F employs two filters. One is used for containing sequentially accessed pages. Another is used for selecting hot pages. Trace driven simulations present that 2F outperforms classic replacement policies in both hit ratio and data classification.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395978","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