JPS5842895B2 - History information high-speed processing method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention provides a method for high-speed processing of historical information, particularly when reading and writing to a large-capacity file that is a ledger in, for example, a banking system. The present invention relates to a high-speed history information processing method that is capable of writing (history information) to a history information memory every time an event changes, and this process can be performed at high speed.

Conventionally, in the case of the above-mentioned banking system that processes in real time, a magnetic tape device has been used as a recording medium for recording the recovery data.

This is also due to the following reasons. That is, when the magnetic tape device is in a running state and stores data that is given one after another, the access time is shorter than that of other devices such as magnetic drum devices.

However, in the case of the above-mentioned magnetic tape device, if the above-mentioned data is given at discrete times, the data will be recorded at widely discrete positions on the magnetic tape.
For example, this is not necessarily effective when considering reading the data for recovery processing.

When focusing only on the aspect of recovering old data, it is sufficient that only relatively recent data is stored, and if it can be guaranteed that access time can be shortened, a method of overwriting data on a magnetic drum device, etc.% The present invention takes the above points into consideration and aims to provide a high-speed processing method that allows recovery data to be written at high speed on an endless memory such as a magnetic drum device.

If you need to save the above historical information for a long time,
By writing once on the endless memory, the history information given at discrete times can be set to 1, and the compressed information can be written onto the magnetic tape device. For example, it becomes possible to increase the amount of information that can be written on one roll of magnetic tape.

In order to achieve the above object, the history information high-speed processing method of the present invention includes a large-capacity file device, a data processing device that performs read/write processing on the large-capacity file device, and a data processing device that performs read/write processing on the large-capacity file device. In a data processing system equipped with a history information memory that stores history information in predetermined division units, the history information memory is configured such that the end of the recording area of the memory continues from the beginning of the recording area of the memory. The recording area of the history information memory is divided into a plurality of flock areas, and key information indicating the existence of the block area is stored in each divided block area. In addition to storing the data in common in the block area, the ranking data of the history information is written in the nearest block area captured based on the key information at the time of writing in association with the history information, and the history information is used. The present invention is characterized in that it is possible to determine the writing time of the history information based on the ranking data.

This will be explained below with reference to the drawings.

FIG. 1 shows an embodiment of a real-time data processing system to which the present invention is applied, FIG. 3 shows the configuration of an embodiment of the present invention, and FIG. An explanatory diagram for explanation is shown.

In FIG. 1, 1 person and 1B are data processing devices, 2 people and 2B are main storage devices, 31 to 3-n.
4-1 to 4-n are large-capacity files such as disk pack memory, which correspond to ledgers in the banking system. 5 is a disk pack memory control device, 6 is a history information memory consisting of an endless memory such as a magnetic drum device, #ATAPE$- and #
BTAPE represents a magnetic tape device that stores the contents of the history information memory for long-term preservation.

Large capacity files 4-1 to 4-m corresponding to the above ledger
Information corresponding to the account number is stored in the button, so to speak.
When notified from the terminal device corresponding to each branch that only a deposit or withdrawal has been made to the account, the data processing device IAt or 1B stores the above information in the position corresponding to the account number on the large capacity file. Information is recorded.

That is, via the disk back memory control device 5,
Information is recorded.

In this case, for the illustrated system, when one data processing device, for example, 1A accesses one ledger, for example, 4-1 to record an account, the other data processing device 1B Access to the ledger 4-1 is prohibited.

That is, the data processing device 1A performs a read process by applying "reserve" to the ledger 4-1, rewrites the necessary information, and then restores the "reserve" of the ledger 4-1. "multiply.

During that time, the disk back memory control device 5 maintains the "reserve" state for the ledger 4-1, and releases the "reserve" state by the "relino".

As described above, when one data processing device performs a write process, the one data processing device also writes the write data to be written to the ledger 4-1 into the history information memory 6.

That is, recovery data is recorded on the history information memory 6 to cope with problems such as failures in the large-capacity file device.

As mentioned above, one data processing device can handle, for example, four ledgers.
Rewrite the necessary information while "reserving" 1.

Therefore, if a failure occurs in one data processing device with the above-mentioned "reserve" applied, the ledger 4-1 becomes unusable.

In other words, it becomes unusable from the data processing device 1B side.

In this case, the healthy data processing device 1B is only prohibited from making further changes to the specific account that the faulty data processing device 1A was attempting to change, and the ledger 4-1 is
needs to be "released".

In order to deal with such a situation, one person in the data processing device writes recovery data to the history information memory 6. Even if you record it...

Furthermore, as in the case of the system shown in FIG. When 1B accesses the ledger, the recovery data is stored in the history information memory 6 as described above.

In such a situation, if a failure occurs in the large-capacity file device that is the ledger and the above recovery data is to be used, it is necessary to check which of the above data processing devices, ie, 1 or 1B, updated the ledger more recently. It is necessary to know.

