检索结果-内蒙古大学图书馆

parallel algorithm for synthetic image generation with application to tokamak plasma diagnostics

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2022年第24期34卷 e7217-e7217页

作者： Delwadia, Kirtan Bhatt, Dhruvil Purohit, Shishir Chaudhury, Bhaskar DA IICT Grp Computat Sci & HPC Gandhinagar 382007 India Inst Plasma Res Gandhinagar India

The tomographic reconstruction is a powerful diagnostic tool in nuclear fusion experiments for the determination of the shape and position of the plasma. However, neural networks are emerging as a suitable alternative to conventional plasma tomography algorithms. In order to train such AI/ML based models, we need large-scale, diversified image data for learning and evaluation which is difficult to obtain from real experiments. Accuracy and real-time response is also critical, therefore in this article we propose an effective shared memory based parallel algorithm for synthetic imaging diagnostic data generation. The practicality of the proposed parallel algorithm has been evaluated experimentally by comparing it to the sequential algorithm on two different computing architectures. We observe a maximum speedup of 21 at 32 threads and demonstrate that our proposed parallel algorithm scales well over a range of image sizes. The proposed parallel algorithm can be used to obtain the synthetic images within a few seconds which is very important for real time applications. We also provide an analysis on the importance of choosing the right scheduling type and optimum chunk size to obtain the maximum speedup.

关键词： imaging diagnostics nuclear fusion parallel algorithm shared memory synthetic image tokamak

来源：评论

学校读者我要写书评

暂无评论

The parallel algorithm Implementation of Matrix Multiplication Based on ESCA

The Parallel Algorithm Implementation of Matrix Multiplicati...

引用

IEEE Asia Pacific Conference on Circuit and System (APCCAS)

作者： Chen, Pan Dai, Kui Wu, Dan Rao, Jinli Zou, Xuecheng Huazhong Univ Sci & Technol Dept Elect Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9781424474561

parallel computing is an important method used in high performance computing. A new SIMD architecture named ESCA (Engineering and Science Computing Accelerator) is introduced briefly in this paper. It aims to accelerate the computation for most critical scientific workload as a coprocessor by virtue of outstanding architecture and flexible parallel algorithm. As dense matrix multiplication is a widely used operation that can be accelerated by parallel computing, we maps its algorithm onto ESCA and estimates the performance, and the results imply that ESCA has some advantage and potentiality.

关键词： parallel algorithm Matrix Multiplication ESCA SIMD

来源：评论

学校读者我要写书评

暂无评论

A Permutation parallel algorithm under Exchange Restriction with Message Passing Interface

A Permutation Parallel Algorithm under Exchange Restriction ...

引用

3rd International Conference on Mathematical Sciences

作者： Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Univ Utara Malaysia Coll Arts & Sci Sch Quantitat Sci Sintok 06010 Kedah Malaysia

ISBN: (纸本)9780735412361

The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. The sequential algorithm is implemented to a parallel algorithm by integrating with Message Passing Interface (MPI) libraries by parallelizing the starter sets generation task. The speedup and efficiency is the indicator tool for analyzing performance of this parallel algorithm. The results show reduction time computation of parallel algorithm among processors.

关键词： starter sets exchange operation parallel algorithm Message Passing Interface

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for the Best k-mismatches Alignment Problem

A Parallel Algorithm for the Best <i>k</i>-mismatches Alignm...

引用

22nd Euromicro International Conference on parallel, Distributed, and Network-Based Processing (PDP)

作者： Del Fabbro, Cristian Tardivo, Fabio Policriti, Alberto Inst Appl Genom Udine Italy Univ Udine I-33100 Udine Italy

ISBN: (纸本)9781479927289

We propose a parallel algorithm that solves the best k-mismatches alignment problem against a genomic reference using the "one sequence/multiple processes" paradigm and distributed memory. Our proposal is designed to take advantage of a computing cluster using MPI (Message Passing Interface) for communication. Our solution distributes the reference among different nodes and each sequence is processed concurrently by different nodes. When a (putative) best solution is found, the successful process propagates the information to other nodes, reducing search space and saving computation time. The distributed algorithm was developed in C++ and optimized for the PLX and FERMI supercomputers, but it is compatible with every OpenMPI-based cluster. It was included in the ERNE (Extended Randomized Numerical alignEr) package, whose aim is to provide an all-inclusive set of tools for short reads alignment and cleaning. ERNE is free software, distributed under the Open Source License (GPL V3) and can be downloaded at: http://***. The algorithm described in this work is implemented in the ERNE-PMAP and ERNE-PBS5 programs, the former designed to align DNA and RNA sequences, while the latter is optimized for bisulphite-treated sequences.

关键词： C++ language DNA RNA application program interfaces bioinformatics distributed memory systems message passing parallel algorithms public domain software software packages C++ programming DNA sequence alignment ERNE-PBS5 programs ERNE-PMAP programs Extended Randomized Numerical aligner package FERMI supercomputers GPL V3 MPI OpenMPI-based cluster PLX supercomputers RNA sequence alignment best k-mismatches alignment problem bisulphite-treated sequences computation time computing cluster distributed algorithm distributed memory free software message passing interface one sequence-multiple processes paradigm open source license parallel algorithm search space reduction Bioinformatics Clustering algorithms DNA Genomics Next generation networking Sequential analysis Software bs-seq erne mpi parallel sequence alignment

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm with the Search Space Partition for the Pickup and Delivery with Time Windows 10

A Parallel Algorithm with the Search Space Partition for the...

引用

10th International Conference on P2P, parallel, Grid, Cloud and Internet Computing 3PGCIC

作者： Nalepa, Jakub Blocho, Miroslaw Silesian Tech Univ Akad 16 PL-44100 Gliwice Poland ABB IT PL-04713 Warsaw Poland

