Compiling rewriting onto SIMD and MIMD/SIMD machines

P. Lincoln, N. Martí-Oliet, J. Meseguer, L. Ricciulli

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationPARLE 1994 – Parallel Architectures and Languages Europe - 6th International PARLE Conference, Proceedings
EditorsCostas Halatsis, George Philokyprou, Dimitrios Maritsas, Sergios Theodoridis
Number of pages12
ISBN (Print)9783540581840
StatePublished - 1994
Externally publishedYes
Event6th International Conference on Parallel Architectures and Languages Europe, PARLE 1994 - Athens, Greece
Duration: Jul 4 1994Jul 8 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume817 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other6th International Conference on Parallel Architectures and Languages Europe, PARLE 1994

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Compiling rewriting onto SIMD and MIMD/SIMD machines'. Together they form a unique fingerprint.

Cite this