Distributed-memory parallelization of the Wigner Monte Carlo method using spatial domain decomposition

被引:19
|
作者
Ellinghaus, Paul [1 ]
Weinbub, Josef [1 ]
Nedjalkov, Mihail [1 ]
Selberherr, Siegfried [1 ]
Dimov, Ivan [2 ]
机构
[1] TU Wien, Inst Microelect, Vienna, Austria
[2] Bulgarian Acad Sci, IICT, Sofia, Bulgaria
基金
奥地利科学基金会;
关键词
Wigner; Monte Carlo; Message passing interface; Domain decomposition; Parallel; Memory-distributed; TRANSPORT;
D O I
10.1007/s10825-014-0635-3
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The Wigner Monte Carlo method, based on the generation and annihilation of particles, has emerged as a promising approach to treat transient problems of quantum electron transport in nanostructures. Tackling these simulations in multiple spatial dimensions demands a parallelized approach to facilitate a practical application of the method in order to investigate realistic problems, due to the otherwise exorbitant execution-times and memory requirements. Because of the annihilation step, a straight-forward parallelization of the Wigner Monte Carlo code is not possible, since sub-ensembles of particles can not be treated independently. Moreover, the large memory requirements of the annihilation procedure presents challenges when working in a distributed-memory setting. A solution to this problem is presented here with a parallelization approach using a spatial domain decomposition, implemented using the message passing interface. The presented benchmark results, based on standard one-dimensional examples, exhibit a good efficiency in the scalability of not only speed, but also memory consumption, which is paramount for the simulation of realistic devices.
引用
收藏
页码:151 / 162
页数:12
相关论文
共 50 条
  • [31] A distributed-memory parallel lattice Kinetic Monte Carlo algorithm for crystal growth applied to barite (001) face
    Abujas-Pereira, Jeronimo
    Martin-Bragado, Ignacio
    Pina, Carlos M.
    Pizarro, Joaquin
    Galindo, Pedro L.
    CRYSTAL RESEARCH AND TECHNOLOGY, 2016, 51 (10) : 575 - 585
  • [32] On the Wigner Monte Carlo method coupled to pseudopotential models
    Sellier, J. M.
    Sviercoski, R. F.
    Dimov, I.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2016, 293 : 217 - 222
  • [33] Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition
    Bharadwaj, Vivek
    Malik, Osman Asif
    Murray, Riley
    Buluc, Aydin
    Demmel, James
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 155 - 168
  • [34] A scalable strategy for the parallelization of multiphysics unstructured mesh iterative codes on distributed-memory systems
    McManus, K
    Cross, M
    Walshaw, C
    Johnson, S
    Leggett, P
    INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2000, 14 (02): : 137 - 174
  • [35] On Monte Carlo Methods in Distributed Memory Systems
    Ermakov, S. M.
    Trosinenko, A. V.
    VESTNIK ST PETERSBURG UNIVERSITY-MATHEMATICS, 2016, 49 (04) : 325 - 333
  • [36] A Wigner Potential Decomposition in the Signed-Particle Monte Carlo Approach
    Benam, Majid
    Nedjalkov, Mihail
    Selberherr, Siegfried
    NUMERICAL METHODS AND APPLICATIONS, NMA 2018, 2019, 11189 : 263 - 272
  • [37] PPB-MCTS: A novel distributed-memory parallel partial-backpropagation Monte Carlo tree search algorithm
    Naderzadeh, Yashar
    Grosu, Daniel
    Chinnam, Ratna Babu
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 193
  • [38] Distributed computing by the Monte Carlo method
    M. A. Marchenko
    G. A. Mikhailov
    Automation and Remote Control, 2007, 68 : 888 - 900
  • [39] Distributed computing by the Monte Carlo method
    Marchenko, M. A.
    Mikhailov, G. A.
    AUTOMATION AND REMOTE CONTROL, 2007, 68 (05) : 888 - 900
  • [40] Stochastic Gradient Descent for matrix completion: Hybrid parallelization on shared- and distributed-memory systems
    Buyukkaya, Kemal
    Karsavuran, M. Ozan
    Aykanat, Cevdet
    KNOWLEDGE-BASED SYSTEMS, 2024, 283