A Distributed Implementation of Flat Con
β Dr. rer. nat. Uwe GlΓ€sser (auth.)
π Library
π
1993
π Vieweg+Teubner Verlag
π German
β¦ LIBER β¦
π
A distributed implementation of Flat Concurrent Prolog on message-passing microprocessor systems
β Scribed by GlΓ€sser, Uwe
- Publisher
- Vieweg+Teubner Verlag : Imprint : Vieweg+Teubner Verlag
- Year
- 1993
- Tongue
- English
- Leaves
- 116
- Series
- Teubner-Texte zur Informatik 3
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content: 1 Introduction and Overview --
1.1 General Introduction --
1.2 Significance of the Work --
1.3 Overall Organization --
1.4 Syntax of Logic Programs --
1.5 Data Manipulation by Unification --
2 Concurrent Logic Programming --
2.1 Process Interpretation of Logic Programs --
2.2 Data-Flow Synchronization Techniques --
2.3 Operational Semantics of FCP --
3 Design of an Abstract FCP Machine --
3.1 The Process Reduction Mechanism --
3.2 The Abstract Machine Model --
4 Concepts for a Distributed Implementation --
4.1 Abstract System Architecture --
4.2 Distributed Data Representation --
4.3 The Distributed Reduction Algorithm --
4.4 Distributed Termination Detection --
4.5 Multiprogramming Facilities --
4.6 Deadlock and Livelock Prevention --
4.7 Dynamic Work Load Balancing --
4.8 Distributed Garbage Collection --
4.9 Related Work --
5 Implementing FCP on Large Transputer Networks --
5.1 Parallel Machine Architecture --
5.2 Reduction Unit Architecture --
5.3 Host Unit Architecture --
6 Performance Measurements and Optimizations --
6.1 Performance Measures --
6.2 Possible Optimizations --
7 Conclusions.
β¦ Subjects
Engineering.
π SIMILAR VOLUMES
Distributed Algorithms for Message-Passi
β Michel Raynal (auth.)
π Library
π
2013
π Springer-Verlag Berlin Heidelberg
π English
<p><p>Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem
Distributed Algorithms for Message-Passi
β Michel Raynal
π Library
π
2013
π Springer Berlin Heidelberg : Imprint: Springer
π English
<p>Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. I
Implementations of Distributed Prolog
β edited by Peter Kacsuk and Michael Wise
π Library
π
1992
π John Wiley & Sons
π English
Implementations of Distributed Prolog Edited by Peter Kacsuk, KFKI Research Institute for Measurement and Computing Techniques, Hungary and Michael J. Wise, University of Sydney, Australia Foreword by Doug De Groot, Texas Instruments, USA Although much needed, standard and commercially
Fault-Tolerant Message-Passing Distribut
β Michel Raynal
π Library
π
2018
π Springer
π English
Fault-Tolerant Message-Passing Distribut
β Michel Raynal
π Library
π
2018
π Springer International Publishing
π English
<p><p>This book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications. These programming abstractions,