loading...
Explicit SIMD Programming for Asynchronous Applications
Boston, Massachusetts July 10-July 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2000.86239612th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Andrea Di Blas, Richard Hughey, "Explicit SIMD Programming for Asynchronous Applications," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 258, 12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/ASAP.2000.862396,
author = {Andrea Di Blas and Richard Hughey},
title = {Explicit SIMD Programming for Asynchronous Applications},
journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on},
volume = {0},
year = {2000},
issn = {1063-6862},
pages = {258},
doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2000.862396},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
TI - Explicit SIMD Programming for Asynchronous Applications
SN - 1063-6862
SP
EP
A1 - Andrea Di Blas,
A1 - Richard Hughey,
PY - 2000
KW - SIMD parallel computers
KW - asynchronous and irregular problems
KW - parallel programming model
KW - UCSC Kestrel
KW - MasPar MP-2
VL - 0
JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
ER -
 
Andrea Di Blas, University of California at Santa Cruz
Richard Hughey, University of California at Santa Cruz
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.
Index Terms:
SIMD parallel computers, asynchronous and irregular problems, parallel programming model, UCSC Kestrel, MasPar MP-2
Citation:
Andrea Di Blas, Richard Hughey, "Explicit SIMD Programming for Asynchronous Applications," asap, pp.258, 12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.