COMPUTATION ON PARALLEL MESSAGE-PASSING COMPUTERS

被引:0
|
作者
PETERSEN, J
机构
[1] Bergen Scientific Centre, IBM, Thormøhlens gt, Bergen
来源
PHYSICA SCRIPTA | 1991年 / T38卷
关键词
D O I
10.1088/0031-8949/1991/T38/006
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Within parallel computing, one may divide the present architectures into 3 categories, (a) massively parallel SIMD, (b) Shared memory MIMD and (c) Distributed memory MIMD (or Message Passing). (SIMD = Single Instruction Multiple Data; MIMD = Multiple Instruction Multiple Data). The “simplest” of these is the message-passing architecture. A Message-Passing system consists of several processors, where each processor has a “fair” amount of local memory and is connected to some kind of communication network. This talk will cover some of the most common tools of an established parallel message passing operating system, Trollius [1]. One tool, TGraph [2], developed at Bergen Scientific Centre, is a tool for graphics output under X-windows from the processors. A programming philosophy [3] for message-passing computers which is based on ‘domain decomposition’, and some specific applications, such as Wave Equation [4], Gauss Elimination [5] and a large Climate Model project will be discussed. © 1991 IOP Publishing Ltd.
引用
收藏
页码:33 / 33
页数:1
相关论文
共 50 条
  • [41] A COMMUNICATION ARCHITECTURE FOR A MASSIVELY-PARALLEL MESSAGE-PASSING MULTICOMPUTER
    GERMAIN, C
    BECHENNEC, JL
    ETIEMBLE, D
    SANSONNET, JP
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1993, 19 (04) : 338 - 348
  • [42] Benchmark evaluation of the message-passing overhead on modern parallel architectures
    Bönisch, T
    Resch, M
    Berger, H
    PARALLEL COMPUTING: FUNDAMENTALS, APPLICATIONS AND NEW DIRECTIONS, 1998, 12 : 411 - 418
  • [43] SCMP: A Single-Chip Message-Passing Parallel Computer
    James M. Baker
    Brian Gold
    Mark Bucciero
    Sidney Bennett
    Rajneesh Mahajan
    Priyadarshini Ramachandran
    Jignesh Shah
    The Journal of Supercomputing, 2004, 30 : 133 - 149
  • [44] Efficient parallel prefix algorithms on multiport message-passing systems
    Lin, YC
    Yeh, CS
    INFORMATION PROCESSING LETTERS, 1999, 71 (02) : 91 - 95
  • [45] OPTIMAL TRACING AND REPLAY FOR DEBUGGING MESSAGE-PASSING PARALLEL PROGRAMS
    NETZER, RHB
    MILLER, BP
    JOURNAL OF SUPERCOMPUTING, 1995, 8 (04): : 371 - 388
  • [46] GROMACS - A MESSAGE-PASSING PARALLEL MOLECULAR-DYNAMICS IMPLEMENTATION
    BERENDSEN, HJC
    VANDERSPOEL, D
    VANDRUNEN, R
    COMPUTER PHYSICS COMMUNICATIONS, 1995, 91 (1-3) : 43 - 56
  • [47] Parallelized direct execution simulation of message-passing parallel programs
    Dickens, PM
    Heidelberger, P
    Nicol, DM
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (10) : 1090 - 1105
  • [48] High-level abstractions for message-passing parallel programming
    Chan, F
    Cao, JN
    Sun, YD
    PARALLEL COMPUTING, 2003, 29 (11-12) : 1589 - 1621
  • [49] A tool for testing of parallel and distributed programs in message-passing environments
    Bechini, A
    Cutajar, J
    Prete, CA
    MELECON '98 - 9TH MEDITERRANEAN ELECTROTECHNICAL CONFERENCE, VOLS 1 AND 2, 1998, : 1308 - 1312
  • [50] A SCALABLE DEBUGGER FOR MASSIVELY-PARALLEL MESSAGE-PASSING PROGRAMS
    SISTARE, S
    ALLEN, D
    BOWKER, R
    JOURDENAIS, K
    SIMONS, J
    TITLE, R
    IEEE PARALLEL & DISTRIBUTED TECHNOLOGY, 1994, 2 (02): : 50 - 56