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

37th Annual European Simulation and Modelling Conference (ESM)

作者： Hoser, Pawel Kubica, Bartlomiej Ochnio, Luiza Warsaw Univ Life Sci SGGW Nowoursynowska 153 Warsaw Poland

ISBN: (纸本)9789492859280

A dynamical system is a frequently used mathematical model used to describe moving phenomena in nature. These types of dynamical systems are usually defined by special systems of differential equations. Computer simulations based on such models require solving these equations, and various numerical methods are often used for this purpose. Computer simulations of many dynamical natural phenomena have the property that the calculations can be parallelized very well. Parallel computing significantly speeds up calculation processes. The use of parallel algorithms for such purpose, involves the need to synchronize the threads of the process. The lack of synchronization can result in inaccurate or even erronous results of the calculation. On the other hand, the synchronization can significantly slow down computational processes. In addition, numerical methods are imprecise anyway, and the mathematical model itself describes the natural phenomenon only to a certain extent. So, the idea arose to synchronize threads not in each step of the algorithm. There is also the problem of optimizing the frequency of using synchronization. In the paper, this issue has been investigated on several examples of simulations. The results confirm that full synchronization control is often not necessary.

关键词： multi-threaded programming Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

An extension to VORO plus plus for multithreaded computation of Voronoi cells

引用

COMPUTER PHYSICS COMMUNICATIONS 2023年第1期291卷

作者： Lu, Jiayin Lazar, Emanuel A. Rycroft, Chris H. Harvard Univ John A Paulson Sch Engn & Appl Sci Cambridge MA 02138 USA Univ Wisconsin Dept Math Madison WI 53711 USA Bar Ilan Univ Dept Math IL-5290002 Ramat Gan Israel Lawrence Berkeley Lab Computat Res Div Berkeley CA 94720 USA

VORO++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. VORO++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. The multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million *** summaryProgram title: VORO++CPC Library link to program files: https://doi .org /10 .17632 /tddc4w4zkk.1Developer's repository link: https://github .com /chr1shr /voro Licensing provisions: BSD 3-clause (with LBNL modification) programming language: C++External routines/libraries: OpenMPNature of problem: multithreaded computation of the Voronoi tessellation in two and three dimensions Solution method: The VORO++ library is built around several C++ classes that can be incorporated into other programs. The two largest components are the container... classes that spatially sort input particles into a grid-based data structure, allowing for efficient searches of nearby particles, and the voronoicell... classes that represent a single Voronoi cell as an arbitrary convex polygon or polyhedron. The Voronoi cell for each particle is built by considering a sequence of plane cuts based on neighboring particles, after which many different statistics (e.g. volume, centroid, number of vertices) can be computed. Since each Voronoi cell is calculated individually, the Voronoi cells can be computed u

关键词： Voronoi tessellation Computational geometry multi-threaded programming

来源：评论

学校读者我要写书评

暂无评论

A multi-threaded programming Strategy for Parallel Weather Forecast Model Using C#

A Multi-Threaded Programming Strategy for Parallel Weather F...

引用

2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC)

作者： Barbhuiya, Saki Liang, Ying Univ West Scotland Sch Comp Paisley Renfrew Scotland

ISBN: (纸本)9781467329255;9781467329224

It is seen that Weather Forecast Models (WFMs) are often implemented using the sequential programs. This usually takes longer execution time, larger computer resources and more power as WFMs involve high level computational tasks to process large amount of weather forecast data. These become problems for the weather forecast companies in terms of WFM performance. The companies have already tried to use the multi-core systems to overcome these, but it does not work always because of the poor selection and implementation of programming strategies. By addressing these problems, a research project has been conducted as a case study for the weather production company named Weather2 Ltd. The case study attempted multi-threaded programming based on the multi-core systems as a different implementation strategy for Weather2's WFM as solution to their problems in using sequential programs. The results of the case study showed that this new strategy could improve the performance of WFM significantly by reducing the execution time, using less computer resources and power. This paper presents the case study and its results.

关键词： multi-threaded programming weather forcast model multi-core system parallel computing

来源：评论

学校读者我要写书评

暂无评论

Parallel multi-View Graph Matrix Completion for Large Input Matrix 9

Parallel Multi-View Graph Matrix Completion for Large Input ...

引用

9th IEEE Annual Computing and Communication Workshop and Conference (CCWC)

作者： Koohi, Arezou Homayoun, Houman George Mason Univ Elect & Comp Engn Fairfax VA 22030 USA

