摘要:

AbstractThis is the first of a series of papers on the Genesis distributed‐memory benchmarks, which were developed under the European ESPRIT research program. The benchmarks provide a standard reference Fortran77 uniprocessor version, a distributed memory. MIMD version, and in some cases a Fortran90 version suitable for SIMD computers. The problems selected all have a scientific origin (mostly from physics or theoretical chemistry), and range from synthetic code fragments designed to measure the basic hardware properties of the computer (especially communication and synchronisation overheads), through commonly used library subroutines, to full application codes. This first paper defines the methodology to be used to analyse the benchmark results, and gives an example of a fully analysed application benchmark from General Relativity (GR1). First, suitable absolute performance metrics are carefully defined, then the performance analysis treats the execution time and absolute performance as functions of at least two variables, namely the problem size and the number of proecssors. The theoretical predictions are compared with, or fitted to, the measured results, and then used to predict (with due caution) how the performance might scale for larger problems and more processors than were actually available during the benchmarking. Benchmark measurements are given primarily for the German SUPRENUM computer, but also for the IBM 3083J, Convex C210 and a Parsys Supernode with 32 T800‐20 transput

ISSN:1040-3108    

DOI:10.1002/cpe.4330050102

出版商:John Wiley&Sons, Ltd    

年代:1993

数据来源: WILEY

摘要:

AbstractManagement of the communications among a set of concurrent processes arises in many applications and is a central concern in parallel computing. In this paper we introduce MANIFOLD: aco‐ordinationlanguage whose sole purpose is to describe and manage complex interconnections among independent, concurrent processes. In the underlying paradigm of this language the primary concern is not withwhatfunctionality the individual processes in a parallel system provide. Instead, the emphasis is onhowthese processes are interconnected and how their interaction patterns change during the execution life of the system. This paper also includes an overview of our implementation of MANIFOLD.As an example of the application of MANIFOLD, we present a series of small manifold programs which describe the skeletons of some adaptive recursive algorithms that are of particular interest in computer graphics. Our concern in this paper is to show the expressiveness of MANIFOLD, the feasibility of its implementation and its usefulness in practice. Issues regarding performance and optimization are beyond the scope of this pape

ISSN:1040-3108    

DOI:10.1002/cpe.4330050103

出版商:John Wiley&Sons, Ltd    

年代:1993

数据来源: WILEY

摘要:

AbstractThe performance evaluation process for a massively parallel distributed‐memory SIMD computer is described generally. The performance in basic computation, grid communication, and computation with grid communication is analysed. A practical performance evaluation and analysis study is done for the Connection Machine 2, and conclusions about its performance are draw

ISSN:1040-3108    

DOI:10.1002/cpe.4330050104

出版商:John Wiley&Sons, Ltd    

年代:1993

数据来源: WILEY

ISSN:1040-3108    

DOI:10.1002/cpe.4330050101

出版商:John Wiley&Sons, Ltd    

年代:1993

数据来源: WILEY