Prolog Multiprocessors |
Other editions - View all
Common terms and phrases
algorithm allocation alternative annotations architecture assumptions back-unification baseline network bidirectional ring binding conflicts called CAND cell Chapter clause-body literals clause-head compound-terms Computer Architecture Concurrent Pascal Concurrent Prolog containing context control tokens data base data-base data-driven data-flow computation data-flow graphs data-flow machine data-flow model described dframe discussion distributed EBNF Endnotes EPILOG model evaluated in parallel evaluation strategy example firing FORTRAN function functor global goal frame Horn clauses implementation input arcs instance instruction isbnd iteration Logic Programming loop memory MERGE messages mod NPE mode declarations multiprocessor negative literals Neumann Newcastle Upon Tyne node operations output arcs parallel execution PARLOG Pascal performed possible predicate predicate-name problem procedure processor elements programming languages proposed qsort query packet RBRACKET recursion returned sequence sequential shared variables simulation single solution stack strategy stream structure structure-sharing template term time-unit tion transmission tuples unbnd unbound variable unification algorithm unify