Inicio  /  Algorithms  /  Vol: 15 Par: 1 (2022)  /  Artículo
ARTÍCULO
TITULO

Parallel Computing of Edwards?Anderson Model

Mikhail Alexandrovich Padalko    
Yuriy Andreevich Shevchenko    
Vitalii Yurievich Kapitan and Konstantin Valentinovich Nefedev    

Resumen

A scheme for parallel computation of the two-dimensional Edwards?Anderson model based on the transfer matrix approach is proposed. Free boundary conditions are considered. The method may find application in calculations related to spin glasses and in quantum simulators. Performance data are given. The scheme of parallelisation for various numbers of threads is tested. Application to a quantum computer simulator is considered in detail. In particular, a parallelisation scheme of work of quantum computer simulator.

 Artículos similares

       
 
Ming Chen, Kai Huang, Jian Wang, Wenzhi Liu and Yuanyuan Shi    
The reliability of urban transportation systems is crucial for ensuring smooth traffic flow and minimizing disruptions caused by external factors. This study focuses on improving the stability and efficiency of transportation systems through the calibrat... ver más
Revista: Applied Sciences

 
Zhixiang Liu, Yuanji Chen, Wenjun Xiao, Wei Song and Yu Li    
As an improved method of the lattice Boltzmann method (LBM), the regularized lattice Boltzmann method (RLBM) has been widely used to simulate fluid flow. For solving high Reynolds number problems, large eddy simulation (LES) and RLBM can be combined. The... ver más
Revista: Applied Sciences

 
Fernando Díaz-del-Río, Pablo Sanchez-Cuevas, María José Moron-Fernández, Daniel Cascado-Caballero, Helena Molina-Abril and Pedro Real    
Relating image contours and regions and their attributes according to connectivity based on incidence or adjacency is a crucial task in numerous applications in the fields of image processing, computer vision and pattern recognition. In this paper, the c... ver más
Revista: Algorithms

 
Dominic Windisch, Christian Kaever, Guido Juckeland and André Bieberle    
In this article, we introduce a parallel algorithm for connected-component analysis (CCA) on GPUs which drastically reduces the volume of data to transfer from GPU to the host. CCA algorithms targeting GPUs typically store the extracted features in array... ver más
Revista: Algorithms

 
Pavel V. Matrenin    
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige... ver más
Revista: Algorithms