JPS6361335A - Data processor - Google Patents

Abstract

PURPOSE:To attain the high speed processing by providing a means operating list data stored into a memory as the data of a table form to express the position of the node with a vector and processing the data as table form data. CONSTITUTION:List data are vector-displayed by the position and a value 32 of a node 31 and stored into a memory 40. In the memory 40, only 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 the list, an one-dimensional vector to display the position of the node to assign the item successively in a depth direction is accommodated into a content part 41 and element data are accommodated into a value part 42 with a table form. For example, an element C of the list data is displayed by a content address 2-2-1-1. The data of the table form are processed by an arithmetic means. Thus, the access of the element data and the comparison of the list are facilitated and at high speed the processing of the list data is executed.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a data processing device mainly 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 LISP, 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.

Primitive functions such as fil 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 [[, ISP Machine] Information Processing Vol. 23
No. 8 pp. 752-772) Problems to be Solved by the Invention However, although improvements have been made regarding 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 going through 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 memory means for storing list data as tabular data in which node positions are expressed as vectors; The apparatus includes arithmetic means for manipulating the stored tabular data, and processes the list data 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 memory means for expressing and storing all list data in a tabular format, and 12 is an arithmetic means for operating the tabular data stored in the memory means 11.

The operation of the data processing apparatus configured as described above will be explained 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 a graphical representation of list data, and FIG. 4 shows an in-memory representation of the same data in the memory means 11. 21 is the entire memory area, 22 is the list data area occupied by one list, 31 is the list node in FIG. 3, 32 is the value, and 4 is the list data area in FIG. 4.
1 is the content of list data in memory, 4
2 is a value section. In memory, only those nodes in the list data that point to elements are extracted, and numbers are added sequentially in the length direction of the list, and con 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 ten as a section and element data as a value section. Figure 3(a), Figure 4 (al is list data X: (A (B (C))D), Figure 3(b)
), Figure 4 (1)) Beam strike data Y: (B CC
”) ), for example, element “C’ of list data X is content address
It is expressed as 2-2 1 1. Also list data X, Y
As shown in FIG. 2, they are stored in consecutive areas in the memory means 11 and managed by the start address and size, and internally they all have a table in the same format as FIG. 3 as values.

(1) When accessing element "B" of list data X, that is, the CAR part of the CDR part of list data
], 1 is performed and the second element is extracted.

(2) When comparing the list data Y with other list data Z, the calculation means 12 sequentially takes out each element of the list data Y in the memory means 11 and compares each content
The nt address section and the value section are used as a set to access the area of the list data Z in the memory means 11 and attempt matching.

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.

Further, when comparing the CADR part of list data
A similar determination is made by adding 2- to the s part and accessing the list data X area in the memory means 11 together with the value part.

(3) If garhage occurs, for example, list
When the contents of the list data area 21 previously occupied as the value of When the memory means 11 runs out of space, garbage collection can be performed by removing only the marked areas and collecting valid data areas.

As described above, according to this embodiment, by expressing list data in a table format, storing it in memory, and manipulating the data with arithmetic means, (11) It is possible to directly access the node position without performing a search from the list, and (2) it is possible to perform list matching by simply performing a comparison operation for the number of elements without list decomposition, and it is also possible to perform matching on a part of the list. (3) When garbage collection is performed, each list that becomes garbage is stored in a contiguous area, so it is possible to perform marking without extracting the partial list. These can be easily collected without having to go through the list.

Effects of the Invention As described above, the present invention provides a memory means for recording list data as tabular data in which positions of nodes are expressed as vectors, and an arithmetic means for manipulating the tabular data stored in the memory means. It is designed to process list data as tabular data.
This allows access to element data and comparison of lists without performing list traversal or list decomposition, allowing list data to be processed 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...Memory means, 12...Calculation means, 41...Table format content, 4
2...Tabular value section. Name of agent: Patent attorney Toshio Nakao (1 person) Figure 1 Figure 3 Figure 4

Claims (1)

[Claims] Data processing characterized by comprising memory means for storing list data as tabular data representing node positions in vectors, and arithmetic means for manipulating the tabular data stored in the memory means. Device.