2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing最新文献

Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures 平衡服务器负载，维护可扩展的分布式数据结构

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.13

Grzegorz Lukawski, K. Sapiecha

引用次数: 5

Converging Quickly to Independent Uniform Random Topologies 快速收敛到独立一致随机拓扑

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.60

Anne-Marie Kermarrec, V. Leroy, Christopher Thraves

{"title":"Converging Quickly to Independent Uniform Random Topologies","authors":"Anne-Marie Kermarrec, V. Leroy, Christopher Thraves","doi":"10.1109/PDP.2011.60","DOIUrl":"https://doi.org/10.1109/PDP.2011.60","url":null,"abstract":"The peer sampling service is a core building block for gossip protocols in peer-to-peer networks. Ideally, a peer sampling service continuously provides each peer with a sample of peers picked uniformly at random in the network. While empirical studies have shown that uniformity was achieved, analysis proposed so far assume strong restrictions on the topology of the overlay network it continuously generates. In this work, we analyze a Generic Random Peer Sampling Service (GRPS) that satisfies the desirable properties for any peer sampling service–small views, uniform sample, load balancing, and independence– and relieve strong degree connections in the nodes assumed in previous works. The main result we prove is: starting from any simple (without loops and parallel edges) directed graph with out-degree equal to c for all nodes, and recursively applying GRPS, eventually results in a random simple directed graph with out-degree equal to c for all nodes. We test empirically convergence time and independence time for GRPS. Finally, We use this empirical evaluation to show that GRPS performs better than previously presented peer sampling services.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581337","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

Dense Dynamic Programming on Multi GPU 基于多GPU的密集动态规划

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.25

V. Boyer, D. E. Baz, M. Elkihel

引用次数: 22

PETransWS: Web Service Computing Platform for Logistics and Transportation PETransWS:物流与运输网络服务计算平台

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.86

F. Almeida, Vicente Blanco Pérez, J. Brito, Andres Crespo, J. Moreno-Pérez, Adrián Santos

引用次数: 0

Dynamic Load Balancing for High-Performance Simulations of Combustion in Engine Applications 发动机应用中高性能燃烧模拟的动态负载平衡

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.88

L. Antonelli, P. D'Ambra

引用次数: 4

A Failure Handling Framework for Distributed Data Mining Services on the Grid 网格上分布式数据挖掘服务的故障处理框架

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.50

Eugenio Cesario, D. Talia

引用次数: 5

Modeling Unconnectable Peers in Private BitTorrent Communities 在私有BitTorrent社区中建模不可连接的同伴

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.21

Kornel Csernai, Márk Jelasity, J. Pouwelse, T. Vinkó

{"title":"Modeling Unconnectable Peers in Private BitTorrent Communities","authors":"Kornel Csernai, Márk Jelasity, J. Pouwelse, T. Vinkó","doi":"10.1109/PDP.2011.21","DOIUrl":"https://doi.org/10.1109/PDP.2011.21","url":null,"abstract":"In a typical BitTorrent swarm, a large proportion of the peers are behind firewalls or NATs. These peers are called unconnectable. When developing P2P applications, a main requirement is to handle unconnectable peers appropriately. One important aspect of this problem, which has not been emphasized so far, is understanding the difference between the attributes of unconnectable peers and peers in the open Internet. For example, if unconnectable peers spend much less time online, or if they download significantly more, exploiting these facts helps to optimize the implementation, and ignoring these facts can even lead to severe performance problems. Comparing open and unconnectable peers is not easy because most traces contain no information about connect ability. Here we study two large traces collected in two private BitTorrent communities: FileList.org and BitSoup.org, both of which contain the connect ability attribute. From these traces we extract several attributes of individual online sessions, swarms, and users. We compare the distributions of these attributes over unconnectable and open peers. We find that there are some potentially important differences, e.g., unconnectable users tend to have a lot more sessions, and they tend to spend slightly more time online. Some of our findings are in contradiction with previous results that were based on a different trace collection methodology.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126536469","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

MPI-PERF-SIM: Towards an Automatic Performance Prediction Tool of MPI Programs on Hierarchical Clusters MPI- perf - sim:层次集群上MPI程序的自动性能预测工具

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.49

Sami Achour, Meher Ammar, Boubaker Khmili, W. Nasri

{"title":"MPI-PERF-SIM: Towards an Automatic Performance Prediction Tool of MPI Programs on Hierarchical Clusters","authors":"Sami Achour, Meher Ammar, Boubaker Khmili, W. Nasri","doi":"10.1109/PDP.2011.49","DOIUrl":"https://doi.org/10.1109/PDP.2011.49","url":null,"abstract":"We present in this paper a framework for performance prediction of parallel programs on hierarchical clusters. This framework is mainly designed for the use by the switching functions in parallel adaptive applications. Indeed, the principal referred objectives by this framework are the accuracy of the prediction and the rapidity of the prediction process. To achieve these objectives, our framework is based on two principal steps, the first is at the installation moment of the parallel application, and the second is at runtime. In the first step, we profile two components which are sequential kernels of the program and network performances. In order to model accurately these two components we have developed new strategies of regression. In the second step, we use the generated models and the runtime variables to the completion time estimation via our fast simulator MPI-PERF-SIM. Our experimentations on the Grid'5000 platform demonstrate the interest of this approach that can be the basis of adaptivity for parallel numerical libraries on dedicated hierarchical platforms.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131837739","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

SSE Vectorized and GPU Implementations of Arakawa's Formula for Numerical Integration of Equations of Fluid Motion 流体运动方程数值积分的Arakawa公式的SSE矢量化和GPU实现

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.80

Evren Yurtesen, M. Ropo, M. Aspnäs, J. Westerholm

引用次数: 2

Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Knapsack Problem 0-1背包问题的自适应最优并行算法

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing Pub Date : 2011-02-09 DOI: 10.1109/PDP.2011.11

Kenli Li, Lingxiao Li, Teklay Tesfazghi, E. Sha

引用次数: 3