发布求助
文献互助 智能选刊 最新文献

2007 International Conference on Parallel Processing (ICPP 2007)最新文献

筛选
英文 中文
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment 最优三序列对齐的高效并行算法
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.38
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, C. Tang
{"title":"Efficient Parallel Algorithm for Optimal Three-Sequences Alignment","authors":"Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, C. Tang","doi":"10.1109/ICPP.2007.38","DOIUrl":"https://doi.org/10.1109/ICPP.2007.38","url":null,"abstract":"Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), syntenic alignment, multiple sequence alignment (MSA) and constraint multiple sequence alignment, etc. Three-sequence alignment (3SA) problem has been proposed and discussed in the computational biology and proved that the alignment results from 3SA are better than those from 2SA under some conditions. However, 3SA problem is less discussed over the past decade due to the computer capability. 3SA problem now is worthy to discuss due to the powerful computer and more and more genome and protein sequences. In this paper, an efficient parallel algorithm (P3SA) is proposed to solve 3SA problem. The P3SA method requires 0(n2/p) space complexity and 0(n3/p) time complexity. The experimental results show that P3SA algorithm is applicable and achieves a satisfied speed-up.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115442171","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
Code Compilation for an Explicitly Parallel Register-Sharing Architecture 显式并行寄存器共享体系结构的代码编译
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.24
Alex Gontmakher, A. Mendelson, A. Schuster, Gregory Shklover
{"title":"Code Compilation for an Explicitly Parallel Register-Sharing Architecture","authors":"Alex Gontmakher, A. Mendelson, A. Schuster, Gregory Shklover","doi":"10.1109/ICPP.2007.24","DOIUrl":"https://doi.org/10.1109/ICPP.2007.24","url":null,"abstract":"Code generation for a multithreaded register sharing architecture is inherently complex and involves some issues absent in conventional code compilation. To approach the problem, we define a consistency contract between the program and the hardware and require the compiler to preserve the contract during code transformations. To apply the contract to compiler implementation, we develop a correctness framework that ensures preservation of the contract and use it to adjust the code optimizations for correctness under parallel code. One area that is naturally affected by register sharing is register allocation. We discuss adaptation of existing coloring-based algorithms for shared code and show how they benefit from the consistency contract. Another benefit affects the general compiler optimizations. We show that these optimizations need very little restrictions in order to be correct for parallel code, allowing the compiler to realize its potential to a high degree.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130372145","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
Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks 大规模非结构化点对点网络中的协同搜索
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.26
Yiming Zhang, Dongsheng Li, Lei Chen, Xicheng Lu
{"title":"Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks","authors":"Yiming Zhang, Dongsheng Li, Lei Chen, Xicheng Lu","doi":"10.1109/ICPP.2007.26","DOIUrl":"https://doi.org/10.1109/ICPP.2007.26","url":null,"abstract":"Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a Parallel, collaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called distributed Bloom filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179031","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}
引用次数: 7
Towards Location-aware Topology in both Unstructured and Structured P2P Systems 非结构化和结构化P2P系统中位置感知拓扑的研究
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.81
Tongqing Qiu, Guihai Chen, Mao Ye, E. Chan, Ben Y. Zhao
{"title":"Towards Location-aware Topology in both Unstructured and Structured P2P Systems","authors":"Tongqing Qiu, Guihai Chen, Mao Ye, E. Chan, Ben Y. Zhao","doi":"10.1109/ICPP.2007.81","DOIUrl":"https://doi.org/10.1109/ICPP.2007.81","url":null,"abstract":"A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP- G for generic condition and PROP-0 for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP- O, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780064","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}
引用次数: 28
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems 异构和同构计算系统中静态任务调度的改进
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.49
Chih-Hsueh Yang, Peizong Lee, Yeh-Ching Chung
{"title":"Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems","authors":"Chih-Hsueh Yang, Peizong Lee, Yeh-Ching Chung","doi":"10.1109/ICPP.2007.49","DOIUrl":"https://doi.org/10.1109/ICPP.2007.49","url":null,"abstract":"In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing phase, we use existing techniques to generate partial-order task sequences based on critical-path-first ordering, critical-task-first ordering, and their hybrids. For the scheduling phase, we propose a task-duplication algorithm with a look-ahead technique, so that the complexity of the new algorithm does not increase. The experiment results show that our algorithm outperforms other algorithms for any feasible task sequences with respect to the average execution times and the average scheduling length ratios.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133020203","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}
引用次数: 21
COBRA: An Adaptive Runtime Binary Optimization Framework for Multithreaded Applications COBRA:一个多线程应用程序的自适应运行时二进制优化框架
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.23
Jinpyo Kim, W. Hsu, P. Yew
{"title":"COBRA: An Adaptive Runtime Binary Optimization Framework for Multithreaded Applications","authors":"Jinpyo Kim, W. Hsu, P. Yew","doi":"10.1109/ICPP.2007.23","DOIUrl":"https://doi.org/10.1109/ICPP.2007.23","url":null,"abstract":"This paper presents COBRA (continuous binary re-adaptation), a runtime binary optimization framework, for multithreaded applications. It is currently implemented on Itanium 2 based SMP and cc-NUMA systems. Using OpenMP NAS parallel benchmark, we show how COBRA can adoptively choose appropriate optimizations according to observed changing runtime program behavior. Coherent cache misses caused by true/false data sharing often limit the scalability of multithreaded applications. This paper shows that COBRA can significantly improve the performance of some applications parallelized with OpenMP, by reducing the aggressiveness of data prefetching and by using exclusive hints for prefetch instructions. For example, we show that COBRA can improve the performance of OpenMP NAS parallel benchmarks up to 68%, with an average of 17.5% on the SGI Altix cc-NUMA system.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132737062","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}
引用次数: 10
An Effective Strategy for Porting C++ Applications on Cell 在Cell上移植c++应用程序的有效策略
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.15
A. Varbanescu, H. Sips, K. A. Ross, Qiang Liu, Lurng-Kuo Liu, A. Natsev, John R. Smith
{"title":"An Effective Strategy for Porting C++ Applications on Cell","authors":"A. Varbanescu, H. Sips, K. A. Ross, Qiang Liu, Lurng-Kuo Liu, A. Natsev, John R. Smith","doi":"10.1109/ICPP.2007.15","DOIUrl":"https://doi.org/10.1109/ICPP.2007.15","url":null,"abstract":"In this paper we present a solution for efficient porting of sequential C++ applications on the Cell B.E. processor. We present our step-by-step approach, focusing on its generality, we provide a set of code templates and optimization guidelines to support the porting, and we include a set of equations to estimate the performance gain of the new application. As a case-study, we show the use of our solution on a multimedia content analysis application, named MARVEL. The results of our experiments with MARVEL prove the significant performance increase in favor of the application running on Cell when compared with the reference implementation.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506404","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
Defending P2Ps from Overlay Flooding-based DDoS 保护p2p免受基于覆盖洪水的DDoS攻击
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.31
Yunhao Liu, Xiaomei Liu, Chen Wang, Li Xiao
{"title":"Defending P2Ps from Overlay Flooding-based DDoS","authors":"Yunhao Liu, Xiaomei Liu, Chen Wang, Li Xiao","doi":"10.1109/ICPP.2007.31","DOIUrl":"https://doi.org/10.1109/ICPP.2007.31","url":null,"abstract":"A flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overlay distributed denial-of-service (DDoS) attacks. Most previous security techniques protect networks from network-layer DDoS attacks, but cannot be applied to overlay DDoS attacks. Overlay flooding-based DDoS attacks can be more damaging in that a small number of messages are inherently propagated to consume a large amount of bandwidth and computation resources. We propose a distributed and scalable method, DD-POLICE, to detect malicious nodes in order to defend P2P systems from overlay flooding-based DDoS attacks. We show the effectiveness of DD-POLICE by comprehensive simulation studies. We believe that deploying DD-POLICE will make P2P systems more scalable and robust.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123489931","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}
引用次数: 8
Advanced Flow-control Mechanisms for the Sockets Direct Protocol over InfiniBand InfiniBand上套接字直接协议的高级流量控制机制
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.14
P. Balaji, S. Bhagvat, D. Panda, R. Thakur, W. Gropp
{"title":"Advanced Flow-control Mechanisms for the Sockets Direct Protocol over InfiniBand","authors":"P. Balaji, S. Bhagvat, D. Panda, R. Thakur, W. Gropp","doi":"10.1109/ICPP.2007.14","DOIUrl":"https://doi.org/10.1109/ICPP.2007.14","url":null,"abstract":"The Sockets Direct Protocol (SDP) is an industry standard to allow existing TCP/IP applications to be executed on high-speed networks such as InfiniBand (IB). Like many other high-speed networks, IB requires the receiver process to inform the network interface card (NIC), before the data arrives, about buffers in which incoming data has to be placed. To ensure that the receiver process is ready to receive data, the sender process typically performs flow-control on the data transmission. Existing designs of SDP flow-control are naive and do not take advantage of several interesting features provided by IB. Specifically, features such as RDMA are only used for performing zero-copy communication, although RDMA has more capabilities such as sender-side buffer management (where a sender process can manage SDP resources for the sender as well as the receiver). Similarly, IB also provides hardware flow-control capabilities that have not been studied in previous literature. In this paper, we utilize these capabilities to improve the SDP flow-control over IB using two designs: RDMA-based flow-control and NIC-assisted RDMA-based flow-control. We evaluate the designs using micro-benchmarks and real applications. Our evaluations reveal that these designs can improve the resource usage of SDP and consequently its performance by an order-of-magnitude in some cases. Moreover we can achieve 10-20% improvement in performance for various applications.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059042","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}
引用次数: 7
A Composition Approach to Mutual Exclusion Algorithms for Grid Applications 网格应用中互斥算法的组合方法
2007 International Conference on Parallel Processing (ICPP 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPP.2007.6
Julien Sopena, F. Legond-Aubry, L. Arantes, Pierre Sens
{"title":"A Composition Approach to Mutual Exclusion Algorithms for Grid Applications","authors":"Julien Sopena, F. Legond-Aubry, L. Arantes, Pierre Sens","doi":"10.1109/ICPP.2007.6","DOIUrl":"https://doi.org/10.1109/ICPP.2007.6","url":null,"abstract":"We propose a new composition approach to mutual exclusion algorithms for applications spread over a grid which is composed of a federation of clusters. Taking into account the heterogeneity of communication latency, our hierarchical architecture combines intra and inter cluster algorithms. We focus on token-based algorithms and study different compositions of algorithms. Performance evaluation tests have been conducted on a national grid testbed whose results show that our approach is scalable and that the choice of the most suitable inter cluster algorithm depends on the behavior of the application.","PeriodicalId":238643,"journal":{"name":"2007 International Conference on Parallel Processing (ICPP 2007)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133288929","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
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书