JPH01177122A - Sort processor - Google Patents

Abstract

PURPOSE:To reduce the idle area of a memory and to sort a large quantity of data by always storing the minimum data on each non-idle bank in a sorting circuit. CONSTITUTION:A sort processor consists of a work memory 1, a sorting circuit 2, an address table 3, an input register 4, an output register 5, an input bank register 6, an output bank register 7, an output line 8, and an adder 8. Then a bank number (identifier) is added to the input data of the circuit 2 from the memory 1 to show the specific data out of an array of (k) pieces of data (k; an integer larger than 1). An address table 3 holding the maximum and minimum ones out of those (k) pieces of data is retrieved based on the value of the identifier of the data received from the circuit 2. Thus an address for the data given to the circuit 2 is obtained. As a result, the idle area of the memory 1 is reduced and a large quantity of data can be sorted.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a sort processing device, and more particularly to a sort processing device that can merge-sort a large amount of data arranged on a memory at high speed.

[Conventional technology]

Conventionally, as a sorting processing device, for example, JP-A-61-
A device disclosed in Japanese Patent No. 42031 is known. This device includes a sorting means for extracting the maximum or minimum data from k (k: an integer greater than 1) pieces of data, and a data storage means for storing the data strings sorted in advance in ascending or descending order. inputting the first data of each of the data strings to the sorting means, and repeating a merge operation of alternately performing an operation of outputting data from the sorting means and the input operation, In the sort processing device for merging a plurality of data strings stored in the data storage means, the address of the data to be input to the sorting means from the data strings arranged on the data storage means is determined from the remaining data of each data string. It was generated by shifting the value of a counter that counted numbers.

[Problem to be solved by the invention]

The above conventional technology does not take into consideration the storage efficiency of data stored in the memory, and the start address of the data string and the length of the data string can only be varied by at least a power of 2, so a large amount of free space is left in the memory. There was a problem that an area was created and the number of items to be sorted decreased.

The present invention was made in view of the above circumstances, and its purpose is to solve the above-mentioned problems in conventional sorting processing devices, reduce the free memory area, and enable sorting of large amounts of data. The object of the present invention is to provide a sorting processing device that does the following.

[Means for Solving the Problems] The above object of the present invention is to provide a sorting means for extracting the maximum or minimum data from k (k: an integer greater than 1) data, and a sorting means for extracting the maximum or minimum data from k (k: an integer greater than 1) data, data storage means for storing data strings; inputting leading data of each of the data strings to the sorting means; outputting the data from the sorting means; and the inputting operation. In a sorting processing device that merges a plurality of data strings stored in the data storage means by repeating a merging operation that alternately executes , the address of the largest or smallest data among the data strings is held. providing an address table, and adding an identifier to the input data from the data storage means to the sorting means, indicating which of the data strings the data is;
This is achieved by a sort processing apparatus characterized in that means is provided for indexing the address table based on the value of the identifier of the data output by the sorting means and obtaining the address of the data input to the sorting means.

[Effect]

In the sort processing device according to the present invention, the data output from the sorting means is appended with the identifier, and the identifier has a value 1, for example, 1, 2, . ... k, and the addresses held in the address table are the addresses of the maximum or minimum data of the data string corresponding to the value of the identifier, respectively.

The sorting means stores one piece of data from each data string, and outputs the largest or smallest data among them. At this time, in the sort processing device according to the present invention, in order to read the next data from the data string in which the output data was stored, the at-tray table corresponding to the value of the identifier added to the data is used. Read the data indicated by the address inside, and set the address to 1.
A series of operations of advancing by one data and storing the read data in the sorting means are repeated until all data in the data string is exhausted.

As a result, sorting is performed, and addresses to be set in the address table can be selected such that the free space in the memory is minimized.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram of a sort processing device showing an embodiment of the present invention. In the figure, 1 is a work memory, 2 is a sorting circuit, 3 is an address table, 4 is an input register, and 5 is a
is an output register, 6 is an input bank register, 7 is an output bank register, 8 is an output line, and 9 is an adder.