ISBN: (纸本)9781728105543

We propose a method for parallel multi-view graph matrix completion for the prediction of ratings in recommender systems. The missing ratings are computed based on both the similarity matrix in addition to a rating matrix. The rating matrix is sparse and some items might not have any rating information available. The similarity matrix can be calculated from different item attributes available from ecommerce websites. As the input matrix becomes large, the need for more computationally efficient matrix completion increases. The main contribution of this paper is to show speed-up in calculating the missing ratings by using multi-threaded programming. Simulation results are based on the large input matrix and show reduction in RMSE for the case of cold start prediction.

关键词： recommender systems multi-view graph multi-threaded programming parallel computing matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Real-time dynamic measurement of geometric parameters of catenary

Real-time dynamic measurement of geometric parameters of cat...

引用

Annual Conference of the Chinese-Society-of-Optical-Engineering (CSOE) on Optical Sensing and Imaging Technology (AOPC)

作者： Meng, Fanchang Zhang, Zili Hao, Can Deng, Jia Zhou, Weihu Chinese Acad Sci Inst Microelect Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Beijing Informat Sci & Technol Univ Beijing Peoples R China

ISBN: (数字)9781510634497

ISBN: (纸本)9781510634497

Catenary is an important part of electrified railway, and its geometric parameters are important parameters reflecting the safe and stable operation of locomotives. With the improvement of its speed, there are higher requirements for high-accuracy and real-time detection of geometric parameters of catenary. The existing systems have problems of long sampling interval, low real-time performance, and light-sensitive. Aiming at the actual requirement of dynamic measurement of catenary geometric parameters, a non-contact catenary geometric parameter detection system based on machine vision was developed. Firstly, a measurement model based on high-power line lasers and high-resolution area cameras was established to meet the application requirements. The measurement principle of the system was analyzed and the detailed formulas were deduced. Secondly, image difference, laser spot roundness analysis and other image processing algorithms were used to quickly and accurately detect the characteristics of laser points on the contact line with complex background. Based on the measurement model and algorithms mentioned above, the hardware and software platform of the system were built, and fast image acquisition and processing was realized by using multi-thread programming technology on high-performance industrial computer, which solved the problems of long sampling interval and low real-time performance during the measurement. Real-time image storage and display and preservation of detection results were realized in the software. Finally, a preliminary experiment was performed on the prototype, and the accuracy of the measurement results was analyzed. Experiment results showed that the system works stably and has high accuracy, which meets the practical application requirements.

关键词： Catenary geometric parameters machine vision Roundness analysis multi-threaded programming real-time processing

来源：评论

学校读者我要写书评

暂无评论

Concurrency Strategies for Attack Graph Generation 2

Concurrency Strategies for Attack Graph Generation

引用

2nd International Conference on Data Intelligence and Security (ICDIS)

作者： Li, Ming Hawrylak, Peter J. Hale, John Univ Tulsa Tandy Sch Comp Sci Tulsa OK 74104 USA

ISBN: (纸本)9781728120805

The network attack graph is a powerful tool for analyzing network security, but the generation of a large-scale graph is non-trivial. The main challenge is from the explosion of network state space, which greatly increases time and storage costs. In this paper, three parallel algorithms are proposed to generate scalable attack graphs. An OpenMP-based programming implementation is used to test their performance. Compared with the serial algorithm, the best performance from the proposed algorithms provides a 10X speedup.

关键词： Network Security Attack Graph multi-threaded programming OpenMP

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of the Components of the Symmetric Cryptographic Algorithm 2

Design and Implementation of the Components of the Symmetric...

引用

2nd IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Ci, Yunfei Shi, Guozhen Yang, Feng Diao, Jiawen Liu, Cuijie Mao, Weihua Beijing Elect Sci & Technol Inst Sch Informat Secur Beijing Peoples R China

ISBN: (纸本)9781538616000

Cryptographic technology is the basic and core technology to guarantee network and information security. It is imperative to standardize cryptographic algorithms. Cryptographic algorithm test is the most important research content of cryptographic normalization. Symmetric cryptographic algorithms are the most widely studied and applied. So it has the practical value to normalize the symmetric cryptographic algorithm. Symmetric cryptographic algorithm test tool is the most important design of the test method components. The test method components of this paper mainly include 20 kinds of random test methods. In order to shorten the test time and improve the efficiency of the test, the random test method of the component is also realized by multi-thread programming. The experiment verifies that the test tool can obtain the correct test result and can improve the flexibility of the test method.

