Portal de Periódicos da CAPES

Compiling rewriting onto SIMD and MIMD/SIMD machines

1994; Springer Science+Business Media; Linguagem: Inglês

10.1007/3-540-58184-7_88

1611-3349

Per Lincoln, Narciso Martı́-Oliet, José Meseguer, Livio Ricciulli,

Software Engineering Research

We present compilation techniques for Simple Maude, a declarative programming language based on Rewriting Logic which supports term, graph, and object-oriented rewriting. We show how to compile various constructs of Simple Maude onto SIMD and MIMD/SIMD massively parallel architectures, and in particular onto the Rewrite Rule Machine (RRM), a special purpose MIMD/SIMD architecture for rewriting. We then demonstrate how to compile SIMD graph rewriting onto MIMD/SIMD architectures, and discuss mapping 3-D structures into 2-D SIMD meshes. Finally, we sketch the compilation of object-oriented rewriting into efficient MIMD/SIMD code. We thus show that Simple Maude is an efficient, machine-independent parallel programming language.