Therefore, when writing recovery data into the history information memory 6 as well as writing into the ledger, counter information is written together so that it is possible to know which recovery data is the latest one.

As mentioned above, in the system as shown in FIG. 1, it is necessary to write the recovery data and the like into the history information memory 6 at high speed.

However, when the history memory 6 shown in the figure is a memory such as a magnetic drum device, usually on average 1/1/2 of the magnetic drum is used.
A waiting time equivalent to two rotations is required, and when writing is performed in real time as described above, it is necessary to shorten the access time.

FIGS. 2 and 3 show the construction of an embodiment of the present invention.

Symbols IA, 2A, and 6 in the figure correspond to those in FIG. 1, respectively, and 7 to 7 people respectively correspond to the number of pieces of information (or information storage area) corresponding to the number of multiplexed processes inside the data processing device 1A.
F is each band (or track) in the history information memory 6
, 8A is write data to the history information memory, LI[
, [[ is a division unit (hereinafter referred to as a record) that divides history information, C0NTL is control information, 9th to 9F is a husband register, 10 is a plus 1 circuit, 11 is a write head, 12-0 to 12-3 are Each block is one in which one band is divided into four blocks, 13 is a header section indicating the head of band 7A, 14 is a key information storage section, 15 is a counter section, and 16 is a data storage section. It represents.

Data processing device For example, when one person updates a ledger, the information corresponding to the account number is stored in the main storage 2A from the ledgers 4-1 to 4-m shown in FIG.
The system reads the contents of the two main memories, performs an update process, and writes the updated information from the two main memories to the ledger.

In this case, when one data processing device executes multiple processing, an area for storing the information person to F corresponding to each of the multiple processing is set aside on two main storage devices.

When considering the information A corresponding to one process performed by two main storage devices, it is written into the history information memory 6 as described above each time an event changes.

That is, one band, for example 7A, on the memory 6 is allocated for recording information A, and data is written on the band 7A.

The following information A is 1 as record ■ in event 1, 1
It is stopped as a record ■ by pressing the button on events 1 and 2, it is stored as a record ■ on events 1 and 3, and it is stored as a record ■ on the following event 2゜1.
I will explain it as something that is stopped...

At this time, when information A is updated for events 1 and 1, record 1 is written on band 7A, and information A is updated after event 1.1 and the button is pressed for events 1 and 2. Records I and ■ are written together on band 7A, and information A is updated as events 1, 1 . Event 1 after passing L2,
3, records ■, ■, and ■ are simultaneously written on band 7A.

Furthermore, when the information is updated in accordance with event 2 and 1, record (2) is written on band 7A.

However, in order to indicate which event the information was updated by pressing the write button, ranking data is recorded in the control information C0NTL shown in FIG. 2 as described later.

That is, when generating the write data 8A to be written into the history information memory 6 from the two main storage devices by pressing the button in FIG. 2, for example, nine registers to 9F and a plus one circuit 10 are created. The ranking data in the control information C0NTL is (1, 1L (1, 2), (1, 3), (2, i).

(2, 2) It is updated as follows.

In this case, the write data 8 shown in FIG.
A is a set of records I, u, H, records II, m, I
The data is combined in one of the following formats: records III, I, and IIO.

For this reason, as will be described later, information on at least the latest three past events remains on the band 7A on the history information memory 6, for example.

Of course, if it is sufficient to store the information for the latest past event as history information in the memory 6, then when one record corresponding to each of the above events is obtained, that record can be used independently. It is sufficient to write it on the memory 6 as the above-mentioned write data 8A.

As described above, the history information is written into the history information memory 6, but when performing real-time processing as shown in FIG. 1, a delay in the writing time to the history information memory 6 becomes a problem.

Therefore, in the case of the present invention, one band, for example, on IA, is generally divided into blocks as shown in FIG. 3, and the same key information is given as the key information in each block. There is.

Therefore, when writing the history information with the magnetic head 11, the history information is written into any one of the four blocks/12-0 to 12-3 shown in FIG. be able to do so.

That is, in general, when writing, the key information is used to search for a write block and write into a predetermined block, but in the present invention, as described above, the same key information is stored in one band. Because they are recorded in each block above, the four blocks above appear to be exactly the same block and the button is pressed, and the block that is found earliest is selected, and the will be written to 1.

Therefore, the average write access time to the history information memory 6 is the sum of the write time and the waiting time corresponding to, for example, 1/2 revolution of the magnetic drum divided by the number of blocks, and is significantly shortened.

That is, it becomes possible to write to a history memory such as a magnetic drum device at a speed sufficient to match the real-time processing system shown in FIG.

As mentioned above, one band of the history information memory 6, for example 7A.
However, as described above, it is completely impossible to predict which event history information will be written into each of the four blocks shown in FIG. 3, for example.

For this reason, as mentioned above, the control information C shown in FIG.
Ranking data (1, 1) in 0NTL.

(L 2 L (1, 3), (2, 1), ...
・I try to record things like this.

The contents of the history information memory 6 need to be read from the memory 6 when performing recovery processing or when transferring to the magnetic tape device 7A shown in FIG. 1 above.

At the time of reading, the information in, for example, four blocks shown in FIG. 3 is as shown in, for example, FIG. 4.

The state of the button shown in FIG. 4 can be considered to be the result of passing through the following states.

That is, (a) record 2, which was written in events 1 and 1, was written to #1 block 12-1.

6) Next, the record ■, which was previously stopped at events 1 and 2, was written to the #O block 12-0 together with the record I mentioned above.

(c) Next, the record (2), which was set as 1 in events 1 and 3, was written to the #2 block 12-2 together with the records I and (2) as the write data 8A.

(d) Next, record I, which was stopped in event 2 and 1, was written to #O block 12-0 as the write data 8A, together with the existing records ① and ②.

As a result, the records I that were grouped together by clicking the buttons for events 1 and 1 were overwritten and erased by the records I that were stopped at events 2 and 1.

(e) Next, record (2), which was previously stopped in events 2 and 2, is written to #O block 12-0 as the write data 8A together with the existing records (2) and (2).

As a result, the record (2) that was previously stopped during events 1 and 2 was overwritten and erased by the record H that was compiled during events 2 and 2.

It can be assumed that there was a process like this.

As is well known, by performing the above overwriting,
Since information is written on the information without performing erasing processing on the information that has already been written on the band, only a trace of the original information remains in the areas where writing is not performed at that time. becomes.

1. As can be seen from the above-mentioned writing mode, in FIG.
The record ■ existing on the #1 block 12-1 and the record ■ existing on the #2 block 12-2 have the same contents, and are set to 1 in events 1 and 1.

Records ■ and #2 existing on the leftover #O block 120
The record ■ existing on block 122 has the same contents and is the record recorded in events 1 and 3.

In the case shown in FIG. 4, an update mode for clicking the latest past three events is stored on the #O block 12-0.

Of course, in the case of the configuration in which only one record is written as one write information 8A as described above in the write information 8A shown in FIG. 2, if writing is performed in the same form as shown in FIG. 4, # Event 2 on 0 block 12-0
．． There is a record ■ in #2, #1 block 12-
There is a record ■ for events 1 and 3 on #1, a record ■ for events 1 and 3 exists on #2 block 12-2, and a record ■ for events 1 and 3 exists on #3 block 12-3, which corresponds to any event. The record will no longer exist.

At the time of reading out the information shown in FIG. 4, 1
The contents of all blocks on one band, eg TA, are read out.

Then, control information C0 regarding the contents of each of these blocks
Ranking data in NTL (2, 2), (1, 1),
(1,3).

(0,0) is checked.

In the case shown in Figure 4, the contents of the #O block are the latest information, and the updated information in events 2 and 2 is the record ■
Then, it is determined that the update information that can be pressed on events 2 and 1 is record ■, and that the update information that can be pressed on events 1 and 3 is record ■.

That is, update information for the latest three events is held.

As explained above, according to the present invention, for example, in a real type processing system such as a banking system,
It becomes possible to hold history information on a memory such as a magnetic drum device while overwriting it one after another at a high speed.

Then, when copying data to the magnetic tape devices 7A, 7B shown in FIG. 1 for long-term storage, it becomes possible to write data on the magnetic tape device in one place.

[Brief explanation of drawings]

FIG. 1 shows an embodiment of a real-time data processing system to which the present invention is applied, the second rotation and FIG. An explanatory diagram is shown. In the figure, 1A and 1B are data processing devices, 2A3- and 2B are main storage devices, 3-1 to 3-n are terminal devices, 4-1 to 4-m are large-capacity files, and 6
represents the history information memory, and 7A to 7F represent bands (or tracks) in the history information memory.

Claims (1)

[Claims] 1. A large-capacity file device, a data processing device that performs read/write processing for the large-capacity file, and a predetermined division unit for history information of read/write processing for the large-capacity file device. In a data processing system equipped with a historical information memory stored in The recording area of the history information memory is divided into a plurality of h block areas, and in each of the divided block areas, key information indicating the existence of the block area is commonly stored in each block area, and the key information is written. When the history information is used, the ranking data of the history information is written in the nearest block area captured based on the key information in correspondence with the history information, and when the history information is used, the history information is written based on the ranking data. A high-speed history information processing method that is characterized in that it is possible to determine the writing point in time. 2. The data processing device reads out the recorded information for one round on the endless memory, and based on the ranking data, identifies the latest historical information among the plurality of historical information associated with the ranking data. A high-speed history information processing method according to claim 1, wherein the history information is extracted. 3 Each time the history information sets the division unit to 1, the data processing device sets
The history information height according to claim 1 or 2, characterized in that information in one or more delimited units is overwritten together in one selected block area of the history information memory. Speed processing method.