The University of Southampton
University of Southampton Institutional Repository

Declarative Solutions to Partitioned-grid Problems

Declarative Solutions to Partitioned-grid Problems
Declarative Solutions to Partitioned-grid Problems
The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program. The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms.
1173-1200
Etalle, S.
855a86ff-09c1-4110-b7bd-ecf14ebff8f8
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
Vree, W. G.
aec57929-e7f9-486b-a405-8b66725ece6e
Etalle, S.
855a86ff-09c1-4110-b7bd-ecf14ebff8f8
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
Vree, W. G.
aec57929-e7f9-486b-a405-8b66725ece6e

Etalle, S., Hartel, P. H. and Vree, W. G. (1999) Declarative Solutions to Partitioned-grid Problems. Software: Practice and Experience, 29 (13), 1173-1200.

Record type: Article

Abstract

The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program. The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms.

Full text not available from this repository.

More information

Published date: 1999
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 250493
URI: http://eprints.soton.ac.uk/id/eprint/250493
PURE UUID: 2b1442c8-5ae5-4311-9a3c-5b4b7a40541c

Catalogue record

Date deposited: 24 Nov 1999
Last modified: 16 Jul 2019 23:12

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×