X. Si, Airu Yin, Xiaocheng Huang, Xiaojie Yuan, X. Liu, G. Wang
{"title":"Parallel Optimization of Queries in XML Dataset Using GPU","authors":"X. Si, Airu Yin, Xiaocheng Huang, Xiaojie Yuan, X. Liu, G. Wang","doi":"10.1109/PAAP.2011.30","DOIUrl":"https://doi.org/10.1109/PAAP.2011.30","url":null,"abstract":"As XML is playing a crucial role in web services, databases, and document processing, efficient processing of XML queries has become an important issue. On the other hand, due to the increasing number of users, high throughput of XML queries is also required to execute tens of thousands of queries in a short time. Given the great success of GPGPU (General-Purpose computations on the Graphics Processors), we propose a parallel XML query model based on GPU, which mainly consists of two efficient task distribution strategies, to improve the efficiency and throughput of XML queries. We have developed a parallel simplified XPath language using Compute Unified Device Architecture (CUDA) on GPU, and evaluate our model on a recent NVIDIA GPU in comparison with its counterpart on eight-core CPU. The experiment results show that our model achieves both higher throughput and efficiency than CPU-based XML query.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"1 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":"130521889","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}
{"title":"Job Scheduling Optimization for Multi-user MapReduce Clusters","authors":"Yongcai Tao, Qing Zhang, Lei Shi, Pinhua Chen","doi":"10.1109/PAAP.2011.33","DOIUrl":"https://doi.org/10.1109/PAAP.2011.33","url":null,"abstract":"A shared MapReduce cluster is beneficial to build data warehouse which can be used by multiple users. FAIR scheduler gives each user the illusion of owning a private cluster. Moreover, it can dynamic redistribute capacity unused by some users to other users. However, when reassigning the slots, FAIR picks the most recently launched tasks to kill without considering the job character and data locality, which increases the network traffic while rescheduling the killed Map/Reduce tasks. The paper, based on FAIR scheduling, proposes an improved FAIR scheduling algorithm, which take into account the job character and data locality while killing tasks to make slots for new users. Performance evaluation results demonstrate that the improved FAIR decreases the data movement, speeds the execution of jobs, consequently improving the system performance.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"29 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":"128810409","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}
{"title":"A Parallel Subspace Iteration Method for Generalized Eigenvalue Problems Based on Multi-core Platform","authors":"Shunxu Wang","doi":"10.1109/PAAP.2011.47","DOIUrl":"https://doi.org/10.1109/PAAP.2011.47","url":null,"abstract":"A parallel subspace iteration method for solving eigenvalue problem of based on multi-core platform is presented, which can solve several extreme eigenpair in parallel. Compared with Jacobi-Davidson method, the dimension number of the subspace in the method keeps unchanged, which makes it easier for the programming implementation. Numerical experiments are performed with a quad-core computer under the joint programming environment of Intel Fortran and OpenMp. The computation of the plane wing frequency and aircraft pylon for a real model airplane is taken as an example. As a result, the first 10 frequencies of a plane wing and an aircraft pylon are provided which shown the efficiency and applicability of our parallel computation algorithm.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"34 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":"127356073","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}
{"title":"A Variant betweenness Centrality Approach towards Distributed Network Monitoring","authors":"Peng Ou, Zhishu Li","doi":"10.1109/PAAP.2011.53","DOIUrl":"https://doi.org/10.1109/PAAP.2011.53","url":null,"abstract":"As the development of Internet thrives, the network management has to be taken a serious look. This paper faces the dilemma of putting more monitors into the system and maintains the original settings at the same time. We research the adding mechanism and present a new algorithm for finding the critical locations for additional deployment in the network, in the context of traffic estimation with link weight change method. The algorithm is based on Apriori search method that combines with the link weight change algorithm, then tested with Between ness Centrality to form the candidate snapshots. We also develop the greedy algorithm with Group Between ness Centrality(GBC) involved for the purpose of comparing. The result shows that the new algorithm need less additional monitors than greedy algorithm.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"3 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":"125088987","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}
{"title":"An ID-Based Certified E-mail Protocol Suitable for Wireless Mobile Environments","authors":"Caifen Wang, Caihui Lan, Shufen Niu, Xiaojun Cao","doi":"10.1109/PAAP.2011.65","DOIUrl":"https://doi.org/10.1109/PAAP.2011.65","url":null,"abstract":"Certified e-mail protocol is a fair exchange of a message for a receipt between two potentially mistrusting parties over the network. A number of certified e-mail protocols have been studied in recent years. However, most of those protocols employ certificate-based cryptography and full trusted third party, which may not be suitable for wireless networks with limited resources such as power, computation and bandwidth. In this work, we propose an improved identity-based (or ID-based) signcryption & re-encryption scheme. Based on this scheme, we develop a novel certified e-mail protocol in the ID-based settings that employ an off-line semi-trusted third party (STTP) for wireless networks. By avoiding the complicated computation from the public key authentication in the certificate-based cryptography, the proposed scheme can simplify the management of the certification process and reduce communication cost in the system. Our detailed elaboration and analysis shows that the proposed approach is dynamic, lightweight and scalable.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"5 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":"129596663","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}
{"title":"A Parallel PCG Solver for Large-Scale Groundwater Flow Simulation Based on OpenMP","authors":"Dandan Li, Xiaohui Ji, Qun Wang","doi":"10.1109/PAAP.2011.45","DOIUrl":"https://doi.org/10.1109/PAAP.2011.45","url":null,"abstract":"Groundwater flow simulation has become one of the top international issues in new generation of environmental applications. When managing large-scale groundwater flow problems, the intensive computational ability and large amounts of memory space required for modeling are the main bottlenecks for researchers. In order to solve three-dimensional large-scale groundwater flow problems more rapidly, the Open MP was adopted to parallelize the preconditioned conjugate gradient (PCG) algorithm in this paper. And this paper carried out a numerical experiment of the three-dimensional groundwater flow model on a computer with four cores. Based on the numerical experiment, it is found that the execution time of the original serial PCG program is about 1.74 to 2.86 times of the parallel PCG program executed with different number of threads. The experimental results also demonstrate that the PCG solver based on Open MP is an effective way for solving large-scale three-dimensional groundwater flow problem.","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":"114814479","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}
{"title":"Parallel Efficiency and Parametric Optimization in CASTEP","authors":"Jun Chen, Liangjie Fu, Huaming Yang","doi":"10.1109/PAAP.2011.56","DOIUrl":"https://doi.org/10.1109/PAAP.2011.56","url":null,"abstract":"Parallel efficiency is always a fundamental research field in high performance computing. This paper focuses on parallel computing at high performance computing cluster with CASTEP program, discusses multi-core parallel efficiency in CASTEP, and analyses the influence of the main calculation parameters upon total CPU time and memory usage in case study, such as CPU cores(CPUs), cutoff energy, k-point, and supercell size. The paper also rationalizes and optimizes in detail the better use of limited computing resources under special circumstances.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"150 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":"134378942","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}
{"title":"Option Pricing on the GPU with Backward Stochastic Differential Equation","authors":"Ying Peng, Bin Gong, Hui Liu, Bin Dai","doi":"10.1109/PAAP.2011.12","DOIUrl":"https://doi.org/10.1109/PAAP.2011.12","url":null,"abstract":"In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each time step. Furthermore, for evaluating the affect of load balance to the performance, we provide two different acceleration strategies and compare them with running time experiments. The acceleration algorithms exhibit tremendous speedup over the sequential CPU implementation and therefore suitable for real-time application.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"56 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":"124814399","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}
{"title":"A Cross Heterogeneous Domain Authentication Model Based on PKI","authors":"Yao Yao, Xingwei Wang, Xiaoguang Sun","doi":"10.1109/PAAP.2011.74","DOIUrl":"https://doi.org/10.1109/PAAP.2011.74","url":null,"abstract":"This essay proposes a new cross heterogeneous domain authentication model mainly based on PKI, and designs the details of authentication processes in different situations. The model achieves cross domain authentication between PKI domain and Kerberos domain effectively, and supports mutual authentications. Theoretical analysis shows that the proposed scheme has good compatibility, expansibility and reliability. Therefore, this model is suitable for using in large-scale network environment mainly based on PKI.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"51 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":"125501856","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}
{"title":"Implementation of G.729A on Embedded SIMD Processor","authors":"Xiaoqiong Tan, R. Hu, Weiping Tu, H. Ai","doi":"10.1109/PAAP.2011.29","DOIUrl":"https://doi.org/10.1109/PAAP.2011.29","url":null,"abstract":"This paper addresses a real-time implementation of multi-channel, high quality G.729A speech codec based on an embedded SIMD processor, which is used in a SIP Video Phone. A series of strategies are designed for the special characteristics of the processor and the G.729A, including the memory management and SIMD decomposing. The profile shows that the dramatic improvement is achieved. Less than 20% CPU load ensures the video codec's smooth output of the video phone.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"33 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":"115753208","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}