mpdcm: A toolbox for massively parallel dynamic causal modeling

被引:23
|
作者
Aponte, Eduardo A. [1 ,2 ]
Raman, Sudhir [1 ,2 ]
Sengupta, Biswa [3 ]
Penny, Will D. [3 ]
Stephan, Klaas E. [1 ,2 ,3 ,4 ]
Heinzle, Jakob [1 ,2 ]
机构
[1] Univ Zurich, Inst Biomed Engn, TNU, CH-8032 Zurich, Switzerland
[2] Swiss Fed Inst Technol, CH-8032 Zurich, Switzerland
[3] UCL, Wellcome Trust Ctr Neuroimaging, London WC1N 3BG, England
[4] Max Planck Inst Metab Res, D-50931 Cologne, Germany
基金
英国工程与自然科学研究理事会; 英国惠康基金;
关键词
Dynamic causal modeling; GPU; Markov chain Monte Carlo; Thermodynamic integration; Parallel tempering; Model inversion; Model evidence; Bayesian model comparison; MONTE-CARLO; GPU; COMPUTATION; SYSTEMS; BRIDGE;
D O I
10.1016/j.jneumeth.2015.09.009
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Dynamic causal modeling (DCM) for fMRI is an established method for Bayesian system identification and inference on effective brain connectivity. DCM relies on a biophysical model that links hidden neuronal activity to measurable BOLD signals. Currently, biophysical simulations from DCM constitute a serious computational hindrance. Here, we present Massively Parallel Dynamic Causal Modeling (mpdcm), a toolbox designed to address this bottleneck. New method: mpdcm delegates the generation of simulations from DCM's biophysical model to graphical processing units (GPUs). Simulations are generated in parallel by implementing a low storage explicit Runge Kutta's scheme on a GPU architecture. mpdcm is publicly available under the GPLv3 license. Results: We found that mpdcm efficiently generates large number of simulations without compromising their accuracy. As applications of mpdcm, we suggest two computationally expensive sampling algorithms: thermodynamic integration and parallel tempering. Comparison with existing method(s): mpdcm is up to two orders of magnitude more efficient than the standard implementation in the software package SPM. Parallel tempering increases the mixing properties of the traditional Metropolis Hastings algorithm at low computational cost given efficient, parallel simulations of a model. Conclusions: Future applications of DCM will likely require increasingly large computational resources, for example, when the likelihood landscape of a model is multimodal, or when implementing sampling methods for multi-subject analysis. Due to the wide availability of GPUs, algorithmic advances can be readily available in the absence of access to large computer grids, or when there is a lack of expertise to implement algorithms in such grids. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:7 / 16
页数:10
相关论文
共 50 条
  • [21] Comprehensive climate system modeling on massively parallel computers
    Wehner, MF
    Eltgroth, PG
    Mirin, AA
    Duffy, PB
    Caldeira, KG
    Bolstad, JH
    Wang, H
    Matarazzo, CM
    Creach, UE
    [J]. MISSION EARTH: MODELING AND SIMULATION FOR A SUSTAINABLE GLOBAL SYSTEM, 1997, : 37 - 42
  • [22] Parallel processing of somatosensory information: Evidence from dynamic causal modeling of MEG data
    Klingner, Carsten M.
    Brodoehl, Stefan
    Huonker, Ralph
    Goetz, Theresa
    Baumann, Lydia
    Witte, Otto W.
    [J]. NEUROIMAGE, 2015, 118 : 193 - 198
  • [23] Massively Parallel Causal Inference of Whole Brain Dynamics at Single Neuron Resolution
    Watanakeesuntorn, Wassapon
    Takahashi, Keichi
    Ichikawa, Kohei
    Park, Joseph
    Sugihara, George
    Takano, Ryousei
    Haga, Jason
    Pao, Gerald M.
    [J]. 2020 IEEE 26TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2020, : 196 - 205
  • [24] Parallel file access for implementing dynamic load balancing on a massively parallel computer
    Shimizu, M
    Oue, Y
    Ohnishi, K
    Kitamura, T
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (04) : 466 - 472
  • [25] ADAPTIVE ROUTING FOR DYNAMIC APPLICATIONS IN MASSIVELY-PARALLEL ARCHITECTURES
    BOARI, M
    CORRADI, A
    STEFANELLI, C
    LEONARDI, L
    [J]. IEEE PARALLEL & DISTRIBUTED TECHNOLOGY, 1995, 3 (01): : 61 - 74
  • [26] Nimrod/K: Towards Massively Parallel Dynamic Grid Workflows
    Abramson, David
    Enticott, Colin
    Altinas, Ilkay
    [J]. INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2008, : 115 - +
  • [27] MULTIDIMENSIONAL DYNAMIC-PROGRAMMING ON MASSIVELY-PARALLEL COMPUTERS
    ANGEL, E
    LEONG, P
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1994, 27 (9-10) : 67 - 75
  • [28] PNS - A DYNAMIC MAPPING STRATEGY FOR MASSIVELY-PARALLEL COMPUTERS
    CANNATARO, M
    SPEZZANO, G
    TALIA, D
    [J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1994, 13 (05): : 477 - 494
  • [29] Dynamic Memory Management in Massively Parallel Systems: A Case on GPUs
    Pham, Minh
    Li, Hao
    Yuan, Yongke
    Mou, Chengcheng
    Ramachandran, Kandethody
    Xu, Zichen
    [J]. PROCEEDINGS OF THE 36TH ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ICS 2022, 2022,
  • [30] Mining dynamic document spaces with massively parallel embedded processors
    Jacobs, Jan W. M.
    Dai, Rui
    Smit, Gerard J. M.
    [J]. EMBEDDED COMPUTER SYSTEMS: ARCHITECTURES, MODELING, AND SIMULATION, PROCEEDINGS, 2006, 4017 : 69 - 78