JPH04148340A - Transaction executing system - Google Patents

Abstract

PURPOSE:To enable the execution of a transaction at a high speed with a mini mum of main storage by storing a block to be referred to in the first execution, and executing the batch load processing of the block in the second execution. CONSTITUTION:This system is equipped with a transaction 100, transaction controlling means 120 which controls a program, processing device 170 which generates an interruption when performing access of a space which does not exist in a main storage 160 at the time of the execution of the program, and space controlling means 131 which operates the mapping of a virtual process space and a main storage space activated by the interruption. Also a reference position controlling means 130 which controls the usage positions of the transaction 100 and a virtual space 110, and a batch load means 150 which partially loads the virtual space 110 in a batch from the reference position into the main storage 160 are provided. Thus, the execution of the transaction 100 can be executed at a high speed with the minimum main storage 160.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a transaction execution method, and particularly to a virtual memory in which a process executing a transaction maps a virtual process space and a main memory space into logical partitions. The present invention relates to a transaction execution method in a transaction processing system in which the process is composed of a plurality of programs for the purpose of executing a plurality of types of transactions.

[Conventional technology]

Conventionally, when executing a process that has a virtual memory method that maps virtual process space and main memory space in logical partitions, if the target virtual space does not exist in main memory at the time of execution, the logical This was done after loading a section managed in different sections into main memory.

In addition, in order to avoid delays in the loading process, all virtual process spaces are allocated to main memory, or all programs for executing transactions are allocated to main memory.

[Problem to be solved by the invention]

In the conventional transaction execution method described above, in order to execute transactions at high speed, at least all programs related to the transaction must be allocated to main memory. Transaction and program management is complex in these systems.

Also, since it is composed of multiple subroutine groups, no consideration was given to the fact that all the programs related to transactions are allocated to main memory, which results in wasted space and the need for a large amount of main memory. .

[Means for Solving the Problems] The system of the present invention has a virtual storage system in which a process executing a transaction maps a virtual process space and a main storage space in logical partitions, and the process executes a transaction. In a transaction execution method in transaction processing that is composed of multiple programs for the purpose of executing multiple types of transactions, a transaction management means for managing transactions and programs;
A processing unit that generates an interrupt when a space that does not exist in main memory is accessed during program execution, a space management means that maps the virtual process space activated by the interrupt and the main memory space, and a transaction and virtual space The storage device has a reference position management means for managing the usage position of the reference position, and a batch loading means for partially loading the virtual space from the reference position to the main memory.

〔Example〕

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

FIG. 1 is a block diagram showing the configuration of the present invention, including a transaction 100, a virtual space 110, and a transaction management means 12 for managing transactions and programs.
0. Space management means 130 that pinks the virtual process space and main memory space during program execution; Reference position management means 140 that manages the usage position of transactions and virtual space; A reference position storage area 141 for storing, a space state storage area 131 for storing the virtual space and the state of the main memory, a main memory 160 for partially loading the virtual space from the reference position to the main memory; It consists of a processing device 170 that executes a program loaded onto the memory.

Transaction management means 120 handles transaction 1
00's transaction name 101 (denoted as Tl), determines a program (denoted as PL) to which control is to be transferred, and requests the bulk loading means 150 to bulk load a group of partitions of the virtual space that may be used by the transaction 100. , requests the processing device 170 to execute the program (Pl).

- The bulk loading means 150 loads the partition group of the virtual space into the main memory at once from the transaction name 101, the information in the reference position storage area 141, and the space state storage area 131.

The processing device 170 determines the partition number 112 in the virtual space where the execution address exists from the instruction of the program (Pl) loaded into the main memory 160, refers to the space state storage area 131, and determines the execution address exists in the main memory. If it exists, execute the command; if not, interrupt the execution of the program (Pl) and instruct the space management means 130 to load the partition with partition number 112 in the virtual space into the main memory. request.

The space management means 130 determines the main memory partition number (n) to be loaded in the main memory, loads the partition with the virtual space partition number 112, and sends a reference to the virtual space partition number 112 to the reference position management means 140. and notifies the processing device 170 of resuming execution of the program (Pl).

The reference position storage area 141 is composed of five pieces of information shown in FIG. 2, including the transaction name 201 and the virtual information that the transaction referred to in previous executions. Partition number group 2 of interpartition group
A set 203 of reference position entries combining 02 is maintained, created and managed by the reference value 1 management means 140, and referenced by the bulk load method 150.

The space state storage area 131 is configured with the information shown in FIG. 3 and indicates whether or not the partitions of the virtual space 110 have been loaded into the main memory 16C. The space management means 130 creates and manages the data, and the data is referenced by the bulk loader ε 150 and the processing device 170.

As shown in FIG. 4, the transaction management means 120 extracts the transaction name 1゜1 in process 41, and
In process 42, the program (
Pl) is determined. The process 43 is - bulk load process 150
Transaction name 10 determined in call process 41
1 loads the partition group of the virtual space 110 that was used once before at once. Process 44 requests the processing device 170 to execute the program (Pl), and ends the process.