The work memory 1 stores k data strings (banks) sorted in ascending order in advance, and the data output from the work memory 1 is transferred to the input register 4 and combined with the contents of the input bank register 6. and stored in the sorting circuit 2.

The data taken out from the sorting circuit 2 is sent to the output register 5.
1 is transferred, and the data portion is output via the output line 8. The output bank register 7 is connected to the input of the input bank register 6 and the address of the address table 3, and the output of the address table 3 is connected to the address of the work memory 1 and the adder 9. The output of adder 9 is connected to the input of address table 3.

The operation of this embodiment configured as described above will be explained below.

First, the minimum data for each bank in the work memory 1 and the bank number that identifies each bank are input to the sorting circuit 2 via the input register 4 and the input bank register 6 which is a part of the input register 4. do. The sorting circuit 2 is a circuit that outputs the smallest of the input data, and the smallest of the input data is stored in the output register 5. At this time, output register 5
The output bank register 7, which is a part of the k data, stores the number of the bank that held the smallest data among the k data.

Next, from the bank that held the minimum data mentioned above,
Next, in order to retrieve the smaller data, the output bank register 7
Read the atray table 3 addressed by the value of . The address table 3 holds the next address to be read from each bank, and after reading with the value of the output bank register 7, the adder 9 converts the address to the next address of the bank in the work memory 1. is updated and stored to indicate the data address of .

By reading the work memory 1 at the above address, transferring the contents of the output bank register 7 to the input bank register 6, and inputting it to the sorting circuit 2, the minimum data of each non-empty bank is always stored in the sorting circuit 2. It is now possible to keep it in place, and margins can be created. At this time, the adder 9 adds a certain value to the address of certain data in each bank.
For example, each piece of data is arranged so that adding the "data length" becomes the address of the next data in the bank.

According to this embodiment, only the bank number needs to be added to the sorting circuit 2, the data length within the sorting circuit 2 does not become long, and performance is improved.

Note that the present invention is not limited to the above-mentioned embodiments, and includes, for example, a sorter that can sort in either ascending or descending order, a sorter that stores bank identifiers in a work memory, and a sorter that stores output data in a work memory. It is also easy to configure a sorter or the like that stores and performs multi-stage merging.

〔Effect of the invention〕

As described above, according to the present invention, there is provided a sorting means for extracting the maximum or minimum data from k (k: an integer greater than 1) data, and a sorting means for extracting the maximum or minimum data from k (k: an integer larger than 1) data, and It has a data storage means for storing a column, inputs the leading data of each of the data columns to the sorting means, and alternately performs an operation of outputting data from the sorting means and the input operation. A sort processing device for merging a plurality of data strings stored in the data storage means by repeating a merging operation; , an identifier indicating which of the data strings the input data is from the data storage means to the sorting means is added, and the address is determined by the value of the identifier of the data output from the sorting means. Since a means for indexing the table and obtaining the address of the data to be input to the sorting means is provided, the remarkable effect is that it is possible to realize a sort processing device that can reduce the free memory area and sort a large amount of data. It is something that plays.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a sort processing device showing an embodiment of the present invention. 1: Work memory, 2: Sort circuit, 3 Near address table, 4: Input register, 5: Output register, 6: Input bank register, 7: Output bank register, 8: Output line, 9: Adder.

Claims (1)

[Claims] 1. It has a sorting means for extracting the maximum or minimum data from k (k: an integer greater than 1) data, and a data storage means for storing k data strings sorted in advance in ascending or descending order. Then, by inputting the first data of each of the data strings to the sorting means, and repeating a merge operation in which the operation of outputting data from the sorting means and the input operation are performed alternately, the data is In a sort processing device for merging a plurality of data strings stored in a storage means, an address table is provided for holding the address of the maximum or minimum data among the k data strings, and the data storage means is connected to the sorting means. An identifier indicating which of the data strings the data is is added to input data to the input data, and the address table is indexed based on the value of the identifier of the data output by the sorting means, and the data is sent to the sorting means. A sorting processing device characterized in that it is provided with means for obtaining an address of input data.