JPH02273828A - Internal sorting system - Google Patents

Abstract

PURPOSE:To set the work area at a size appropriate to the quantity of data to be sorted and to carry out an internal sorting process with high efficiency regardless of the quantity of data by allocating an internal sorting execution program and a work area to different memory spaces. CONSTITUTION:A main storage 11 includes a user program storing area 12 and a memory space 12a of the area 12 stores an internal sorting execution program. Furthermore a task control area 13 and an internal sorting work area 14 are allocated to the different memory spaces from the area 12 of the storage 11. Therefore the size of the area 14 is never limited by the scale of the program and can be set at the value appropriate to the quantity of data to be sorted. As a result, the internal sorting process is carried out with high efficiency despite a large quantity of data.

Description

[Detailed Description of the Invention] [Objective of the Invention] (Industrial Application Field) This invention relates to an internal sorting method, and in particular stores a group of records to be sorted in a working area of a memory and generates a sort string from the records. Regarding the internal sorting method.

(Prior Art) In general, sorting is a process of dividing data in a human file into several sorted data strings called sort strings, and sorting the entire data by merging the sort strings 111. It refers to In other words, the structure of the sorting process can be broadly classified into a sort string generation stage and a sort string merging stage. The generation of sort strings is called internal sorting.

Conventionally, when performing internal sorting, records to be sorted are first stored in a work area of a main storage device. Next, records are moved within the work area based on predetermined boundary values, and a sorted string string is generated by this movement.

Here, the work area for internal sorting is allocated in the main storage device in a mixed state in the same memory space as the internal sorting execution program. In other words, a predetermined memory area in the main memory is divided into multiple segments, and some of the segments are allocated for program storage.
The remaining segments are allocated as work areas.

In this way, when a program area and a work area coexist in the same memory space, the size of the work area is limited by the size of the program area. Therefore, in the case of a program that requires a relatively large storage area, the amount of memory space that can be allocated as a work area is reduced. Therefore, the work area cannot be set to a size suitable for the amount of data to be sorted, and when the amount of data is large, the performance of internal sort processing deteriorates.

(Problem to be solved by the invention) Conventionally, an internal sorting program and a work area are mixed in the same memory space, which has the disadvantage that the work area cannot be set to a size appropriate for the amount of data to be sorted. Ta.

This invention was made in view of the above-mentioned circumstances, and allows the size of the work area to be set according to the data size.
The purpose of this paper is to provide an internal sorting method that can efficiently perform internal sorting processing that is related to the amount of data.

[Structure of the Invention] (Means for Solving the Problem) The present invention provides an internal sorting method in which a group of records to be sorted is divided into arranged record strings to generate a sort string. A memory means stored in a first memory area, whose operation is controlled according to the program, and a work area of a size specified by the program is allocated to a second memory area of the memory means, and the allocated work area 6r+ The present invention is characterized by comprising an internal sorting execution means for storing records that are sorted χ-t S and generating a sorting string from the records.

(Operation) In this internal sorting method, a work area is allocated to a memory space separate from that of the internal sort execution program. The size of this work area is specified by the program. Therefore, the size of the work area is no longer limited by the size of the program, and the work area can be set to a size suitable for the amount of data to be sorted. Therefore, even when the amount of data is large, internal sort processing can be executed efficiently.

(Example) Hereinafter, the present invention will be described in detail with reference to the drawings.

FIG. 1 shows a system configuration for realizing an internal sorting method according to an embodiment of the present invention. CPU10 is a record (data) to be sorted from a human file (not shown)
1, stores it in the main storage device 11, and executes internal sort processing. This internal sorting process by the CPU 10 is executed according to an internal sorting execution program stored in the main storage device 11.

The main storage device 11 has a user program storage area 12 f
iL, memory space 1a in this user program storage 6fI area 12 stores the above-mentioned internal sorting execution program. Furthermore, the main storage device 11 includes a memory space separate from the user program allocation area 12, a task control area! 3 and an internal sorting work area 14 are respectively allocated.

The task control area 13 is a program storage area for providing an interface between the internal note execution program in the area 12a and the internal sorting work area 14. The internal sort work area 14 stores a group of records to be internally sorted, and records are moved within this work area 14 to create a sort string.

This record movement is performed according to predetermined boundary values.

Next, the work area allocation operation in the system of the present invention shown in FIG. 1 will be explained with reference to the flowchart in FIG.

First, when the internal sort execution program in the Bfi area L2a is started, the CPU II follows the work area allocation instruction in the program and uses the area specified by that instruction as the internal sort work area I4 in the main memory. 1 (step AI). In this case, the internal sort work area 14 is allocated to a memory space different from the internal sort execution program storage area 12a.

Next, an address is assigned to the internal sorting work area 14, and thereby the internal sorting work area 14
Segmen to! - A structure is introduced (step A2). Then, the address of the internal sort work area 14 is recognized by the interface command of the internal sort execution program. As a result, the internal sort execution program in the area 12a and the internal sort work area 14 are indirectly coupled through the task control area 13 (step A3).

When the work area 14 allocation process is executed in this way, a group of records to be sorted are read out from a manual file (not shown) and stored in the work area 14. Each record is then moved within its work area 14 based on predetermined boundary values to generate a sort string.

In this internal sort method, an internal sort work area 1 is located in a memory space separate from the internal sort execution program.
4 is assigned. The size of this work area 14 is
Specified by its internal sort executor. Therefore, the size of the work area 14 is no longer limited by the size of the program, and the size of the work area 14 is no longer limited by the size of the program.
4 can be set to a size suitable for the amount of data to be sorted. Therefore, even when the amount of data is large, internal sort processing can be performed efficiently.

Furthermore, since the internal sort execution program and the internal sort work area 14 exist in mutually independent memory spaces, there is no risk that the code section or data section within the program will be destroyed by data movement within the work area 14. Data protection can be achieved.

[Effects of the Invention] As described above, according to the present invention, the internal sort execution program and the work area are allocated to different memory spaces, so the work area is set to a size suitable for the amount of data to be sorted. This makes it possible to efficiently execute internal note processing regardless of the amount of data.

[Brief Description of the Drawings] Fig. 1 is a diagram showing a system configuration according to an embodiment of the present invention, and Fig. 2 is a flowchart 1 explaining work area allocation processing in the system shown in Fig. 1. be. 10...CPU, II...Main storage device, 12...
User program allocation area, 12a... Internal sort execution program storage area, 13... Task control area, 14... Work area for internal sorting. Figure 1 Applicant's agent Patent attorney Takehiko Suzue Figure 2

Claims (1)

[Scope of Claims] An internal sort method that generates a sort string by dividing a group of records to be sorted into arranged record strings, comprising: memory means in which an internal sort execution program is stored in a first memory area; The operation is controlled according to the program, and a work area of a size specified by the program is allocated to the second memory area of the memory means, and records to be sorted are stored in the allocated work area, and records are sorted from the records. 1. An internal sorting method, comprising: internal sort execution means for generating a sort string.