As shown in FIG.
1, the transaction name 101 is the reference location storage area 141
Determine whether it exists within. If it exists, process 5
Move on to 2. If not, the process ends. Processing 5
2 takes out one block number from the block number group 202. If there is no partition number to be extracted, the process moves to process 55. If not, the process moves to process 53. Process 53 refers to the space state storage area 131 based on the partition number retrieved in process 52 and determines whether the virtual space corresponding to the partition number has been loaded into the main memory. If it has been loaded, the processes after process 52 are repeated; otherwise, the process moves to process 54. Process 54 issues a read command to load the virtual space partition corresponding to the partition number into the main memory, and returns to process 52. Process 55 waits for the completion of all IOs that were not issued in order to load the partitions of the virtual space into the main memory in process 54, and ends the process.

The processing device 170 retrieves an instruction in a process 61 as shown in FIG. Process 62 ends the process if the instruction is finished, otherwise moves to process 63. Process 63 calculates the execution address of the instruction. Process 64 stores the space state storage area 131 from the address calculated in process 63 and determines whether the execution address exists in the main memory. If it exists, the process moves to process 66. If not, process 6
Move on to 5. In process 66, the command is executed and the processes from process 61 onwards are repeated. The process 65 calls the space management means 130 to request loading from the virtual space to the main memory, and ends the execution.

The space management means 130 searches for an empty part of the main memory in process 71 as shown in FIG. Process 72 determines whether or not there is a free main memory partition in process 71, and if there is, the process moves to process 74. If not, the process moves to process 73. Process 73 returns an appropriate section of the main memory that is determined to be less likely to be reused to the virtual space to create a free space. Process 74 is Process 7
1 loads the virtual space partition into the main memory partition determined in process 73. Process 75 calls reference position management means 140 to notify the virtual space partition referenced by transaction 100 . Process 76 requests the processing device 170 to re-execute the program (Pl) and ends the process.

The reference position management means 140 performs processing 8 as shown in FIG.
1, transaction name 101 is referenced to 1 storage area 141
It is determined whether or not there is, and if there is, the process moves to process 83. If not, the process moves to process 82. Process 82 adds the transaction name 101 to the reference position storage area 141 as a new reference position entry. Process 83 determines whether or not the virtual partition number notified in the reference position entry exists. If it exists, the process ends; otherwise, the process moves to process 84. Process 84 adds the virtual partition number to the reference position entry and ends the process.

With the above series of processes, transactions can be executed at high speed with a minimum amount of main memory.

〔Effect of the invention〕

According to the present invention, a process that executes a transaction has a virtual memory method that maps a virtual process space and a main memory space in logical partitions, and the process executes multiple programs for the purpose of executing multiple types of transactions. Even in a transaction processing system composed of , transactions can be executed at high speed with a minimum amount of main memory.

FIG. 9 shows a comparative example with the prior art. A line 91 indicates the time during which the instruction is executed, and a dotted line 92 indicates the time during which the instruction is loaded from the virtual space to the main memory.

In the example shown in Figure 9, transactions TXI and TX2 are executed alternately, and by executing each, the main memory partition used by other transactions is destroyed (for example, the main memory used by TXl in the execution of TX2 is It is assumed that the following partitions will be discarded).

In the conventional method, when TXI is executed again after TX2 is executed, the partition on the main memory that was used by TXl in the previous execution has been discarded by the execution of TX2, so the operation to load it from the virtual space to the main memory again occurs. , it takes the same amount of time (tl±t2) as the first execution.

However, in this method, the partition to be referenced is memorized by execution twice, so in the second execution of TXI, bulk loading processing of partitions is executed, and the loading time from (t5+t6) is shortened to just t5. .

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of an embodiment of the present invention, FIG. 2 is a configuration diagram of a reference position storage area, and FIG. 3 is a configuration diagram of a main memory state storage area.
FIG. 4 is a flowchart of the transaction management means, FIG. 5 is a flowchart of the batch loading means, and FIG. 6 is a flowchart of the processing device.
FIG. 7 is a flowchart of the space management means, FIG. 8 is a flowchart of the reference position management means, and FIG. 9 is a diagram for explaining the present invention in detail. 100... Transaction, 110... Virtual space, 120... Transaction management means, 130...
・Space management means, 0... Reference position management means, 0... Bulk loading means, 0... Main memory, O... Processing device 170°

Claims (1)

[Claims] A process that executes a transaction has a virtual memory system that maps a virtual process space and a main memory space in logical partitions, and the process executes multiple types of transactions. In a transaction execution method for transaction processing consisting of multiple programs, there is a transaction management means for managing transactions and programs, a processing device that generates an interrupt when a space that does not exist in main memory is accessed during program execution, and a processing device that is activated by the interrupt. A space management means for mapping a virtual process space and a main memory space to be processed; a reference position management means for managing transactions and a usage position of the virtual space; 1. A transaction execution method comprising: bulk loading means for loading into main memory.