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

multi-spin coding of the Monte Carlo simulation of the three-state random potts model and the block-spin transformation

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C-PHYSICS AND COMPUTERS 1995年第6期6卷 747-763页

作者： Kikuchi, M Okabe, Y TOKYO METROPOLITAN UNIV DEPT PHYSHACHIOJITOKYO 19203JAPAN

The multi-spin coding of the Monte Carlo simulation of the three-state Potts model on the simple cubic lattice is presented. The ferromagnetic (F) model, the antiferromagnetic (AF) model, and the random mixture of the F and AF couplings are treated. The multispin coding technique is also applied to the block-spin transformation. The block-spin transformation of the F Potts model is simply realized by the majority rule, whereas the AF three-state Potts model is transformed to the block spin having a six-fold symmetry.

关键词： multi-spin coding Potts model block-spin transformation

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT multi-spin coding ALGORITHM FOR NEURAL NETWORKS

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 1991年第2期2卷 623-636页

作者： Neschen, Martin Univ Cologne Inst Theoret Phys D-5000 Cologne 41 Germany

A new method for large-scale numerical simulations of neural networks is proposed which reduces the computational effort by incrementally updating the local fields and thus restricting the operations to flipped spins only. A highly optimized multi-spin algorithm is described employing words oriented along the columns of the coupling matrix unlike the horizontal structure in existing high-speed algorithms. An effective rate of 35+109 couplings/s on a Cray-YMP can be attained which is about five times as fast as best existing multi-spin implementations.

关键词： Neural Networks multi-spin coding Computer Algorithms Large-Scale Simulations

来源：评论

学校读者我要写书评

暂无评论

VECTORIZED multiSITE coding FOR HYDRODYNAMIC CELLULAR AUTOMATA

引用

JOURNAL OF STATISTICAL PHYSICS 1989年第1-2期57卷 399-403页

作者： BROSA, U STAUFFER, D 1.HLRZ c/o KFA Julich 5170 Julich 1 West Germany

Simulating eight lattices for Pomeau's cellular automata simultaneously through bit-per-bit operations, a vectorized Fortran program reached 30 million updates per second and per Cray YMP processor. We give the fu... 详细信息

关键词： multi-spin coding vector computer hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated population annealing algorithm

引用

COMPUTER PHYSICS COMMUNICATIONS 2017年 220卷 341-350页

作者： Barash, Lev Yu. Weigel, Martin Borovsky, Michal Janke, Wolfhard Shchur, Lev N. Landau Inst Theoret Phys Chernogolovka 142432 Russia Sci Ctr Chernogolovka Chernogolovka 142432 Russia Coventry Univ Appl Math Res Ctr Coventry CV1 5FB W Midlands England Safarik Univ Pk Angelinum 9 Kosice 04001 Slovakia Univ Leipzig Inst Theoret Phys Postfach 100920 D-04009 Leipzig Germany Natl Res Univ Higher Sch Econ Moscow 101000 Russia

Population annealing is a promising recent approach for Monte Carlo simulations in statistical physics, in particular for the simulation of systems with complex free-energy landscapes. It is a hybrid method, combining importance sampling through Markov chains with elements of sequential Monte Carlo in the form of population control. While it appears to provide algorithmic capabilities for the simulation of such systems that are roughly comparable to those of more established approaches such as parallel tempering, it is intrinsically much more suitable for massively parallel computing. Here, we tap into this structural advantage and present a highly optimized implementation of the population annealing algorithm on GPUs that promises speed-ups of several orders of magnitude as compared to a serial implementation on CPUs. While the sample code is for simulations of the 2D ferromagnetic Ising model, it should be easily adapted for simulations of other spin models, including disordered systems. Our code includes implementations of some advanced algorithmic features that have only recently been suggested, namely the automatic adaptation of temperature steps and a multi-histogram analysis of the data at different temperatures. Program summary Program Title: PAIsing Program Files doi: http://***/10.17632/sgzt4b7b3m.1 Licensing provisions: Creative Commons Attribution license (CC BY 4.0) Programming language: C, CUDA External routines/libraries: NVIDIA CUDA Toolkit 6.5 or newer Nature of problem: The program calculates the internal energy, specific heat, several magnetization moments, entropy and free energy of the 2D Ising model on square lattices of edge length L with periodic boundary conditions as a function of inverse temperature beta. Solution method: The code uses population annealing, a hybrid method combining Markov chain updates with population control. The code is implemented for NVIDIA GPUs using the CUDA language and employs advanced techniques such as mu

关键词： Population annealing Monte Carlo simulations Ising model Parallel computing Graphics processing units multi-spin coding

来源：评论

学校读者我要写书评

暂无评论

FAST VECTORIZED ALGORITHM FOR THE MONTE-CARLO SIMULATION OF THE RANDOM FIELD ISING-MODEL

引用

JOURNAL OF STATISTICAL PHYSICS 1993年第3-4期70卷 1063-1073页

作者： RIEGER, H FORSCHUNGSZENTRUM JULICH HLRZ W-5170 JULICH 1 GERMANY

An algorithm for the simulation of the 3-dimensional random field Ising model with a binary distribution of the random fields is presented. It uses multi-spin coding and simulates 64 physically different systems simultaneously. On one processor of a Cray YMP it reaches a speed of 184 million spin updates per second. For smaller field strength we present a version of the algorithm that can perform 242 million spin updates per second on the same machine.

关键词： MONTE-CARLO SIMULATION multi-spin coding RANDOM FIELD ISING MODEL

来源：评论

学校读者我要写书评

暂无评论

