Abstract
We define a small language which embodies the main concepts of parallel languages for massively parallel SIMD architectures such as the Connection Machine, and give its Structured Operational Semantics. It yields two related program equivalences, corresponding respectively to two views of SIMD architectures. They are studied in detail. We then extend the language with parallel counterparts of non-local control transfer structures such as break and continue in C, and show that many classical control structures in real SIMD languages can be expressed thanks to them.
Extended Abstract
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Batcher K (1979) The design of a Massively Parallel Processor. IEEE Trans. on Computers C-29, 9, pp 836–840.
Bougé L (1990) On the semantics of languages for massively parallel architectures. Rept. No. 90-13, LIENS, Paris, 1990.
Bougé L, Garda P (1990) Towards a semantic approach to SIMD architectures and their languages. In: Semantics of Systems of Concurrent Processes, Proc. 18th Spring School of the LITP, Lect. Notes Comp. Science 469, Springer, pp 142–175.
Connection Machine Model CM-2 Technical Summary (1987) Techn. Rept. HA 87-4, Thinking Machine Corp.
Fountain TJ (1981) CLIP4: A Progress Report. In: Duff MJB, Levialdi, S (eds) Languages and Architectures for Image Processing, Academic Press, pp 283–291.
Frenkel K (1986) Evaluating two massively parallel machines. Comm. ACM 29, 8, pp 752–758.
Hillis WD (1985) The Connection Machine. MIT Press, Cambridge, Mass.
Hockney RW, Jesshope CR (1988) Parallel Computers 2: Architectures, Programming and Algorithms. IOP Publishing Ltd.
Hunt DJ (1981) The ICL DAP and its application to image processing. In: Duff MJB, Levialdi S (eds) Languages and Architectures for Image Processing Academic Press, pp 275–282.
Lua KT, Wong WF (1987) Geometric Arithmetic Parallel Processor — An Evaluation. Proc. Interdepartment Seminar on Supercomputers and Applications, Publ. TRIO/87, Dept. Information Systems and Comp. Science, Nat. Univ. Singapore, pp 44–61.
Olderog E-R, Apt K (1988) Fairness in parallel programs: the transformational approach. ACM Trans. on Progr. Lang. and Systems 10, 3, pp 420–455.
Paris N (1990) Définition de POMPC (version 1.5). Typescript, LIENS, Paris.
ParIS: The C Interface. Reference Manual (1987) Thinking Machine Corp.
Perrott RH (1979) A language for array and vector processors. ACM Trans. Progr. Lang. 1, 2, pp 177–195.
Reeves RW (1985) Parallel Pascal and the Massively Parallel Processor. In: Potter JL (ed) The Massively Parallel Processor), MIT Press, pp 230–260.
Steele GH, Hillis WD (1986) Connection Machine Lisp: Fine-Grain Parallel Symbolic Processing. Proc. 1986 ACM Conf. on Lisp and Funct. Progr., Cambridge, Mass., pp 279–297.
*Lisp Language Reference Manual (1988) Thinking Machine Corp.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag
About this paper
Cite this paper
Bougé, L. (1991). On the semantics of languages for massively parallel SIMD architectures. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_64
Download citation
DOI: https://doi.org/10.1007/3-540-54152-7_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54152-3
Online ISBN: 978-3-540-47472-2
eBook Packages: Springer Book Archive