JPS6361334A - Data processor - Google Patents

Abstract

PURPOSE:To attain the high speed processing by providing a first memory storing list data as the data of a table form expressed the position of a node by a vector, transferring a part of the first memory to a second memory and operating it. CONSTITUTION:List data are vector-displayed by the position and a value 32 of a node 31 and stored into the first memory 11. In the memory 11, the node to point out an element in the node of list data is extracted, a number is successively given in the length direction of a list, and an one-dimensional vector to display the position of a node to assign an item successively in the depth direction is accommodated at a Content part 41 and element data are accommodated at a value part 42 with a table form. For example, an element C is displayed by a content address 2-2-1-1. A part is transferred from the first memory 11 to the second memory 12 by a transferring means 13 and processed by an arithmetic means 14. Thus, the access to the element data and the comparison of the list are facilitated and the processing of the list data is executed at high speed.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a data processing device primarily intended for use in the field of artificial intelligence.

BACKGROUND OF THE INVENTION In recent years, the field of artificial intelligence has been actively researched as one of computer applications. In this field, it is necessary to process structured data, and therefore LIMP, a language that can handle structured data, is widely used. Since it is inefficient to execute the LISP language on a general-purpose computer, special-purpose machines with various improvements have been developed.

These dedicated machines were improved mainly from a linguistic perspective, and the typical improvements made are shown below.

+11 Primitive functions such as CAR and CDR are executed at the microprogram level.

(2) TAG for handling generic data types
data format.

(3) Provide a hardware control stack to speed up stack processing.

(References (LIMP Machine) Information Processing Vol.

23 Fish 8 pp752-772) Problems to be Solved by the Invention However, although improvements have been made to the execution system of the language as described above, the representation of structure data inside a computer is basically based on the order of elements. Because it uses pointers (hereinafter referred to as lists) to express relationships and connections, the following problems arise.

(11) Accessing individual elements involves building the list from the top of the list, which is inefficient.

(2) Matching processing takes time because it must sequentially break down the list into elements.

(3) Garbage collection is difficult.

The present invention has been made in view of the above-mentioned problems, and it is an object of the present invention to provide a data processing device that can perform list processing efficiently with a simple configuration.

Means for Solving the Problems In order to solve the above problems, the data processing device of the present invention includes a first memory means for storing the positions of nodes of list data as tabular data expressed in vectors, and an associative memory means. a second memory means comprising a memory and storing a portion of the tabular data stored in the first memory means; and arithmetic means for manipulating the tabular data stored in the second memory means, so that the list data can be processed at high speed as tabular data.

Effect of the present invention With the above-described configuration, the list data is numbered sequentially in the length direction of the list, and the position of a node is represented by a one-dimensional vector to which items are sequentially assigned in the depth direction, and points to an element within the list data. It extracts things and processes them by expanding them into a table with element data, and allows access to element data and comparison of lists without going through lists or decomposing lists.

Embodiment Hereinafter, a data processing apparatus according to an embodiment of the present invention will be described with reference to the drawings. FIG. 1 shows the configuration of a data processing device in an embodiment of the present invention.

In FIG. 1, 11 is a first memory means for expressing and storing all list data in a table format, and 12 is an associative memory for storing part of the data stored in the first memory means 11. A second memory means; 13 is a transfer means for transferring tabular data between the first memory means 11 and the second memory means 12; and 14 is an arithmetic means for operating the tabular data stored in the second memory means 12. be.

The operation of the data processing apparatus configured as described above will be described below with reference to FIGS. 1, 2, 3, and 4.

FIG. 2 shows the structure of the memory area in the first memory means 11, FIG. 3 shows the graphic representation of list data, and FIG. 4 shows the representation of the same data in the associative memory in the second memory means 12. In Figure 2, 21 is the entire memory area, 22 is the list data area occupied by one list, and 22 is the list data area occupied by one list.
In the figure, 31 is a list node, 32 is a value, in FIG.
is the Value section. In the associative memory, only those nodes in the list data that point to elements are extracted,
Sequential numbering in the length direction of the list is a one-dimensional vector representing the position of the node to which items are sequentially assigned in the depth direction.
It is expressed in a table format with n ten as a section and element data as a value section. Figure 3 (δ) and Figure 4 fat represent list data X: (A (B (C))D), Figure 3 i
bl.