FINITE-STATE NEURAL NETWORKS - A STEP TOWARD THE SIMULATION OF VERY LARGE SYSTEMS

引用

JOURNAL OF STATISTICAL PHYSICS 1991年第3-4期62卷 563-576页

作者： KOHRING, GA 1. H?chstleistungsrechenzentrum an der KFA Jülich D-5170 Jülich Germany

Neural networks composed of neurons with Q(N) states and synapses with Q(J) states are studied analytically and numerically. Analytically it is shown that these finite-state networks are much more efficient at information storage than networks with continuous synapses. In order to take the utmost advantage of networks with finite-state elements, a multineuron and multisynapse coding scheme is introduced which allows the simulation of networks having 1.0 x 10(9) couplings at a speed of 7.1 x 10(9) coupling evaluations per second on a single processor of the Cray-YMP. A local learning algorithm is also introduced which allows for the efficient training of large networks with finite-state elements.

关键词： NEURAL NETWORKS multi-spin coding REPLICA METHOD FINITE-STATE NETWORKS LEARNING ALGORITHMS

来源：评论

学校读者我要写书评

暂无评论

PARALLELIZATION OF SHORT- AND LONG-RANGE CELLULAR AUTOMATA ON SCALAR, VECTOR, SIMD AND MIMD MACHINES

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 1991年第3期2卷 755-772页

作者： Kohring, G. A. Univ Cologne Inst Theoret Phys D-5000 Cologne 41 Germany Forschungszentrum Julich HLRZ D-5170 Julich Germany

Algorithms exhibiting parallelization on many different levels are discussed for short- and long-range cellular automata implemented on scalar, vector, SIMD and MIMD machines. Short range cellular automata are commonly used for simulating hydrodynamic fluid flows, while long range cellular automata are applicable to neural networks at zero temperature. A common programming approach based upon multi-spin coding and including higher levels of parallelization when possible, has been used to implement these models on the SUN SPARC-1, the IBM-3090, the Alliant FX/2800, the NEC-SX3/11, the Cray-YMP/832 and the Connection Machine, CM-2. Section 4 of the paper compares the performance of these computers for the algorithms discussed in the text. Additionally, the major subroutines for each computer type are given in the Appendix.

关键词： Parallel Programming multi-spin coding Supercomputing Cellular Automata Hydrodynamics Neural Networks

来源：评论

学校读者我要写书评

暂无评论

ALGORITHMS FOR MONTE-CARLO SIMULATIONS OF THE ISING-MODELS ON A SIMPLE CUBIC LATTICE

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C-PHYSICS AND COMPUTERS 1993年第3期4卷 525-537页

作者： KAWASHIMA, N ITO, N KANADA, Y UNIV TOKYO FAC SCIDEPT PHYSTOKYO 113JAPAN JAPAN ATOM ENERGY RES INST CTR COMP & INFORMAT SYSTTOKAIIBARAKI 31911JAPAN UNIV TOKYO CTR COMPTOKYO 113JAPAN

The vectorized Monte Carlo algorithm by multi-spin coding is extended to the +/-J Ising spin glass model on a simple cubic lattice in a magnetic field. Explicit logical expression is given for this algorithm. In addition, shorter logical expressions are found in some special cases. They are given for the heat-bath method under the general condition and for the Metropolis method under the condition, H = 0.

关键词： spin GLASS MONTE-CARLO SIMULATION multi-spin coding ISING MODEL

来源：评论

学校读者我要写书评

暂无评论

Parallelization and implementation of multi-spin Monte Carlo simulation of 2D square Ising model using MPI and C plus

引用

JOURNAL OF THEORETICAL AND APPLIED PHYSICS 2018年第3期12卷 199-208页

作者： Hassani, Dariush Rafibakhsh, Shahnoosh Islamic Azad Univ Sci & Res Branch Dept Phys Tehran Iran

In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every process creates a sub-lattice and the energy is calculated after each Monte Carlo iteration. Each process communicates with its two neighbor processes during the job, and they exchange the boundary spin variables. Finally, the total energy of lattice is calculated by map-reduce method versus the temperature. We use multi-spin coding technique to reduce the inter-process communications. This algorithm has been designed in a way that an appropriate load-balancing and good scalability exist. It has been executed on the cluster computer of Plasma Physics Research Center which includes 9 nodes and each node consists of two quad-core CPUs. Our results show that this algorithm is more efficient for large lattices and more iterations.

关键词： Ising model Monte Carlo method multi-spin coding MPI

来源：评论

学校读者我要写书评

暂无评论

PAIR INTERACTION LATTICE GAS ON GENERAL PURPOSE COMPUTERS: FORTRAN OR C?

引用

International Journal of Modern Physics C 1992年第6期3卷 1179-1187页

作者： DIETER WOLF-GLADROW ARMIN VOGELER Alfred Wegener Institute for Polar and Marine Research D-2850 Bremerhaven F R Germany

We report on performance tests of pair interaction lattice gas automata in two and three dimensions coded in FORTRAN and C. The programs have been run on ALLIANT/FX-80, ALLIANT/FX-2800, CONVEX C2, CRAY-YMP, NEC/SX3, and SUN/IPC. The maximum update rates are 200 million site updates per second on the NEC/SX3 (FORTRAN), 117 (2D version) and 29 (3D version) on the CRAY-YMP (C). As a byproduct we give results for the performance of integer arithmetic and bit operations. Usually the C-programs were somewhat faster than the FORTRAN-programs except on the NEC/SX3 where the C-compiler was not able to vectorize the main loops.

关键词： Cellular Automata Hydrodynamics multi-spin coding Parallel Program-ming FORTRAN C

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：