ISBN: (纸本)9781467394734

The pickup and delivery problem with time windows (PDPTW) is an NP-hard optimization problem of serving transportation requests using a limited number of vehicles. Its main objective is to minimize the number of delivering trucks, whereas the secondary objective is to decrease the distance traveled during the service. A feasible routing schedule must satisfy the time window, capacity and precedence constraints. In this paper, we propose to partition the search space in our parallel guided ejection search algorithm (P-GES) to minimize the fleet size in the PDPTW. The introduced techniques help decrease the convergence time of the algorithm without affecting the quality of results. An extensive experimental study (comprising nearly 52, 000 CPU hours on an SMP cluster) performed on the Li and Lim's benchmark set shows that the parallel algorithm is effective, and is able to retrieve very high-quality results. We report 10 new world's best solutions obtained using P-GES enhanced with the proposed search space partition approaches.

关键词： parallel algorithm co-operation scheme search space partition guided ejection PDPTW

来源：评论

学校读者我要写书评

暂无评论

A Sample Average Approximation-Based parallel algorithm for Application Placement in Edge Computing Systems

A Sample Average Approximation-Based Parallel Algorithm for ...

引用

IEEE International Conference on Cloud Engineering (IEEE IC2E)

作者： Badri, Hossein Bahreini, Tayebeh Grosu, Daniel Yang, Kai Wayne State Univ Dept Ind & Syst Engn Detroit MI 48202 USA Wayne State Univ Dept Comp Sci Detroit MI USA

ISBN: (纸本)9781538650080

Mobile Edge Computing (MEC) is a new paradigm that aims at decreasing the response time of running mobile applications by offloading the component of the applications on the servers located at the edge of the network instead of on the cloud servers. In this paper, we address a very important problem in the management of MEC systems, that is, the problem of finding an efficient application placement on the edge servers such that the cost of execution is minimized. We develop a multi-stage stochastic programming model for the application placement problem in edge computing systems and design a novel parallel greedy algorithm based on the Sample Average Approximation method to solve it. We evaluate the performance of the proposed algorithm by conducting extensive experimental analysis using data extracted from a real-world dataset. The experimental results show that the proposed algorithm can solve the problem efficiently.

关键词： Mobile edge computing multi-stage stochastic programming sample average approximation parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical parallel algorithm for Modularity-Based Community Detection Using GPUs

Hierarchical Parallel Algorithm for Modularity-Based Communi...

引用

19th International Conference on Euro-Par

作者： Cheong, Chun Yew Huynh, Huynh Phung Lo, David Goh, Rick Siow Mong Inst High Performance Comp A STAR Singapore Singapore Singapore Management Univ Singapore Singapore

ISBN: (纸本)9783642400476

This paper describes the design of a hierarchical parallel algorithm for accelerating community detection which involves partitioning a network into communities of densely connected nodes. The algorithm is based on the Louvain method developed at the Universite Catholique de Louvain, which uses modularity to measure community quality and has been successfully applied on many different types of networks. The proposed hierarchical parallel algorithm targets three levels of parallelism in the Louvain method and it has been implemented on single-GPU and multi-GPU architectures. Benchmarking results on several large web-based networks and popular social networks show that on top of offering speedups of up to 5x, the single-GPU version is able to find better quality communities. On average, the multi-GPU version provides an additional 2x speedup over the single-GPU version but with a 3% degradation in community quality.

关键词： Community detection parallel algorithm GPU social networks

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm of non-linear high-order boundary condition problem for hydrodynamics

A parallel algorithm of non-linear high-order boundary condi...

引用

11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Zhang Haoyue Shesheng Zhang Liu Chao Chen Xing Wang Weicang Wuhan Univ Technol Wuhan 430070 Peoples R China

ISBN: (纸本)9780769548180

A parallel algorithm of non-linear high order boundary condition problem is discussed, and super-cavitation hydrofoil with finite span near free surface is given. by using non-linear initial boundary two dimension condition and three dimension lifting line theories, the numeric results of a flat plate hydrofoil are better than that of Furuya.

关键词： boundary condition problem hydrofoil parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for Solving Block-diagonal Structured Large Linear System

引用

Journal of Systems Science and Systems Engineering 2001年第2期13卷 191-196页

作者： SHEN Jie, ZHANG Zhong-lin, CHENG Ji-lin Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009, China Department of Computer Science and Engineering Yangzhou UniversityYangzhou 225009 China

A parallel algorithm for solving block-diagonal structured large linear system is presented. This algorithm is based on the ″gradient-simplex″ method. It partitions a large linear system into several small linear subsystems so that they can be solved in parallel. The algorithm has the merit of high speed and is suitable for the large linear systems with less coupling constrains. The efficiency and applicability of the method is also analyzed.

关键词： linear system parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for solution to tridiagonal systems of linear equations

Journal of the Institution of Engineers (India), Part CP: Co...

引用

Journal of the Institution of Engineers (India), Part CP: Computer Engineering Division 1999年第2期80卷 38-41页

作者： Saxena, P.C. Kahlon, K.S. Sch. of Computers and Syst. Sciences Jawaharlal Nehru University New Delhi India Dept. of Comp. Sci. and Engineering Gurunanak Dev University Amritsar India

A parallel algorithm for the solution of tridiagnol system equation proposed in this paper is an integration of partition method and odd-even reduction method. Both efficiency and speedup of the algorithm is presented. The algorithm gives better speedups when implemented on larger systems with communication cost of O (log2p). Mapping the equations to processor can optimize the communication cost of the above algorithm on hypercube computers by gray-coding. The dilation of the mapping is, however, two, meaning a message generally travels the distance two between two communicating processors.

关键词： Dilation Gray-coding Hypercube architecture parallel algorithm Partition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：