SCF CALCULATIONS ON MIMD TYPE PARALLEL COMPUTERS

被引:8
|
作者
BURKHARDT, A
WEDIG, U
VONSCHNERING, HG
机构
[1] Max-Planck-Institut für Festkörperforschung, Stuttgart, D-70569
来源
THEORETICA CHIMICA ACTA | 1993年 / 86卷 / 06期
关键词
PARALLEL; MIMD; SCF; MASSIVELY PARALLEL COMPUTERS;
D O I
10.1007/BF01113948
中图分类号
O64 [物理化学(理论化学)、化学物理学];
学科分类号
070304 ; 081704 ;
摘要
One of the key methods in quantum chemistry, the Hartree-Fock SCF method, is performing poorly on typical vector supercomputers. A significant acceleration of calculations of this type requires the development and implementation of a parallel SCF algorithm. In this paper various parallelization strategies are discussed comparing local and global communication management as well as sequential and distributed Fock-matrix updates. Programs based on these algorithms are bench marked on transputer networks and two IBM MIMD prototypes. The portability of the code is demonstrated with the portation of the initial Helios version to other operating systems like Parallel VM/SP and PARIX. Based on the PVM libraries, a platform-independent version has been developed for heterogeneous workstation clusters as well as for massively parallel computers.
引用
收藏
页码:497 / 510
页数:14
相关论文
共 50 条
  • [1] Memory/disk resident SCF calculations on parallel computers
    Minkoff, M
    Tilson, JL
    Dritz, KW
    Sutton, P
    Shepard, RL
    Wagner, AF
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1997, 213 : 235 - COMP
  • [2] COMMUNICATION PROBLEMS ON MIMD PARALLEL COMPUTERS
    MCKEOWN, GP
    RAYWARDSMITH, VJ
    INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 69 - 73
  • [3] PARALLEL FDTD SIMULATOR FOR MIMD COMPUTERS
    EFFING, U
    KUMPEL, W
    WOLFF, I
    INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS, 1995, 8 (3-4) : 277 - 281
  • [4] PARALLEL FFT ALGORITHMS FOR MIMD COMPUTERS
    FUNG, MK
    NANDI, AK
    ELECTRONICS LETTERS, 1991, 27 (03) : 286 - 288
  • [5] Parallel algorithm for computing FFT on MIMD parallel computers
    Dianzi Keji Diaxue Xuebao, 6 (621-626):
  • [6] STUDYING QUARKS AND GLUONS ON MIMD PARALLEL COMPUTERS
    BERNARD, C
    OGILVIE, MC
    DEGRAND, TA
    DETAR, CE
    GOTTLIEB, SA
    KRASNITZ, A
    SUGAR, RL
    TOUSSAINT, D
    INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1991, 5 (04): : 61 - 70
  • [7] DATA-PARALLEL PROGRAMMING ON MIMD COMPUTERS
    HATCHER, PJ
    QUINN, MJ
    LAPADULA, AJ
    SEEVERS, BK
    ANDERSON, RJ
    JONES, RR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1991, 2 (03) : 377 - 383
  • [8] PERFORMANCE EVALUATION OF THE BINARY TREE ACCESS MECHANISM IN MIMD TYPE PARALLEL COMPUTERS.
    Sueyoshi, Toshinori
    Saisho, Keizo
    Arita, Itsujiro
    1600, (17):
  • [9] METHOD FOR AUTOMATIC SYNTHESIS OF PARALLEL PROGRAMS FOR MIMD COMPUTERS
    KOSTENKO, VA
    PROGRAMMING AND COMPUTER SOFTWARE, 1993, 19 (01) : 11 - 20
  • [10] TRACE DRIVEN SIMULATION FOR STUDYING MIMD PARALLEL COMPUTERS
    KUMAR, M
    SO, K
    PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 1: ARCHITECTURE, 1989, : I68 - I72