Parallel Execution of Parlog

Andrew Cheese

ISBN 10: 3540553827 / ISBN 13: 9783540553823

Published by Springer, Springer Mai 1992, 1992

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 200 pp. Englisch.

Seller Inventory # 9783540553823

Bibliographic Details

• Title: Parallel Execution of Parlog
• Publisher: Springer, Springer Mai 1992
• Publication Date: 1992
• Language: English
• ISBN 10: 3540553827
• ISBN 13: 9783540553823
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 12D millimeters 235 millimeters width by 155 millimeters height by 12 millimeters depth
• Weight: 312 grams

About this title

Synopsis

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.