A Distributed Implementation of Flat Concurrent Prolog on Message-Passing Multiprocessor Systems: Teubner Texte zur Informatik, cartea 3

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.