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

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming最新文献

筛选
英文 中文
A Novel Elastic Resource Allocation Strategy of Virtual Cluster 一种新的虚拟集群弹性资源分配策略
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.28
Feifei Liu, Xiaoshe Dong
{"title":"A Novel Elastic Resource Allocation Strategy of Virtual Cluster","authors":"Feifei Liu, Xiaoshe Dong","doi":"10.1109/PAAP.2011.28","DOIUrl":"https://doi.org/10.1109/PAAP.2011.28","url":null,"abstract":"Aiming at the problem on how to effectively allocate HPC resources to improve the efficiency of system, this paper presents a novel elastic resources allocation strategy. Within the changing range the users have assigned, the strategy permits the system to dynamically adjust the resource distribution of virtual clusters so that the efficiency of the system can be improved and users' costs can be reduced. To better implement the strategy, this paper provides a detailed description about the issue of resource allocation, and then proposes a algorithm named Mixed Bin Packing Algorithm. Experimental results indicate that the Mixed Bin Packing Algorithm is more effective than the previous algorithms, especially in a large application scale background.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125955730","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
Effective Methods to Avoid the Internet Censorship 规避互联网审查的有效方法
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.54
Feng Ding, Zhiqing Yang, Xuelong Chen, Jianfeng Guo
{"title":"Effective Methods to Avoid the Internet Censorship","authors":"Feng Ding, Zhiqing Yang, Xuelong Chen, Jianfeng Guo","doi":"10.1109/PAAP.2011.54","DOIUrl":"https://doi.org/10.1109/PAAP.2011.54","url":null,"abstract":"We speculated the techniques used by Internet censorship and compared the general methods to break through, including VPN, SSH, IPV6, proxy tools, hosts file modify and web proxy. A new method we called Proxy Pool was put forward in this paper. All our experiments were done under Internet censorship.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124826138","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}
引用次数: 1
A Case Study of the Interplay between Conflict Management and Version Management in Hardware Transactional Memory Systems 硬件事务性存储系统中冲突管理与版本管理相互作用的案例研究
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.50
Zhichao Yan, D. Feng, Yujuan Tan
{"title":"A Case Study of the Interplay between Conflict Management and Version Management in Hardware Transactional Memory Systems","authors":"Zhichao Yan, D. Feng, Yujuan Tan","doi":"10.1109/PAAP.2011.50","DOIUrl":"https://doi.org/10.1109/PAAP.2011.50","url":null,"abstract":"As one of the most potential solution to parallel programming on the future many-core platforms, Transactional Memory (TM) systems have attracted a great deal of attention from both the industry and academic since the first TM was proposed in 1993. Various design and implementation proposals have been proposed to improve the performance while reducing the overheads. Recent investigations of the high-contention and coarse-grained transactional workloads on TMs reveal various pathologies that will offset the performance benefits. In this paper, we analysis the advantages and disadvantages of the existing conflict management and version management schemes, make a case study in the interplay between conflict management and version management in hardware transactional memory systems, to learn its impact on performance and find some interesting appearance that can guide the future design. In particular, apply software runtime environment to support recognize application's dynamic behaviors and resolve transactional conflicts can obtain an average speedup of 11.7% across the 8 applications selected from the STAMP benchmark suite on DynTM, which is regarded as one of the most latest progress in hardware transactional memory systems.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128585911","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
Enabling Grid Computing over IPv6 within a Campus Network 在校园网中通过IPv6实现网格计算
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.71
Jun Chen, You Zou, Zhongyu Liu, Qing Wu
{"title":"Enabling Grid Computing over IPv6 within a Campus Network","authors":"Jun Chen, You Zou, Zhongyu Liu, Qing Wu","doi":"10.1109/PAAP.2011.71","DOIUrl":"https://doi.org/10.1109/PAAP.2011.71","url":null,"abstract":"The biggest problem to be solved in grid computing is data transmission and communication efficiency and stability. For computing grid composed of small local area network(LAN), this problem can be solved by properly building LAN with the use of IPv4 network or high-speed computing network such as Infiniband. However, when the computing resources are distributed in different physical regions, data transmission and communication will be affected by various factors such as time period and load. On the one hand, the stability of transmission cannot be guaranteed; On the other hand, the speed of cross-regional data transmission is not optimistic. As the next generation of Internet protocol, IPv6 is at a transitional stage, and the load is far less than the IPv4-based network. So, it has a better stability and higher bandwidth. With the help of IPv6 network, cross-regional computing grids can be constructed to connect the computing resources in different physical regions in order to deal with some complex computing problems. This paper studies and tests the feasibility of transplanting MPI application (which is more commonly used in distributed computing) into IPv6 network for grid computing, and presents its implementation process in detail.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116612762","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
A Shared Cache-Aware Hybrid Real-Time Scheduling on Multicore Platform with Hierarchical Cache 基于分层缓存的多核平台共享缓存感知混合实时调度
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.68
Yan Wang, Lida Huang, Renfa Li, Rui Li
{"title":"A Shared Cache-Aware Hybrid Real-Time Scheduling on Multicore Platform with Hierarchical Cache","authors":"Yan Wang, Lida Huang, Renfa Li, Rui Li","doi":"10.1109/PAAP.2011.68","DOIUrl":"https://doi.org/10.1109/PAAP.2011.68","url":null,"abstract":"Hybrid approach for scheduling on multicore processors that can effectively integrate the advantage of global scheduling and partitioning scheduling, becoming one of the hottest issues in real-time scheduling. Meanwhile, different from single-core, multicore architecture in the form of a variety of hierarchical shared caches, efficient cache usage on multicore platforms can greatly improve the scheduling efficiency. This paper proposes an improved hybrid approach for scheduling real-time tasks on multicore platforms, a multicore platform is partitioned into clusters that share a L2 cache, tasks which access a common region of memory are statically assigned to a same cluster, and those task are encouraged to co-scheduling in those cluster using improved global EDF algorithm. Simulation shows that this algorithm can improve the cache performance.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114292868","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
An Efficient Algorithm for Privacy Preserving Maximal Frequent Itemsets Mining 一种有效的保护隐私的最大频繁项集挖掘算法
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.62
YuQing Miao, Xiaohua Zhang, Kongling Wu, Jie Su
{"title":"An Efficient Algorithm for Privacy Preserving Maximal Frequent Itemsets Mining","authors":"YuQing Miao, Xiaohua Zhang, Kongling Wu, Jie Su","doi":"10.1109/PAAP.2011.62","DOIUrl":"https://doi.org/10.1109/PAAP.2011.62","url":null,"abstract":"This paper addressed the insecurity and the inefficiency of privacy preserving association rule mining in vertically partitioned data. We presented a privacy preserving maximal frequent itemsets mining algorithm in vertically partitioned data. The algorithm adopted a more secure vector dot protocol which used an inverse matrix to hide the original input vector, and without any site revealing privacy vector. The mining strategy was based on depth-first search for the maximal frequent itemsets. Performance analysis and experimental analysis showed that the algorithm possessed higher security and efficiency.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359300","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
An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes 一种寻找扭曲立方体上最优独立生成树的算法
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.59
Yan Wang, Jianxi Fan, Yuejuan Han
{"title":"An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes","authors":"Yan Wang, Jianxi Fan, Yuejuan Han","doi":"10.1109/PAAP.2011.59","DOIUrl":"https://doi.org/10.1109/PAAP.2011.59","url":null,"abstract":"Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There is a conjecture on independent spanning trees: any n-connected graph has n independent spanning trees rooted at an arbitrary vertex. The conjecture has been confirmed only for n-connected graphs with n=4, and it is still open for arbitrary n-connected graphs when n ≥ 5. In this paper, we provide a construction algorithm to find n independent spanning trees for the n-dimensional twisted-cube TNn, where N denotes the number of vertices in TNn. And for n ≥ 3, the height of each indepen- dent spanning tree on TNn is n+1.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"106 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945022","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
Parallelization of BLAST with MapReduce for Long Sequence Alignment 基于MapReduce的BLAST长序列对齐并行化
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.36
Xiaoliang Yang, Yulong Liu, C. Yuan, Yihua Huang
{"title":"Parallelization of BLAST with MapReduce for Long Sequence Alignment","authors":"Xiaoliang Yang, Yulong Liu, C. Yuan, Yihua Huang","doi":"10.1109/PAAP.2011.36","DOIUrl":"https://doi.org/10.1109/PAAP.2011.36","url":null,"abstract":"Sequence alignment is of great importance in biology research. BLAST is a sequence alignment tool used extensively by researchers. However the continuously increasing amount of sequence data to be processed presents many challenges to it. This paper gives a simple and effective approach to parallelizing BLAST using the MapReduce technique. The MapReduce-BLAST shows very good performance and scales nearly linearly to the database size and query length. This results from both the power of MapReduce and the inherent parallel characteristics of the BLAST algorithm. Sequence alignment algorithms based on techniques similar with BLAST's seed-and-extend approach are very suitable for being parallelized with MapReduce.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125421737","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}
引用次数: 17
A Power Law Relay Routing Overlay 幂律中继路由覆盖
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.39
Ma Tao, Chunhong Zhang
{"title":"A Power Law Relay Routing Overlay","authors":"Ma Tao, Chunhong Zhang","doi":"10.1109/PAAP.2011.39","DOIUrl":"https://doi.org/10.1109/PAAP.2011.39","url":null,"abstract":"Application relays can be used to reduce end-to-end latency to provide shorter paths than IP default paths. To fit the large-scale and distributed features of Internet, the nodes can cooperate to form a latency-reducing routing overlay by acting as relays for each other in peer-to-peer paradigms. In this paper, we utilize the triangle inequality violations (TIV) in delay space to model the relays and analyze their properties to help relay selections. We find that the utility of relays approximate the power law distribution, which inspires us to propose a distributed power law relay selection algorithm, which tries to locate super candidates which has large relay utility to act as good relays. It is simulated to show its performance and efficiency.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127633378","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}
引用次数: 1
The Arithmetic of Peers Selecting and Improvement of Peer Selection Strategies in P2P Live Streaming P2P网络直播中对等点选择算法及对等点选择策略的改进
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-09 DOI: 10.1109/PAAP.2011.37
Jiannan Wei, Lei Zhuang
{"title":"The Arithmetic of Peers Selecting and Improvement of Peer Selection Strategies in P2P Live Streaming","authors":"Jiannan Wei, Lei Zhuang","doi":"10.1109/PAAP.2011.37","DOIUrl":"https://doi.org/10.1109/PAAP.2011.37","url":null,"abstract":"Peer selection strategy is one of the core issues in P2P streaming system, because peers can not only become a provider of video streaming, but also can retrieve the video stream information from its neighbor peers. In this paper the idea of similar route method was used to detect autonomous systems (AS) and substitute the known full topology information of the AS with exact position of peers in the AS. As well as combine the traditional strategy of the smallest number of hops to select the peer. In addition to the excellence of the peer and the aggregate flow rate to choose the best peer or best peer set as the supply of newly joined peers. And solve the minimum-hop candidate peers with the same priority issues. Simulation results show that in the improved strategies the network congestion has been reduced compared with the previous strategies.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126398831","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信