JPS63276122A - Data block arranging method - Google Patents

Abstract

PURPOSE:To obtain a data block arranging method in a short processing time together with estimation of said processing time by reading the data on the data blocks based on the addresses of an address table and an address link table. CONSTITUTION:The priority data '04', '02'... stored in data blocks BLK(0)-(n) of a random arranged data block area DB1 are read successively. Then the addresses of the data blocks are registered into an address table AT in accordance with those priority data. In case many data of the same priority exist like '02', the addresses of these data are registered into an address link table ALT. Then the data on the area DB1 are read out based on the addresses of both tables AT and ALT.

Description

[Detailed Description of the Invention] [Summary] A data block arranging method in which a large number of data blocks are arranged in a random order, and the data blocks are rearranged according to numerical values of data representing data block priorities in the data blocks. In this system, each data block is registered in an address table and an address link table corresponding to numerical values of priority, and rearrangement is performed while referring to these two tables.

[Industrial Application Field] The present invention relates to a data block arranging method for rearranging a large number of data blocks according to numerical values of priority data in the data blocks.

When a large number of data blocks are arranged in a random order and the microprocessor reads the data in the data blocks and processes the work according to the data block priority stored in the data blocks, the microprocessor The processor first needs to perform a data block arrangement process in which the randomly arranged data blocks are arranged in order from the highest priority to the lowest priority.

[Prior art] Figure 6 shows a large number of data blocks BLK (0) to BLK.
FIG. 2 is a conceptual diagram of a memory area in which (n') are arranged in a random order. Each data block has addresses (0), (1), and (2) in order from the top.

...(b) is attached, and the number in parentheses following BLK indicates the address of the data block. Each data block contains data representing the data block priority (numeric values “04”, “02”, “01”, etc.)
is stored.

FIG. 7 shows a large number of data blocks B as shown in FIG.
12 is a flowchart illustrating a conventional method for rearranging LK (0) to BLK (n) according to data values representing priorities. In this flowchart,
rBLK (i), YDJ
It is expressed as

In the conventional method, data block BLK at address (0)
Step 1) Compare the priority data value of the data block in order from (0) with the data value indicating the priority of the next data block BLK (1).
, the rear data block BLK(1) has a high priority in this case, so the blocks are exchanged (step 2).
), then data block BLK(1) at address (1)
) and the data values indicating the priority of the following data block BLK (2) are compared with each other (step 3). In this case as well, since the following data block BLK (2) has a higher priority, the blocks are exchanged. (Step 4
).

Hereinafter, by going through steps 5 to 12, the data block with the data value "00" representing the priority will be placed at address (0), and the data block will be placed at address (1).
The data blocks with the data value "01" representing the priority are subsequently rearranged in the same manner so that they are arranged in descending order of priority.

FIG. 8 shows the arrangement of data blocks used in each step shown in FIG.

[Problems to be Solved by the Invention] In the conventional method of arranging data blocks using such a procedure, if a data block with a high priority is located at the end of the entire data (the one with a larger address), the data block There is a problem in that the replacement is performed many times and processing time is required. Another problem is that the processing time varies depending on how the data blocks are arranged, making it impossible to estimate the processing time.

The present invention has been made in view of these points, and it is an object of the present invention to provide a data block arrangement method that requires a short processing time and can estimate this processing time based on the number of data blocks.

Measures to solve problem E] FIG. 1 is a flow chart showing the principle of the present invention.

The present invention is a method in which a large number of data blocks are arranged in a random order, and the data blocks are rearranged using priority data representing the priority order of the data blocks in the data blocks. (
Step 1): Read the priority data in each data block sequentially, register the address of the data block in the address table corresponding to the priority data, and if there are many data blocks with the same priority, block the data block. The data blocks are read out and arranged in accordance with the addresses registered in the address table and the addresses registered in the address link table (step 3).

[Operation] By reading the priority data in each data block once, an address table and an address link table are created, and by reading the data in the data blocks according to the addresses in these tables, it is possible to rearrange the data, and the processing can be accelerated.

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

FIG. 2 is a block diagram showing an example of an apparatus for implementing the method of the present invention. In the figure, numeral 1 denotes data block rearrangement means, which uses a microprocessor (CPU). 2 is a keyboard, and 3 is a display means such as a CRT, which are used for data input, program creation, etc. 4 is a rewritable memory (RAM), and 5 is an external storage means, which are connected to each other via a data bus DB.

