Explicit SIMD programming for asynchronous applications

Author

Di Blas, Andrea ; Hughey, Richard

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

fYear

2000

fDate

2000

Firstpage

258

Lastpage

267

Abstract

This paper presents the SIMD Phase Programming Model, a simple approach to solving asynchronous, irregular problems on massively parallel SIMD computers. The novelty of this model consists of a simple, clear method on how to turn a general serial program into an explicitly parallel one for a SIMD machine, transferring a portion of the flow control into the single PEs. Three case studies (the Mandelbrot Set, the N-Queen problem, and a Hopfield neural network that approximates the maximum clique in a graph) will be presented, implemented on two different SIMD computers (the UCSC Kestrel and the MasPar MP-2). Our results so far show good performance with respect to conventional serial CPU computing time and in terms of the high parallel speedup and efficiency achieved

Keywords

Hopfield neural nets; instruction sets; parallel programming; Hopfield neural network; Mandelbrot Set; MasPar MP-2; N-Queen problem; UCSC Kestrel; asynchronous applications; efficiency; explicit SIMD programming; flow control; massively parallel SIMD computers; maximum clique; parallel speedup; phase programming model; Application software; Central Processing Unit; Computer networks; Concurrent computing; High performance computing; Hopfield neural networks; Parallel programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Application-Specific Systems, Architectures, and Processors, 2000. Proceedings. IEEE International Conference on

Conference_Location

Boston, MA

ISSN

2160-0511

Print_ISBN

0-7695-0716-6

Type

conf

DOI

10.1109/ASAP.2000.862396

Filename

862396