关键词： cryptographic algorithm test component randomness test method multi-threaded programming test efficiency flexibility

来源：评论

学校读者我要写书评

暂无评论

Finite element numerical integration for first order approximations on multi- and many-core architectures

引用

COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING 2016年 305卷 827-848页

作者： Banas, Krzysztof Kruzel, Filip Bielanski, Jan AGH Univ Sci & Technol Dept Appl Comp Sci & Modelling Mickiewicza 30 PL-30059 Krakow Poland Cracow Univ Technol Inst Comp Sci Warszawska 24 PL-31155 Krakow Poland

The paper presents investigations on the performance of the finite element numerical integration algorithm for first order approximations and three processor architectures, popular in scientific computing, classical x86_64 CPU, Intel Xeon Phi and NVIDIA Kepler GPU. We base the discussion on theoretical performance models and our own implementations for which we perform a range of computational experiments. For the latter, we consider a unifying programming model and portable OpenCL implementation for all architectures. Variations of the algorithm due to different problems solved and different element types are investigated and several optimizations aimed at proper optimization and mapping of the algorithm to computer architectures are demonstrated. The experimental results show the varying levels of performance for different architectures, but indicate that the algorithm can be effectively ported to all of them. The conclusions indicate the factors that limit the performance for different problems and types of approximation and the performance ranges that can be expected for FEM numerical integration on different processor architectures. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Finite element method First order approximation Numerical integration multi-threaded programming multi-core processors Graphics processors

来源：评论

学校读者我要写书评

暂无评论

From verified model to executable program: the PAT approach

引用

INNOVATIONS IN SYSTEMS AND SOFTWARE ENGINEERING 2016年第1期12卷 1-26页

作者： Zhu, Huiquan Sun, Jing Dong, Jin Song Lin, Shang-Wei Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore Univ Auckland Dept Comp Sci Auckland 1 New Zealand Nanyang Technol Univ Sch Comp Engn 50 Nanyang Ave Singapore 639798 Singapore

CSP# is a formal modeling language that emphasizes the design of communication in concurrent systems. PAT framework provides a model checking environment for the simulation and verification of CSP# models. Although the desired properties can be formally verified at the design level, it is not always straightforward to ensure the correctness of the system's implementation conforms to the behaviors of the formal design model. To avoid human error and enhance productivity, it would be beneficial to have a tool support to automatically generate the executable programs from their corresponding formal models. In this paper, we propose such a solution for translating verified CSP# models into C# programs in the PAT framework. We encoded the CSP# operators in a C# library-"***", where the event synchronization is based on the "Monitor" class in C#. The precondition and choice layers are built on top of the CSP event synchronization to support language-specific features. We further developed a code generation tool to automatically transform CSP# models into multi-threaded C# programs. We proved that the generated C# program and original CSP# model are equivalent on the trace semantics. This equivalence guarantees that the verified properties of the CSP# models are preserved in the generated C# programs. Furthermore, based on the existing implementation of choice operator, we improved the synchronization mechanism by pruning the unnecessary communications among the choice operators. The experiment results showed that the improved mechanism notably outperforms the standard JCSP library.

关键词： Modeling checking CSP# multi-threaded programming C#

来源：评论

学校读者我要写书评

暂无评论

Scalable Data-Driven PageRank: Algorithms, System Issues, and Lessons Learned 21st

Scalable Data-Driven PageRank: Algorithms, System Issues, an...

引用

21st International Conference on Parallel and Distributed Computing (Euro-Par)

作者： Whang, Joyce Jiyoung Lenharth, Andrew Dhillon, Inderjit S. Pingali, Keshav Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9783662480960;9783662480953

Large-scale network and graph analysis has received considerable attention recently. Graph mining techniques often involve an iterative algorithm, which can be implemented in a variety of ways. Using PageRank as a model problem, we look at three algorithm design axes: work activation, data access pattern, and scheduling. We investigate the impact of different algorithm design choices. Using these design axes, we design and test a variety of PageRank implementations finding that data-driven, push-based algorithms are able to achieve more than 28x the performance of standard PageRank implementations (e.g., those in GraphLab). The design choices affect both single-threaded performance as well as parallel scalability. The implementation lessons not only guide efficient implementations of many graph mining algorithms, but also provide a framework for designing new scalable algorithms.

关键词： Scalable computing Graph analytics PageRank multi-threaded programming Data-driven algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：