2010 IEEE 16th International Conference on Parallel and Distributed Systems最新文献

PicFS: The Privacy-Enhancing Image-Based Collaborative File System PicFS:增强隐私的基于图像的协作文件系统

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

Chris Sosa, Blake C. Sutton, H. H. Huang

{"title":"PicFS: The Privacy-Enhancing Image-Based Collaborative File System","authors":"Chris Sosa, Blake C. Sutton, H. H. Huang","doi":"10.1109/ICPADS.2010.13","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.13","url":null,"abstract":"Cloud computing makes available a vast amount of computation and storage resources in the pay-as-you-go manner. However, the users of cloud storage have to trust the providers to ensure the data privacy and confidentiality. In this paper, we present the Privacy-enhancing Image-based Collaborative File System (PicFS), a network file system that steganographically encodes itself into images and provides anonymous uploads and downloads from a media sharing website. PicFS provides plausible deniability by preventing traffic and image analysis by any third party from revealing the existence of PicFS or compromising its data. Because all accesses are anonymized, users of PicFS are dissociated from their data, which protects users against being compelled to release their keys. For further security and ease of use, we develop a method for automatically generating a large set of non-suspicious images to serve as input to the system. Our prototype leverages a number of existing technologies, including the F5 algorithm for steganography, Quick-Flickr for Flickr API access, Tor for anonymization, and FUSE-J for user-level file system calls. We show that the PicFS is indeed practical as the prototype demonstrates satisfactory performance in the real-world environment.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"26 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120992010","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

Building Similar Link Network in Large-Scale Web Resources 在大型Web资源中构建相似链接网络

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

Xiangfeng Luo, Jingjing Ni, Jun Zhang, Lizhe Wang

引用次数: 8

Enhancing MapReduce via Asynchronous Data Processing 通过异步数据处理增强MapReduce

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

M. Elteir, Heshan Lin, Wu-chun Feng

{"title":"Enhancing MapReduce via Asynchronous Data Processing","authors":"M. Elteir, Heshan Lin, Wu-chun Feng","doi":"10.1109/ICPADS.2010.116","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.116","url":null,"abstract":"The Map Reduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate intermediate key/value pairs, and a reduce function that merges and converts intermediate key/value pairs into final results. Typical Map Reduce implementations such as Hadoop enforce barrier synchronization between the map and reduce phases, i.e., the reduce phase does not start until all map tasks are finished. In turn, this synchronization requirement can cause inefficient utilization of computing resources and can adversely impact performance. Thus, we present and evaluate two different approaches to cope with the synchronization drawback of existing Map Reduce implementations. The first approach, hierarchical reduction, starts a reduce task as soon as a predefined number of map tasks completes, it then aggregates the results of different reduce tasks following a tree structure. The second approach, incremental reduction, starts a predefined number of reduce tasks from the beginning and has each reduce task incrementally reduce records collected from map tasks. Together with our performance modeling, we evaluate different reducing approaches with two real applications on a 32-node cluster. The experimental results have shown that incremental reduction outperforms hierarchical reduction in general. Also, incremental reduction can speed-up the original Hadoop implementation by up to 35.33% for the word count application and 57.98% for the grep application. In addition, incremental reduction outperforms the original Hadoop in an emulated cloud environment with heterogeneous compute nodes.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"268 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":"116246496","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}

引用次数: 50

Detection of a Weak Conjunction of Unstable Predicates in Dynamic Systems 动态系统中不稳定谓词弱合的检测

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

Xinli Wang, Jean Mayo, G. Hembroff

{"title":"Detection of a Weak Conjunction of Unstable Predicates in Dynamic Systems","authors":"Xinli Wang, Jean Mayo, G. Hembroff","doi":"10.1109/ICPADS.2010.80","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.80","url":null,"abstract":"A weak conjunctive predicate is a conjunction of local predicates that is evaluated under the Possibly modality. In this study, we have proposed a distributed on-line algorithm for detecting weak conjunctions of unstable predicates in dynamic systems. In the algorithm, a virtual network of a logical ring combined with computation trees is dynamically maintained using local variables to keep track of causality relationships between distributed events. The differential technique is exploited to minimize the size of detection related information. During the execution of the distributed computation, each process maintains a vector containing potential solutions. Detection will be announced when the global predicate is verified. This algorithm does not require extra messages except those for process termination. The detection of a solution may not be announced until the termination of the underlying distributed computation in the case where a process never communicates with others. At each process, storage need is proportional to the number of processes in the system. This demand will increase in some extreme cases, although they are very rare in practice.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"15 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":"114825041","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}

引用次数: 4

Towards a P2P Cloud: Reliable Resource Reservations in Unreliable P2P Systems 走向P2P云:不可靠P2P系统中的可靠资源预留

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

Kalman Graffi, D. Stingl, C. Gross, Hoang Nguyen, A. Kovacevic, R. Steinmetz

引用次数: 33

Performance Data Extrapolation in Parallel Codes 并行代码中的性能数据外推

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

Juan Gonzalez, Judit Giménez, Jesús Labarta

引用次数: 7

Cost-Effective Congestion Management for Interconnection Networks Using Distributed Deterministic Routing 采用分布式确定路由的互连网络的成本效益拥塞管理

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

J. Escudero-Sahuquillo, P. García, F. Quiles, J. Flich, J. Duato

{"title":"Cost-Effective Congestion Management for Interconnection Networks Using Distributed Deterministic Routing","authors":"J. Escudero-Sahuquillo, P. García, F. Quiles, J. Flich, J. Duato","doi":"10.1109/ICPADS.2010.14","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.14","url":null,"abstract":"The Interconnection networks are essential elements in current computing systems. For this reason, achieving the best network performance, even in congestion situations, has been a primary goal in recent years. In that sense, there exist several techniques focused on eliminating the main negative effect of congestion: the Head of Line (HOL) blocking. One of the most successful HOL blocking elimination techniques is RECN, which can be applied in source routing networks. FBICM follows the same approach as RECN, but it has been developed for distributed deterministic routing networks. Although FBICM effectively eliminates HOL blocking, it requires too much resources to be implemented. In this paper we present a new FBICM version, based on a new organization of switch memory resources, that significantly reduces the required silicon area, complexity and cost. Moreover, we present new results about FBICM, in network topologies not yet analyzed. From the experiment results we can conclude that a far less complex and feasible FBICM implementation can be achieved by using the proposed improvements, while not losing efficiency.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"30 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":"128165136","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

Cross-Layer Design to Merge Structured P2P Networks over MANET 在MANET上合并结构化P2P网络的跨层设计

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

Nadir Shah, D. Qian

{"title":"Cross-Layer Design to Merge Structured P2P Networks over MANET","authors":"Nadir Shah, D. Qian","doi":"10.1109/ICPADS.2010.93","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.93","url":null,"abstract":"Peer-to-peer (P2P) network is an alternative of client/server system for sharing resources, e.g. files. P2P network is a robust, distributed and fault tolerant architecture. There are basic two types of P2P networks, structured P2P network and unstructured P2P network. Each of them has its own applications and advantages. Due recent advances in wireless and mobile technology, the P2P network can be deployed over mobile ad hoc network (MANET). We consider the scenarios of P2P network over MANET where all nodes are not the members of P2P network. Due to limited radio range and the mobility of nodes in MANET, there can occur network partition and merging of networks in the physical network. This can also lead to P2P network partition and merging at overlay layer. When two physical networks merge by coming into communication range of each other then their P2P networks would not be connected at overlay layer. Because P2P network operates at application layer as an overlay network. That is their P2P networks are connected in physical network but these P2P networks are disconnected at overlay layer. To detect this situation and merge these P2P networks at overlay layer, we extend the ODACP, an address auto-configuration protocol. Then we propose an approach to efficiently merge P2P networks such that routing traffic is minimized. Considering limited radio range and mobility of nodes, the simulation results shows that CAN over MANET performs better as compared to Chord over MANET in term of routing traffic and false-negative ratio.","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":"131348191","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}

引用次数: 17

Utility Accrual Object Distribution in Real-Time Systems 实时系统中的效用应计对象分布

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

M. Mohaqeqi, M. Kargahi

引用次数: 2

Motion Tracking Based on Boolean Compressive Infrared Sampling 基于布尔压缩红外采样的运动跟踪

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

Jun Liu, Xuemei Guo, Min Liu, Guoli Wang

引用次数: 2