2013 International Conference on Parallel and Distributed Systems最新文献_第10页

Application Layer Multicast in P2P Distributed Interactive Applications P2P分布式交互应用中的应用层组播

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.62

Yusen Li, Wentong Cai, Xueyan Tang

{"title":"Application Layer Multicast in P2P Distributed Interactive Applications","authors":"Yusen Li, Wentong Cai, Xueyan Tang","doi":"10.1109/ICPADS.2013.62","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.62","url":null,"abstract":"By sharing resources among peers in peer-to-peer network, application layer multicast (ALM) has been shown an efficient way to improve the scalability and reduce the latency of communication. To deploy ALM in peer-to-peer distributed interactive applications (DIAs), the property of many-to-many communication of DIA demands multiple multicast trees to be constructed in the overlay. Therefore, how to efficiently allocate resources among multiple trees to maximize the benefit is an important and challenging issue. In this paper, we study the problem of building ALM trees with minimum total end-to-end delay to receivers in peer-to-peer DIAs with resource constraints on network bandwidth. The end-to-end delay from a sender to receivers in a multicast tree consists of the link delay as well as the packet queuing delay at intermediate peers, while the latter is often ignored or not well studied in the previous work. In this paper, we explicitly establish the relationship between the queuing delay at peers and the topology of multicast trees in peer-to-peer DIAs. Based on the relationship, the above mentioned problem is defined and we prove that it is NP-complete. We present a centralized heuristic algorithm to obtain an approximate solution. Moreover, distributed algorithms are also investigated to refine the topology in practical systems with dynamic changes. Extensive experiments were conducted by simulations to evaluate the proposed algorithms and results are reported in the paper.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128486929","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

System-Level Scheduling of Mixed-Criticality Traffics in Avionics Networks 航空电子网络混合临界流量的系统级调度

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.75

Jianguo Yao, G. Zhu

引用次数: 13

Leveraging Hybrid Hardware in New Ways - The GPU Paging Cache 以新的方式利用混合硬件——GPU分页缓存

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.49

Frank Feinbube, Peter Tröger, Johannes Henning, A. Polze

引用次数: 0

SHOE: A SPARQL Query Engine Using MapReduce 使用MapReduce的SPARQL查询引擎

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.78

Wenhai Li, Biren Chen, Ruijiang Yao, Yunpeng Li, Weidong Wen, C. Cheung, Wanghong Li

引用次数: 1

Dual-Region Location Management for Mobile Ad Hoc Networks 移动Ad Hoc网络的双区域位置管理

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.61

Yinan Li, I. Chen, Ding-Chau Wang

{"title":"Dual-Region Location Management for Mobile Ad Hoc Networks","authors":"Yinan Li, I. Chen, Ding-Chau Wang","doi":"10.1109/ICPADS.2013.61","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.61","url":null,"abstract":"We propose and analyze a novel location management scheme for mobile ad hoc networks (MANETs) called Dual-region Mobility Management (DrMoM). The basic design concept of DrMoM is to use local regions to complement existing location services in MANETs that assign home regions to mobile nodes and have mobile nodes in the home region of a mobile node serve as location servers for that node. DrMoM is based on the design notion of integrated mobility and service management for network cost minimization. Specifically, unlike existing location services that define the home region size statically at design time for all mobile users, DrMoM dynamically determines the optimal home region size and local region size per mobile user based on mobility and service characteristics of individual mobile nodes to minimize the overall network cost incurred by location management and data packet delivery. We develop a performance model to derive the optimal values of these two key design parameters under which the overall network cost incurred by DrMoM is minimized. Through a comparative performance study, we show that DrMoM outperforms a well-known scheme called SLURP based on static home regions as well as a region-based location management scheme called RUDLS which claims to outperform contemporary region-based location management schemes.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865329","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

SAIL: A Strategy-Proof Auction Mechanism for Cooperative Communication 协作通信的无策略拍卖机制SAIL

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.60

Zhenzhe Zheng, Juntao Wang, Fan Wu, Guihai Chen

引用次数: 5

Efficient Barrier Synchronization for OpenMP-Like Parallelism on the Intel SCC 在Intel SCC上实现类似openmp并行的高效屏障同步

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.15

H. Al-Khalissi, R. Buchty, Mladen Berekovic

{"title":"Efficient Barrier Synchronization for OpenMP-Like Parallelism on the Intel SCC","authors":"H. Al-Khalissi, R. Buchty, Mladen Berekovic","doi":"10.1109/ICPADS.2013.15","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.15","url":null,"abstract":"The continuous increase of the number of processing cores on die poses a new set of challenges to HPC applications programming including how to model, write, and verify software that has to use the full power of NoC-based manycore processors. Therefore, to simplify program development for the Single-chip Cloud Computer (SCC), it is desirable to have high-level, shared memory-based parallel programming abstractions (e.g., an OpenMP-like programming model). One of the key components of any similar programming model are barrier synchronization primitives, coordinating the work of parallel threads. To allow high-level barrier constructs to deliver good performance, we need an efficient implementation of the underlying synchronization algorithm. In this paper, we propose effective barrier synchronization implementations for shared-memory programming on non-cache-coherent cluster-on-chip represented by the Intel SCC. In particular, we present an extensive evaluation of the overhead associated with integrating barrier algorithms required for OpenMP runtime libraries on such a machine, validating several implementation variants that efficiently exploit the network topology and leveraging SCC-specific hardware. We provide a detailed evaluation of the performance achieved by different approaches by using micro-benchmarks.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117032721","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

Semantic-Aware Hot Data Selection Policy for Flash File System in Android-Based Smartphones android智能手机Flash文件系统的语义感知热数据选择策略

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.77

Dongsoo Choi, Dongkun Shin

引用次数: 2

A Heuristic Strategy for Performance Optimisation of Stream Programs 流程序性能优化的启发式策略

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.70

V. Nguyen, R. Kirner

引用次数: 0

Online Performance Projection for Clusters with Heterogeneous GPUs 异构gpu集群的在线性能投影

2013 International Conference on Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/ICPADS.2013.48

Lokendra S. Panwar, Ashwin M. Aji, Jiayuan Meng, P. Balaji, Wu-chun Feng

引用次数: 2