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

Cloud Assisted P2P Media Streaming for Bandwidth Constrained Mobile Subscribers 面向带宽受限移动用户的云辅助P2P媒体流

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

Xin Jin, Yu-Kwong Kwok

引用次数: 95

Impacts of Asynchrony on Epidemic-Style Aggregation Protocols 异步对流行型聚合协议的影响

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

I. Rao, A. Harwood, S. Karunasekera

{"title":"Impacts of Asynchrony on Epidemic-Style Aggregation Protocols","authors":"I. Rao, A. Harwood, S. Karunasekera","doi":"10.1109/ICPADS.2010.130","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.130","url":null,"abstract":"The large scale and dynamic nature of a distributed system makes it difficult to collect the attributes of the individual nodes in the network. In these systems, often an aggregate (e.g. AVG, COUNT, MIN, MAX, SUM etc) of these attributes is adequate. Epidemic-style protocols are one of the popular approaches to estimate aggregates in such systems. In existing epidemic-style aggregation protocols the accuracy of the estimated aggregate at local nodes heavily depends upon synchronization of aggregation rounds. To enforce synchronization in these protocols, length of aggregation round should be long enough so that all the nodes in the system complete their aggregation information exchange. In this paper, we study the impacts of asynchrony in epidemic-style aggregation protocols. We present a simple asynchronous technique to estimate system aggregates in a distributed system. Based upon this technique, we analyze two popular existing epidemic-style aggregation protocols, Push-Pull and Push-Sum. Through detailed simulations, we evaluate accuracy and cost of asynchronous version of these protocols. We found that to obtain an estimate of the true system aggregate, aggregation protocols do not need to be synchronized and hence an efficient estimate can be obtained in lesser time.","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":"131091271","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 Structured Peer-to-Peer Architecture Based on Physical Distance 基于物理距离的新型结构化点对点体系结构

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

Song Wang, Yong Ma, G. Wang, X. Liu

{"title":"A New Structured Peer-to-Peer Architecture Based on Physical Distance","authors":"Song Wang, Yong Ma, G. Wang, X. Liu","doi":"10.1109/ICPADS.2010.17","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.17","url":null,"abstract":"Recently, structured P2P (Peer-to-Peer) system has become more and more popular. However, P2P systems' large scale and high dynamics have brought a great challenge to data availability and accessing performance. Redundancy techniques are used to solve these problems. However, in structured P2P systems, due to the consistent hash, the overlay network could not match underlying physical network well. The nodes close to each other in the overlay network may have long distances of physical network. In this paper, we put forward a new P2P architecture that constructs node identifiers and places redundant data according to physical location information. It can provide better load balance and access performance. The node's identifier is divided into four parts, representing the node's state, ISP, city and IP respectively, so the nodes having similar identifiers are close to each other in the physical network. Moreover, a query tree is used to help a node routing queries quickly in the physical network. In addition, we maintain an access list for each file. When a node becomes overloaded, replicas are placed on another node selected in the routing path according to the access list, so subsequent access requests could be met in advance.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"73 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":"127399732","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

Semantics-Aware, Timely Prefetching of Linked Data Structure 关联数据结构的语义感知、及时预取

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

Gang Liu, Zhuo Huang, J. Peir, Xudong Shi

{"title":"Semantics-Aware, Timely Prefetching of Linked Data Structure","authors":"Gang Liu, Zhuo Huang, J. Peir, Xudong Shi","doi":"10.1109/ICPADS.2010.70","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.70","url":null,"abstract":"Traversal through a Linked Data Structure (LDS) in applications encounters heavy cache misses and severe performance degradation. Due to tight load-load dependences in LDS traversal, the chance of overlapping the cache misses in exploiting the memory-level parallelism is slim. Furthermore, the irregularity of the missing block addresses makes it difficult for accurate data prefetching without recording a huge miss history. In this paper, we present a semantics-aware approach to dynamically identify pointer links in each node for traversal to the next node. Accurate LDS prefetching based on the node semantics can be accomplished with minimum history information. In addition, we evaluate three hardware-based leap prefetching methods to timely fetch the nodes further ahead in the traversal path for overcoming the lateness in LDS prefetching. Performance evaluations based on LDS intensive applications show that with an integrated stream/stride prefetcher, semantics-aware prefetcher improves performance over without prefetching by 45%. In comparison with the stream prefetcher, a dependence-based prefetcher, and a content-directed prefetcher, the average improvement is 20%, 16%, and 23% respectively.","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":"130604965","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

Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments 点对点虚拟环境中三维Voronoi图的负载均衡特性

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

Mahathir Almashor, I. Khalil

{"title":"Load-Balancing Properties of 3D Voronoi Diagrams in Peer-to-Peer Virtual Environments","authors":"Mahathir Almashor, I. Khalil","doi":"10.1109/ICPADS.2010.97","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.97","url":null,"abstract":"Balancing communication workloads is a perennial performance issue in the area of Distributed Virtual Environments (DVE). The stringent time constraints of Multiplayer Online Games (MOG) complicate efforts to effectively distribute the networking load amongst servers. This issue becomes ever more exacting, when we move towards a fully Peer-to-peer virtual world (P2P-VE). We are consequently forced to factor in the limited capabilities of ordinary peers in the network. Traditional MOGs have been built on the client-server (CS) paradigm and the industry brute-force approach of over-provisioning resources is both inelegant and non-resilient in the face of failures. Moving such systems onto P2P architectures mitigates these drawbacks significantly. Our recent application of three-dimensional Voronoi Diagrams (3D-VD) onto P2P-VEs has further introduced desirable load-balancing properties in such systems. This is due to the novel use network capacity as the metric for the 3rd dimension and the subsequent use of the 3D-VD to intelligently appoint dynamic game-play arbitrators from amongst the peer population. This short paper is a preliminary report on the load-balancing properties seen in our extensive simulations. It is shown how this approach is able to appropriately distribute load in a variety of network configurations and peer populations. Thus, the performance of the collaborating peers is enhanced, ultimately leading to better game-play experience.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"10 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":"115353208","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

Approximate Data Collection for Wireless Sensor Networks 无线传感器网络的近似数据采集

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

Chao Wang, Huadong Ma, Yuan He, Shuguang Xiong

{"title":"Approximate Data Collection for Wireless Sensor Networks","authors":"Chao Wang, Huadong Ma, Yuan He, Shuguang Xiong","doi":"10.1109/ICPADS.2010.32","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.32","url":null,"abstract":"Data collection is a fundamental issue in wireless sensor networks. In many application scenarios for sensor networks, approximate data collection is a wise choice due to the constraints in communication bandwidth and energy budget. In this paper, we focus on efficient approximate data collection with given error bounds in wireless sensor networks. The key idea of our data collection approach ADC (Approximate Data Collection) is to divide a sensor network into clusters, discover local data correlations on each cluster head, and perform a global approximate data collection on the sink according to model parameters uploaded by cluster heads. Specifically, we propose a local estimation model to approximate the readings of several subsets of sensor nodes, and prove rated error-bounds of data collection using this model. In the process of model-based data collection, we formulate the problem of selecting the minimum subset of sensor nodes into a minimum dominating set problem which is known to be NP-hard, and use a greedy heuristic algorithm to find an approximate solution. We also propose a monitoring algorithm to adjust these subsets according to the changes of sensor readings. Our trace-driving simulation results show that our data collection approach ADC can notably reduce the communication cost with given error bounds.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"6 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":"115911398","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

Kumoi: A High-Level Scripting Environment for Collective Virtual Machines Kumoi:用于集合虚拟机的高级脚本环境

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

Akiyoshi Sugiki, Kazuhiko Kato, Y. Ishii, Hiroki Taniguchi, Nobuyuki Hirooka

引用次数: 7

Discovering Free-Riders Before Trading: A Simple Approach 在交易前发现搭便车者:一个简单的方法

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

R. L. Xia, J. Muppala

引用次数: 7

Towards the Efficiency of Ontology-Based Context Reasoning in Virtual Computing Environment 虚拟计算环境下基于本体的上下文推理效率研究

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

Shanshan Wang, Gang Wu, XiaoChong Cao

引用次数: 0

Simulating Large Scale Parallel Applications Using Statistical Models for Sequential Execution Blocks 使用顺序执行块的统计模型模拟大规模并行应用程序

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

G. Zheng, G. Gupta, Eric J. Bohm, Isaac Dooley, L. Kalé

引用次数: 22