FIG. 4 (bl is a representation of list data Y: (B (C)), for example, if element N"C" of list data X is content address 2-2
−1 Represented by 1. The list data X and Y are stored in the first memory means Il as shown in FIG.
It is stored in the t area and managed by the start address and size, and internally it has a table in the same format as in FIG. 3 as all values.

+11 When accessing element "B" of list data X, that is, the CAR part of the CAR part of the CDR part of list data
The corresponding data is transferred to the second memory means 1 by the transfer means 13.
2, and is converted into an associative memory format as shown in FIG. 4 f8) and stored. Next, the calculation means 14 inputs the content address to the second memory means 12.
When accessed at 2 1-1, content is matched with part 41 and the second element is extracted.

(2) When comparing the list data Y with other list data Z, both data in the list data area 21 in the first memory means 11 are similarly transferred to the second memory means 12 by the transfer means 13, respectively, as shown in FIG. It is converted and stored in the associative memory format shown in . Next, calculation means 14
sequentially takes out each element of the list data Y in the second memory means 12 and stores each content address.
The second memory means 1 stores the s part and the value part as cents.
The area of list data Z in 2 is accessed and matching is attempted. If matching is successful for all elements of list data Y, both data are determined to be equal, and if even the - element does not match, it is determined that they are not equal at that point.

Also, C of the CADR part of list data X, that is, the CDR part.
When comparing the AR section and the list data Y, both data in the first memory means 11 are similarly converted into the associative memory format as shown in FIG. 4 fal and fbl and stored in the second memory means 12. The calculation means 14 sequentially takes out each element of the list data Y in the second memory means 12,
A similar determination is made by adding 2- to each content address section and accessing the area of list data X in the second memory means 12 together with the value section.

(3) When garbage occurs, for example, when the contents of list X are updated and the list data area 21 previously occupied as the value of Add and record the size. When an area shortage occurs in the first memory means 11, garbage collection can be performed by removing only the areas to which marks have been added and collecting valid list data areas.

As described above, according to this embodiment, list data is expressed in a table format, transferred to an associative memory, and manipulated by a calculation means, so that each element in the fi+ list can be accessed from the top. (2) List matching can be performed by simply accessing the associative memory for the number of elements without performing list decomposition, and matching on part of a list is also possible. This can be done by only correcting the addresses without extracting the partial list, and (3) Garbage When performing 7-di collection, each list that becomes garbage is stored in a continuous area, so
These can be easily collected without having to carry out a search for marks.

Effects of the Invention As described above, the present invention comprises a first memory means for storing the positions of nodes of list data as tabular data expressed in vectors, and an associative memory, and the first memory means stores data in the first memory means. a second memory means for storing a part of the data in the tabular form; a transfer means for transferring data between the first memory means and the second memory means; It is equipped with arithmetic means for manipulating stored tabular data, and is designed to process list data as tabular data. Access to element data and comparison of lists can be performed using list traversal or list decomposition. This allows the processing of list data to be performed at high speed.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a data processing device according to an embodiment of the present invention, FIG. 2 is a block diagram of a memory area in the first memory means of FIG. 1, and FIG. 3 is a block diagram of list data stored in the first memory means. FIG. 4 is a schematic diagram in which the same data is expressed in an associative memory stored in the second memory means. 11...First memory means, 12...Second memory means, 13...Transfer means, 14...
...Arithmetic means, 41...Tabular format conte
n is part, 42...Tabular value part. Name of agent: Patent attorney Toshio Nakao and one other person cy ward ~ q Figure 3 Figure 4

Claims (1)

[Claims] It is composed of a first memory means for storing the positions of nodes of the list data as tabular data expressed in vectors, and an associative memory, and stores a part of the tabular data stored in the first memory means. a second memory means for storing; a transfer means for transferring data between the first memory means and the second memory means; and a data transfer means for manipulating tabular data stored in the second memory means. A data processing device comprising: arithmetic means.