Here, a large number of randomly arranged data blocks exist in the RAM 4 or the external storage means 5, and the address table and address link table are provided in a certain area in the RAMJ.

FIG. 3 is a conceptual diagram of the operation when data blocks are rearranged by the method of the present invention using the apparatus shown in FIG. In the figure, DBI is an area consisting of a plurality of randomly arranged data blocks BLK (0) to BLK (n), and each data block BLK (0) to B
Priority data representing the data block priority is stored in LK (n).

AT is an address table area where multiple blocks AR
8(0) to AR3(n), and the upper row of each block can store the start address of the data block, and the lower row can store the end address of the data block. ALT is an address link table consisting of a plurality of blocks LNK (0) to LNK (n). DB
2 is a data block area A that stores rearranged data.

The sorting method of the present invention sequentially reads priority data "04", "02", etc. in each data block BLK(0) to BLK(n) of data block area DB1, and The address of that data block is registered in the address table AT in response to
) If the address exists, register it in the address link table ALT, and add it to the registered address table AT.
The data in the data block area DB1 is read out according to the address in the address link table ALT, and the data in the area D is read out.
They are stored in B2 in order.

FIG. 4 shows the address table 8T in the procedure described above.
This is a page showing details of address registration in the address link table ALT.

Data block BLK (0) is registered as priority data (ED) “04”, so address table A
Data block BLK (
Step 11 is responsible for registering the address OO of 0) in the upper and lower rows. Below, each data block BLK (1
>, BLK (2), . . . in the same manner as steps 12.13. . . . to create an address table and an address link table. At each step, ■, ■.

The indications indicated by ... are the arrows ■, ■, ... in Figure 3.
It corresponds to the flow shown in .

FIG. 5 is a flowchart of the operation of rearranging data blocks according to the address table and address link table. Here, an example is shown in which the items are arranged in order from the highest priority (the smaller the numerical value of the priority data, the higher the priority).

In the address table AT, addresses of data blocks are stored in descending order of priority as block start addresses (upper row) and block end addresses (lower row), and address link table ALT stores addresses in the order of data block priority. It shows which data blocks have the same shading order data value from the start of the data block registered in to the end of the data block.

Therefore, as shown in FIG. 5, the address table AT is first read from the beginning (block AR8(0)), and according to the address (EDI) "03", the data at the corresponding address "03" in the data block area DB1 is read. Block BLK (3) is stored in block BLK' (0) at the start address of data block area DB2 (step 21). Below, steps 22.23. ...1! As a result, the data blocks are sorted and stored in the data block area DB2 in descending order of priority from the top.

Note that if the address table AT is read from the back and rearranged according to the address, the data blocks can be rearranged from the top to the lowest priority.

[Effects of the Invention] As explained in detail above, according to the present invention, the number of data accesses can be minimized, and the number of data accesses can be estimated based on the number of data blocks, which depends on the content of the data. Therefore, data blocks can be rearranged at high speed and within a constant processing time.

[Brief explanation of the drawing]

FIG. 1 is a flowchart showing the principle of the present invention, FIG. 2 is a block diagram of the configuration of an apparatus that implements the method of the present invention, FIG. 3 is a conceptual diagram of the operation of rearranging data blocks according to the method of the present invention, and FIG. 4 is a flowchart showing the address table registration procedure, Fig. 5 is a flowchart of data block rearrangement, Fig. 6 is a conceptual diagram of data blocks, Fig. 7 is a flowchart of the conventional method, and Fig. 8 is a flowchart of the step numbered in Fig. 7. FIG. 3 is a diagram showing a state of data block arrangement. In FIG. 3, DB1 and DB2 are data block areas, AT is an address table, and ALT is an address link table. Fig. 4 Flowchart of the conventional method of 1) Fig. 7 Diagram showing arrangement of data blocks etc. Fig. 8 Cocoon

Claims (1)

[Claims] A method in which a large number of data blocks are arranged in a random order, and the data blocks are rearranged using priority data representing the priority order of data blocks among the data blocks, the method comprising an address table and An address link table is provided (
Step 1): Read the priority data in each data block sequentially, register the address of the data block in the address table corresponding to the priority data, and if there are many data blocks with the same priority, block the data block. register the address in the address link table (step 2), and sequentially read and arrange the data blocks according to the address registered in the address table and the address registered in the address link table (step 3).
A data block arrangement method characterized by: