Skip to main navigation Skip to search Skip to main content

Static analysis of interaction nets for distributed implementations

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

Interaction nets can be seen as both a programming language and an intermediate language for the implementation of other paradigms of computation. One of their principal advantages is that the reduction process is both local and confluent, thus being ideally suited for the development of parallel implementations. For distributed memory architectures, however, there is a need to know how the net should be distributed amongst processors, i.e. how do we break up the net so that the communication is kept to a minimum. The purpose of this paper is to suggest an analysis to solve this problem, and hint at other possible analyses for different applications, for example dynamic load balancing.

Original languageEnglish
Title of host publicationStatic Analysis - 4th International Symposium, SAS 1997
EditorsPascal Van Hentenryck
PublisherSpringer Verlag
Pages217-231
Number of pages15
ISBN (Print)9783540634683
DOIs
Publication statusPublished - 1 Jan 1997
Event4th International Symposium on Static Analysis, SAS 1997 - Paris, France
Duration: 8 Sept 199710 Sept 1997

Publication series

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

Conference

Conference4th International Symposium on Static Analysis, SAS 1997
Country/TerritoryFrance
CityParis
Period8/09/9710/09/97

Keywords

  • Abstract interpretation
  • Distributed implementations
  • Interaction nets

Fingerprint

Dive into the research topics of 'Static analysis of interaction nets for distributed implementations'. Together they form a unique fingerprint.

Cite this