A layered method for process and code mapping
type: Item
instance of: scholarly article
title: A layered method for process and code mapping
zbMATH Open document ID: 0624.68031
DOI: 10.1007/BF03037398
author: Jianyong Qiao
author: Sumit K. Garg
published in: New Generation Computing
publication date: 1987-01-01T00:00:00Z
review text: The mapping problem has been shown to be computationally equivalent to the graph isomorphism problem; as such it is unlikely that a polynomial time algorithm exists for its solution. Practical algorithms of general applicability and low computational complexity have not been found and are unlikely to appear. This paper describes a layered method to support specialised process and code mapping strategies. The method separates the task of mapping a problem to a virtual machine from the task of mapping a virtual machine to a physical machine. It allows multiple virtual machines to execute concurrently and many applications to run on a single virtual machine. The method is in use on a parallel implementation of Flat Concurrent Prolog which runs on an Intel iPSC Hypercube; for concreteness the description is based on this implementation.
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 4014018
zbMATH Keywords: concurrent logic programming
zbMATH Keywords: parallel processing
zbMATH Keywords: dynamic process mapping
zbMATH Keywords: shells
zbMATH Keywords: virtual machines
zbMATH Keywords: parallel implementation of Flat Concurrent Prolog
MaRDI profile type: Publication
cites work: Q3727368
cites work: A parallel implementation of flat concurrent Prolog
description: scientific article; zbMATH DE number 4014018