Uwe Glässer's A Distributed Implementation of Flat Concurrent Prolog on PDF

By Uwe Glässer

ISBN-10: 3322976114

ISBN-13: 9783322976116

ISBN-10: 3322976122

ISBN-13: 9783322976123

Show description

Read or Download A Distributed Implementation of Flat Concurrent Prolog on Message-Passing Multiprocessor Systems PDF

Similar german_5 books

Download PDF by Werner Burhenne, Albrecht Klages (auth.), Rainer Bischoff: Studien- und Forschungsführer: Informatik, Technische

Dipl. -Math. Prof. Dr. rer. pol. Rainer Bischoff lehrt im Fachbereich Wirtschaftsinformatik an der Fachhochschule Furtwangen (Schwarzwald). Seine Arbeitsgebiete sind Controlling/IS-Controlling/DV-Controlling, Software-Engineering und Aus- und Weiterbildung im DV-Bereich an Hochschulen. Er ist Vorsitzender des Fachbereichstags Informatik an Fachhochschulen (50 Mitgliedshochschulen) und Sprecher des bundesweiten Arbeitskreises Wirtschaftsinformatik an Fachhochschulen (40 Mitgliedshochschulen).

Read e-book online Arbeitsmethodik: Von der Aufgabe bis zur Lösung PDF

Rationalisierung ist ohne Zweifel ein entscheidendes aspect des wirtschaft lichen Fortschritts. Eine der Moglichkeiten, sie zu verwirklichen, bildet die Arbeitsmethodik, die in verschiedenen Formen immer bekannter wird, zum Beispiel als methodisches Entwickeln und Konstruieren. In dem Bemiihen, diese Arbeitsmethodik weiten Kreisen bekannt und ver stiindlich zu machen, veranstaltete der REFA-Verband entsprechende Semi nare.

Additional resources for A Distributed Implementation of Flat Concurrent Prolog on Message-Passing Multiprocessor Systems

Sample text

The same application program may run on a uniprocessor configuration as weil as on arbitrary large networks with any nummer of processors. Consequently, the compiler needs also not to know whether the code it produces is to be executed on a sequential or parallel machine. On the other hand, it still remains possible to extract helpful information from a program at compile-time in order to support or improve parallelization whenever the program is executed by more than one processor. 1. - ~------------------FCP Machine Program (Primitive Reduetion Instruetions) Networ;L~;; - - - - - - I I Network Boot U_til..

THE ABSTRACT MACHINE MODEL 41 Beside the dynamic data structures mentioned so far, the Heap also contains the FCP process structures as well as the data structures required to handle process suspensions. In fact, all these data structures are represented as tuples, which are dynamically created and deleted. The machine representation of a process structure consisting of k arguments corresponds to a tuple of arity k + 2. The additional entry thereby identifies the program procedure belonging to the process.

O handle backtracking, efficiently. a-flow synchronization without using busy waiting requires an additional process suspension mechanism. FinaIly, the concept of compiling unification has to be generalized and extended to read-only unification primitives. An instruction set. for a sequential FCP machine was first proposed by Houri and Shapiro in [Houri87]. In the design and implementation of our machine we use a different. instruction set as weIl as different representations for FCP data structures.

Download PDF sample

A Distributed Implementation of Flat Concurrent Prolog on Message-Passing Multiprocessor Systems by Uwe Glässer

by Ronald

Rated 4.21 of 5 – based on 27 votes