Supporting efficient tree structures for distributed scientific computation

被引:0
|
作者
Liu, PF [1 ]
Wu, JJ
机构
[1] Natl Chung Cheng Univ, Dept Comp Sci & Comp Engn, Chiayi 621, Taiwan
[2] Acad Sinica, Inst Informat Sci, Taipei 115, Taiwan
关键词
distributed scientific computation; data structures; parallel trees; n-body simulations; class library;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes an implementation of a platform-independent parallel C++ framework that can support various scientific simulations involving tree structures, such as astrophysics, semiconductor device simulation, molecular dynamics, plasma physics, and fluid mechanics. Within the framework, users are able to concentrate on the computation kernels that differentiate different tree-structured scientific simulation problems and let the framework take care of tedious and error-prone details that are common among these applications. This framework was developed based on the techniques we learned from previous CM-5 C implementations, which have been rigorously justified both experimentally and mathematically. This gives us confidence that our framework will allow fast prototyping of different scientific simulation applications that run on different parallel platforms and deliver good performance as well. We used MPI to implement the communication routines within the framework for better portability; therefore, the parallel library, as well as the applications developed within the framework, can run on every parallel machine where MPI is available. The applications remain portable across different platforms, and the communication library within the framework can be customized to explore possible performance gains based on individual characteristics of different parallel machines. To demonstrate the flexibility and performance of this framework, we implemented a gravitational force field computation code and a multi-filament vortex method on a SPARC Ultra workstation cluster, and report very competitive speedup even compared with a highly optimized sequential C implementation.
引用
收藏
页码:79 / 105
页数:27
相关论文
共 50 条
  • [31] SUPPORTING EFFICIENT QUERY PROCESSING ON COB+-TREE
    Jin, Rize
    Chung, Tae-Sun
    [J]. 2011 INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING AND TECHNOLOGY (ICMET 2011), 2011, : 741 - 745
  • [32] Efficient computation of Modulation Bandwidth of GaInAsP/InP Distributed Reflector (DR) Laser with Quantum Wire Structures
    Mobarak, Mahjabin
    Hossain, Md. Nahid
    Bin Yousuf, Abdul Hamid
    Mahmudullah, Saeed
    Routh, Tushar Kanti
    [J]. 2012 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), 2012, : 332 - 335
  • [33] Distributed computation of all node replacements of a minimum spanning tree
    Flocchini, Paola
    Enriquez, Toni Mesa
    Pagli, Linda
    Prencipe, Giuseppe
    Santoro, Nicola
    [J]. EURO-PAR 2007 PARALLEL PROCESSING, PROCEEDINGS, 2007, 4641 : 598 - +
  • [34] Tree-Like Distributed Computation Environment with Shapp Library
    Galecki, Tomasz
    Daszczuk, Wiktor Bohdan
    [J]. INFORMATION, 2020, 11 (03)
  • [35] Distributed computation of a spanning tree in a dynamic graph by mobile agents
    Abbas, Shehla
    Mosbah, Mohamed
    Zemmari, Akka
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF INTELLIGENT SYSTEMS, 2006, : 426 - +
  • [36] Optimal Decision Tree Synthesis for Efficient Neighborhood Computation
    Grana, Costantino
    Borghesani, Daniele
    [J]. AI (ASTERISK) IA 2009: EMERGENT PERSPECTIVES IN ARTIFICIAL INTELLIGENCE, 2009, 5883 : 92 - 101
  • [37] Optimization of distributed detection networks with Tree structures
    Ming, X
    Han, CZ
    [J]. PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION FUSION, VOL I, 2002, : 164 - 169
  • [38] Efficient Computation of Expectations under Spanning Tree Distributions
    Zmigrod, Ran
    Vieira, Tim
    Cotterell, Ryan
    [J]. TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2021, 9 : 675 - 690
  • [39] Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Fuerer, Martin
    [J]. ALGORITHMICA, 2014, 68 (03) : 626 - 642
  • [40] Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Martin Fürer
    [J]. Algorithmica, 2014, 68 : 626 - 642