Skip to main content
SpringerLink
Log in

Parallel Execution of Parlog

  • Book
  • © 1992

Overview

Authors:
  1. Andrew Cheese
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 586)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-26

  3. Parlog a concurrent logic programming language

    Pages 27-47

  4. A fine-grain graph-reduction model of computation

    Pages 48-64

  5. Implementing parlog on a packet-rewriting computational model

    Pages 65-94

  6. The Multi-Sequential coarse-grain approach

    Pages 95-132

  7. Summary, further work and conclusions

    Pages 133-146

  8. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

This monograph concentrates on the implementation of concurrent logic programming languages on loosely-coupled parallel computer architectures. Two different abstract models are also considered: a graph reduction based model and a more imperative approach. The design of a specialized instruction set is presented that is general enough to be used for the whole family of concurrent logic programming languages. In particular the language Parlog is concentrated upon because it is the most efficiently implementable of all the non-flat logic programming languages. Other issues arising from the implementation of a programming language are discussed, in particular the design of a load balancing scheme which deals with the large number of short-lived processes inherent in a correct language implementation. Detailed descriptions of all the data structures and synchronisation algorithms are also presented. Resource exhaustion is also discussed and handled within the implementations. Detailed performance results for both models of computation are given. From the material it should be possible for the reader to create an implementation.   

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation