2010 39th International Conference on Parallel Processing最新文献_第7页

An Efficient Randomized Routing Protocol for Single-Hop Radio Networks 一种有效的单跳无线网络随机路由协议

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.25

S. Rajasekaran, Dolly Sharma, R. Ammar, N. Lownes

{"title":"An Efficient Randomized Routing Protocol for Single-Hop Radio Networks","authors":"S. Rajasekaran, Dolly Sharma, R. Ammar, N. Lownes","doi":"10.1109/ICPP.2010.25","DOIUrl":"https://doi.org/10.1109/ICPP.2010.25","url":null,"abstract":"In this paper we study the important problems of message routing, sorting, and selection in a radio network. A radio network consists of stations where each station is a hand-held device. We consider a single-hop radio network. In a single-hop network it is assumed that each station is within the transmission range of every other station. Let RN(p; k) stand for a single-hop network that has p stations and k communication channels. The problems of sorting and selection have been studied on RN(p; k). For these problems it is assumed that there are n/p elements to start with at each station. At the end of sorting, the least n/p elements should be in the first station, the next smallest n/p elements should be in the second station, and so on. The best known prior algorithm for sorting takes 4n/k +o(n/k) broadcast rounds on a RN(p; k). In this paper we present a randomized algorithm that takes only 3n/k +o(n/k) broadcast rounds with high probability. For the selection problem, it is known that the maximum or minimum element can be found in O(log n) rounds on a RN(n; 1), provided broadcast conflicts can be resolved in O(1) time. The problem of general selection has not been addressed. In this paper we present a randomized selection algorithm that takes O(p/k) rounds on a RN(p; k) with high probability. An important message routing problem that is considered in the literature is one where there are n/p packets originating from each station and there are n/p packets destined for each station. The best known routing algorithms take nearly 2n/k times slots. An important open question has been if there exist algorithms that take only close to n/k time slots. Note that a trivial lower bound for routing is n/k. The existence of such algorithms will be highly relevant especially in emergencies and time critical situations. In this paper we answer this question by presenting a randomized algorithm that takes nearly n/k time slots with high probability.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132400794","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

Modelization and Performance Evaluation of the DIET Middleware DIET中间件的建模与性能评估

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.45

E. Caron, B. Depardon, F. Desprez

引用次数: 3

A Simple Effective Scheme to Enhance the Capability of Web Servers Using P2P Networks 一种利用P2P网络增强Web服务器性能的简单有效方案

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.76

Jie Yu, Liming Lu, Zhoujun Li, Xiaofeng Wang, Jinshu Su

{"title":"A Simple Effective Scheme to Enhance the Capability of Web Servers Using P2P Networks","authors":"Jie Yu, Liming Lu, Zhoujun Li, Xiaofeng Wang, Jinshu Su","doi":"10.1109/ICPP.2010.76","DOIUrl":"https://doi.org/10.1109/ICPP.2010.76","url":null,"abstract":"Nowadays, web servers are suffering from flash crowds and application layer DDoS attacks that can severely degrade the availability of services. It is difficult to prevent them because they comply with the communication protocol. Peer-to-peer (P2P) networks have been exploited to amplify DDoS attacks, but we believe their available resource, such as distributed storage and network bandwidth, can be used to mitigate both flash crowds and DDoS attacks. In this paper, we propose a server initiated approach to employ deployed P2P networks as distributed web caches, so that the workload directed to web servers can be reduced. In experiments, we use Kad as the particular P2P network for the realization of a large-scale distributed web cache. We performed comprehensive evaluation on the feasibility, efficiency and robustness of our scheme, through experiments and simulations on the prototype we implemented. The evaluation results show that our scheme can increase the capacity of the protected web servers at least 10 times at the same cost of connection and bandwidth consumption. The web contents cached in Kad remain reachable even under churn of peers and targeted DoS attack, and the access latency is comparable to normal direct access to web servers. It also achieves good load balancing under the heavy-tailed distribution of object popularity.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682365","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

Identifying the Root Causes of Wait States in Large-Scale Parallel Applications 确定大规模并行应用程序中等待状态的根本原因

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1145/2934661

David Böhme, M. Geimer, F. Wolf, L. Arnold

引用次数: 65

FlashCoop: A Locality-Aware Cooperative Buffer Management for SSD-Based Storage Cluster FlashCoop:一种基于ssd存储集群的位置感知协同缓冲管理

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.71

Q. Wei, Bozhao Gong, Suraj Pathak, Y. Tay

引用次数: 1

Lock-Free Multiway Search Trees 无锁多路搜索树

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.68

Michael Spiegel, P. Reynolds

引用次数: 13

Revisting Tag Collision Problem in RFID Systems RFID系统中标签碰撞问题的回顾

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-01 DOI: 10.1109/ICPP.2010.27

Lei Yang, Jinsong Han, Yong Qi, Cheng Wang, Yunhao Liu, Ying Chen, Xiao Zhong

引用次数: 18