Data processing system intended for the execution of programs in

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364228, 364243, 36424294, 3649314, 364964, 36492796, G06F 1516, G06F 1300

Patent

active

049492438

DESCRIPTION:

BRIEF SUMMARY
This invention relates to a data processing computer system intended for the execution of programs in the form of search trees, so-called OR parallel execution.
In recent years several different programming languages and programming structures have been developed, at which the execution order of the programs can be described in the form of a search tree. One example of such is the programming language Prolog (Programming in Logic). Such programs are characterized in that a computer successively searches through an upside-down tree commencing at the root of the tree. For each branch and, respectively, at the branching points of the branch the computer chooses to check one of the branches at each branching point, whereafter it reverses and checks the other branch at the branching point, a.s.o. (and so on). At the execution of such a program, thus, many different branches are to be checked. At a branching point two computers can be allowed to operate in parallel, each of the computers checking one branch. This presupposes, however, that both of the computers comprise memories, which are updated with the information defining the branching point and the data being relevant in the branching point, i.e. so-called environment actual in the branching point. It is obvious, that the information including data constituting the so-called environment of the branching or division point can be very comprehensive.
For being able to executing search trees rapidly, thus, several computers must operate in parallel, each computer executing one branch.
A computer system comprising several computers for carrying out such an execution is described a.o. (among other things) in the article by Y. Sohma, K. Satoh, K. Kumon, H. Masazuwa, A. Itashiki "A New Parallel Interference Mechanism Based on Sequential processing", Proceedings of the Working Conference on Fifth Generation Computer Architecture, Manchester, July 1985.
In the following a computer system of the aforesaid kind is described briefly with reference to
FIG. 1 in the accompanying drawings, which Figure shows a system configuration of the known computer system.
The present invention further is described in the following with reference to embodiments shown in the accompanying drawings, in which
FIG. 2 shows a computer system according to a first embodiment,
FIG. 3 shows a computer system according to a second embodiment,
FIG. 4 shows a computer system according to FIG. 2 by way of a simplified block diagram,
FIG. 5 shows a part of the computer system in FIG. 4 in greater detail.
FIG. 6 shows schematically the physical structure of a network according to FIG. 5 in detail,
FIG. 7 shows the computer system according to a modified embodiment,
FIG. 8 shows a detail of a processor element (PEM) in FIG. 7,
FIG. 9 shows the physical structure of a network circuit according to FIG. 7 in detail.
The computer system according to FIG. 1 shows sixteen processors or so-called processing elements (PE). It further comprises a data network, designated "data network", and control network for controlling the different computers PE, designated "control network". Each processor PE is provided with a local memory of its own, which comprises a copy of the program code, and other information required for executing the program. The said control network is intended to emit signals about in the direction of the arrows, in order thereby to indicate the operation status of each processor PE. When a first processor PE is vacant at the same time as a second processor PE has arrived at a division point in a search tree, a signal is emitted via the control network, which signal controls the first processor to start the execution of one of the branches after the division or branching point. When this is to be carried out, the said data network is utilized for copying all necessary information and all data, i.e. the said environment, from the memory of the second processor to the memory of the first processor. Thereafter the two processors execute each its branch in the search tree. This procedure is thereaf

REFERENCES:
patent: 4368514 (1983-01-01), Persaud et al.
patent: 4414624 (1983-11-01), Summer, Jr. et al.
patent: 4493030 (1985-01-01), Barrett et al.
patent: 4546432 (1985-10-01), Umemura et al.
patent: 4608631 (1986-08-01), Stiffler et al.
patent: 4691280 (1987-09-01), Bennett
patent: 4757442 (1988-07-01), Sakata

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Data processing system intended for the execution of programs in does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data processing system intended for the execution of programs in, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data processing system intended for the execution of programs in will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-467197

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.