JP2015011382A - Period specified transfer system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To prevent transfer processing from concentrating on a particular day in transfer services of financial institutions, and disperse the transfer processing from the particular day to an alternative day.SOLUTION: A transfer system includes: reception means for receiving input of transfer data about the account transfer; performance data acquisition means for acquiring performance data showing a processing load state in a computer; execution day allocation means for allocating an execution day of the account transfer corresponding to the transfer data, on the basis of the transfer date, in a period between a reception date of the input of the transfer data and a transfer date; execution possibility determination means for determining whether or not execution of the account transfer is possible on an allocated execution day, on the basis of performance data and the number of transfer processing; and discount rate calculation means for calculating a discount rate of a transfer official fee about the account transfer, on the basis of the transfer date and the allocated execution day.

Description

  The present invention relates to a period designation transfer system and a period designation transfer method, and in particular, it is possible to prevent an increase in processing load due to concentration of transfer processes on a specific date for account transfer processes at financial institutions. The present invention relates to a period specified transfer system and a period specified transfer method.

  Currently, transfer services using ATMs (automated teller machines) and the Internet are provided by financial institutions such as banks. In the above-described transfer service, a transfer process to a transfer destination account is executed on the transfer date designated by the user.

  Financial institutions also provide a service called a comprehensive transfer service. In this general transfer service, based on a transfer request that includes a large number of transfer details (transfer destinations) received from the user, transfer processing from the specified account of the user to the multiple transfer destinations is performed in a batch on the specified date. Executed.

  By the way, the transfer process tends to be concentrated on a specific day such as the end of the month. From the standpoint of a financial institution that provides a transfer service, the concentration of the transfer process on a specific day may increase the processing load of the system that executes the transfer process and may become inefficient. The financial institution needs to cope with an increase in hardware resources of the system in order to execute a large amount of transfer processing on the specific day, which is a great burden for the financial institution. Therefore, it is desirable for the financial institution to distribute the transfer processing while avoiding the concentration of the transfer processing on a specific day.

  As one of the reasons why the above-mentioned transfer processing is concentrated on a specific day, in the transfer service provided by a conventional financial institution, the transfer request was accepted by allowing the user to specify the transfer date as the "specific date". It is. However, from the user's point of view, it is not always necessary to execute the transfer process on a specific date, and if it is "until a specific date", the transfer process may be executed at any time during that period. Is also present. In such a situation, it is not always necessary for the user to designate a specific date and execute the transfer process.

JP 2004-272926 A JP 2008-217346 A JP 2003-022409 A JP 2003-022468 A JP 2005-128814 A

  As described above, it is desirable for a financial institution that provides a transfer service to avoid the concentration of transfer processes on a specific day and to distribute the transfer process from the specific day to another day.

  On the other hand, in the above-mentioned comprehensive transfer service, the transfer process from the same user to multiple transfer destinations is executed, but the transfer process is distributed separately on different days up to the batch transfer unit of the comprehensive transfer This is not preferable for the convenience of the user's transfer management, and batch transfer processing to a plurality of transfer destinations in comprehensive transfer is processed on the same day as in the past.

  In Patent Document 1, based on the current account information, a balance with a date and time when there is no subsequent account processing is virtually generated, and an account with a date and time is based on the balance with the date and time. An invention is disclosed in which account processing that has been conventionally performed in batch processing can be processed in parallel during online processing by executing processing. However, although the invention described in Patent Document 1 has the effect of reducing the processing load to some extent, it does not equalize the processing load.

  In Patent Document 2, the load generated in the online system is monitored, it is determined whether or not a predetermined threshold is exceeded, and if the predetermined threshold is exceeded, some users are guided to an alternative site to guide the user. An invention is disclosed that can be distributed and reduce the load on commercial websites. However, in the invention described in Patent Document 2, it is necessary to construct a separate alternative site, and eventually it is required to increase the processing capacity of the entire system.

  In Patent Document 3 and Patent Document 4, by appropriately setting the advance payment deadline date and the discount amount, it is possible to distribute reception dates for receiving storage service requests from payers, and to provide storage services ( For example, a financial institution or the like) discloses an invention capable of leveling a business load. However, the inventions described in Patent Document 3 and Patent Document 4 do not execute the process up to assigning the payment processing date in consideration of the load status of the system providing the storage service and the number of processing cases, and discounting the fee. Even if a certain amount of load can be expected, a more optimal load distribution cannot be expected. In addition, it is not guaranteed that batch transfer processing to a plurality of transfer destinations in the above-described comprehensive transfer service is performed on the same day. Further, in Patent Document 3 and Patent Document 4, the discount amount is calculated according to the result of comparing the prepaid due date and the reception date of the storage service from the payer, but the prepaid due date is actually set. However, depending on the load status of the system, payment processing may not be possible in advance, and there is a possibility of payment processing on the payment due date. This is not preferable from the viewpoint of the service provider.

  In Patent Document 5, the system load is predicted in a system that provides a financial transaction service, the prediction result is presented to the user, and the user is guided when the system load is low, thereby leveling the system load. An invention that can do this is disclosed. However, although the invention described in Patent Document 5 can be expected to have a certain degree of load distribution, it is still assumed that the user who performs the transfer in the peak time zone and the number of processing cases cannot be grasped in advance. As a result, more optimal load distribution cannot be expected. Moreover, it does not solve the problems in the above-described comprehensive transfer service.

  The present invention has been made in view of such problems, and accepts a transfer request for a specified period from a user of the transfer service in advance, and the system load and the number of received transfer processes within the specified period. In view of the above, it is an object to provide a system and method capable of distributing transfer processing.

  In order to solve the above-mentioned problem, the period specified transfer system according to the present invention is a computer system for distributing transfer process execution dates, and is a receiving means for receiving input of transfer data related to account transfer, The transfer data includes a transfer date and the number of transfers, performance data acquisition means for acquiring performance data indicating a processing load state in the computer, a period between the transfer data input reception date and the transfer date , On the basis of the transfer date, an execution date assigning means for assigning an execution date of the account transfer corresponding to the transfer data, and on the assigned execution date based on the performance data and the number of transfer processes Execution feasibility judging means for judging whether or not execution is possible, the transfer date and the assigned execution date Based on, characterized in that it comprises a discount rate calculation means for calculating the discount rate of the transfer fee relating to the direct deposit.

  According to the period specified transfer system according to the present invention, a transfer request specified in advance is received from a user of the transfer service, and the transfer specified from the reception date in consideration of the system load and the number of received transfer processes. Since the transfer process is assigned on any day before the period, the transfer process can be optimally distributed. In addition, among the transfer processes designated by a plurality of periods, priority is provided and the transfer process is distributed according to the priority, so that more optimal load distribution can be achieved. In addition, the priority includes the number of collective transfer batch transfers, and the priority is determined in consideration of the number of transfers, so the batch transfer process to multiple transfer destinations in the comprehensive transfer service described above is executed on the same day. can do.

The example of the network structure of the period designation | designated transfer system which concerns on this invention is shown. It is a block diagram which shows the example of a structure of the period designation | designated transfer system which concerns on this invention. The example of the transfer request reception data storage part 300 based on one Embodiment of this invention is shown. The example of the transfer data storage part 400 based on one Embodiment of this invention is shown. The example of the discount rate data storage part 500 based on one Embodiment of this invention is shown. The example of the past performance prediction data storage part 600 based on one Embodiment of this invention is shown. It is a flowchart which shows the example of a series of processes which the period designation | designated transfer system which concerns on one Embodiment of this invention performs. It is a figure which shows the example performance value monitored at the example record of the transfer request reception data storage part 300 in the process shown in FIG. 7, and a process time. It is a figure which shows the target value used in order to determine transfer process execution availability based on one Embodiment of this invention. It is a flowchart which shows another example of a series of processes which the period designation | designated transfer system which concerns on one Embodiment of this invention performs. It is a figure which shows the example record of the transfer request reception data storage part 300 in the process shown in FIG. 10, the example performance value monitored at the time of a process, and the example record of the past performance prediction data storage part 600. It is a figure which shows the example record of the transfer request reception data storage part 300 in the process shown in FIG. 10, and the example record of the past performance prediction data storage part 600. FIG.

  Hereinafter, a periodical transfer system according to an embodiment of the present invention will be described in detail with reference to the accompanying drawings.

  FIG. 1 is a diagram illustrating an example of a network configuration of a period designation transfer system 100 according to an embodiment of the present invention.

  The bank system 101 is a system that provides an Internet banking service, a comprehensive transfer service, and the like, and is a system that includes the main functions of the period designation transfer system according to the present invention. The bank system 101 is configured to communicate with 103a, 103b,..., 103n (hereinafter “client computer 103”) via a network 102 such as the Internet.

  The client computer 103 is a terminal used by a user who makes a transfer request, makes a transfer request from the client computer, and the result is displayed on a display unit of the client computer 103.

  The bank system 101 described above can be composed of one or a plurality of server computers. Further, the client computer 103 described above can be an information terminal device such as a personal computer, a workstation, or a PDA having a communication function. The server computer and the information terminal device are computers including a central processing unit (CPU), a memory, a storage device, and the like, and are integrated by the processing device (CPU) processing a computer program stored in the memory or the storage device. Therefore, the processing according to the present invention can be performed and the function can be realized. Note that the above-described system configuration is for illustration, and does not limit the system configuration in which the present invention can be implemented.

  Next, with reference to the block diagram of FIG. 2, the configuration of the above-described period designation transfer system will be described in detail. The bank system 101 includes a control unit 201, a main storage unit 203, an auxiliary storage unit 204, an input unit 205, an output unit 206, a network I / F 207, and a database 208, and these elements are connected via a system bus 202. The

  The control unit 201 is also called a central processing unit (CPU), performs control of each of the above-described constituent elements and data calculation, and reads various programs stored in the auxiliary storage unit 204 to the main storage unit 203 and executes them. To do.

  The main storage unit 203 is also called a main memory, and stores input data received by the bank system 101, computer-executable instructions, data after arithmetic processing by the instructions, and the like.

  The auxiliary storage unit 204 is a storage device typified by a hard disk (HDD) and is used when data and programs are stored for a long period of time. Since the main storage unit 203 has a relatively smaller storage capacity than the auxiliary storage unit 204, it is used for temporary data storage, arithmetic processing, and the like, whereas the auxiliary storage unit 204 stores necessary data and information. Used for long-term storage and storage. That is, when the control unit 201 executes a program to perform data calculation, the necessary data or program is read from the auxiliary storage unit 204 to the main storage unit 203, and the calculation result data is stored and stored for a long time. In this case, the control unit 201 writes the calculation result data in the auxiliary storage unit 204.

  The input unit 205 receives a transfer request from the client computer 103 via the network I / F 207.

  The output unit 206 receives a transfer request from the user, executes the transfer process, and then outputs the execution result. The execution result is transmitted to the client computer 103 via the network I / F.

  The database 208 includes data tables such as a user data storage unit 400, a transfer request reception data storage unit 500, a transfer data storage unit 600, a discount rate data storage unit 700, and a past performance prediction data storage unit 800, which will be described later.

  FIG. 3 is a diagram showing an example of the transfer request acceptance data storage unit 300 of the period designation transfer system according to the present invention. The transfer request reception data storage unit 300 is a database table for specifying a transfer date and the like when the above-described period-designated transfer request is made. The transfer request reception data storage unit 300 uses the “user code”, “transfer date”, “transfer request reception date and time” which is the date and time when the period-designated transfer request is received, and batch transfer processing when using the general transfer service. "Transfer number" and "use registration flag" indicating the number of payments, that is, the number of transfer destinations. As described above, the user who uses the transfer service does not necessarily want to perform the transfer process on a specific date, and may perform the transfer process “by a specific date” in some cases. Such a user makes a transfer request by designating a transfer date indicating how long the transfer process should be performed (hereinafter referred to as “period-designated transfer”), so 1 is set in the use registration flag. The As for the transfer request in which “1” is set in the use registration flag, the transfer process is performed at an arbitrary timing in consideration of the processing load in the period from the date of accepting the request to the transfer date. On the other hand, for the transfer process in which “0” is set in the use registration flag, the transfer process is performed on the transfer date as usual. In this embodiment, the record in the data storage unit is deleted when the target transfer process is performed, but instead of deleting the record, an item such as a “processed flag” is provided and processed. It may be determined whether or not the processing has been completed by setting a value in the item of the record.

  FIG. 4 is a diagram showing an example of the transfer data storage unit 400 of the period specifying transfer system according to the present invention. The transfer data storage unit is a database table for specifying all transfer processes regardless of whether or not the transfer is a period-specified transfer as described above. The transfer data storage unit 400 includes a “transfer type” indicating whether the transfer is a normal transfer or a general transfer, and “transfer account information” “financial institution code”, “branch code”, “account type”, “account number”. ”And“ transfer requester name ”, and“ transfer account information ”,“ financial institution code ”,“ branch code ”,“ account type ”,“ account number ”, and“ recipient name ”.

  FIG. 5 is a diagram showing an example of the discount rate data storage unit 500 of the period designated transfer system according to the present invention. The discount rate data storage unit 500 designates a period-designated transfer and the transfer date changes (the transfer process is performed on an arbitrary date from the date when the transfer request is made to the transfer date), It is a database table for specifying the discount rate for discounting. The discount rate data storage unit 500 includes a “discount rate code”, “days from the designated date” in which the actual transfer process was performed in several stages, and a “discount rate” corresponding thereto. Prepare.

  FIG. 6 is a diagram showing an example of the past performance prediction data storage unit 600 of the period designation transfer system according to the present invention. The past performance prediction data storage unit 600 is a database table that stores information obtained by collecting system performance values such as the number of transfer processes and CPU usage rate at a specific time when the bank system has performed a transfer process in the past. The past performance prediction data storage unit 600 displays the “monitoring date and time (From)” and “monitoring date and time (To)” indicating the monitoring time and the date and time of the end, “the number of transfer processes” performed at that time, and “ CPU usage rate ”and“ memory usage rate ”. In the present embodiment, the monitoring interval is performed at an interval of 1 hour, and the data record is created in that unit, but it is not limited to that unit. Further, in this embodiment, only “the number of transfer processes” is described as the processing target, but it is not only the transfer process that increases the load on the bank system 101. For example, the number of balance inquiries, etc. The number of other processes may be recorded. Furthermore, it is not limited to the CPU usage rate and the memory usage rate exemplified to indicate the performance value of the bank system, and other measurement items such as an I / O load may be acquired.

  The performance value monitoring described above may be performed by using a commonly used monitoring tool, or by periodically issuing a Linux (registered trademark) Sar command or the like. Good. The control unit 201 of the bank system periodically monitors performance values by the monitoring method described above, and inserts records into the past performance prediction data storage unit 600.

  Next, a series of processing executed by the period designation transfer system according to the embodiment of the present invention will be described using the flowchart of FIG. This embodiment is based on the premise that processing is performed on April 15, 2013, and the situation that is the premise of processing will be described with reference to FIG.

  FIG. 8A is an example of the transfer request acceptance data storage unit 300 described with reference to FIG. As shown in Fig. 8 (a), 5 period-designated transfer requests with a transfer date of April 25, 2013, and one period-designated transfer with a transfer date of April 15, 2013 It is assumed that a transfer request (hereinafter referred to as “non-period designated transfer”) was received from each user on April 15, 2013. The five period-designated transfers shown in Fig. 8 (a) all have a transfer date of April 25, 2013, so from April 15, 2013 when the transfer was requested to April 25, 2013 The process is executed on any day. On the other hand, one non-period designated transfer (user code is “555555555”) is executed on April 15, 2013.

  Based on the above description, the description returns to the flowchart of FIG. As described above, the control unit 201 of the bank system 101 constantly monitors the performance value even in a time zone other than the processing in the flowchart, and stores the performance data in the past performance prediction data storage unit 300 (S700).

  First, a transfer request is received from a user of the transfer service, and registration of the transfer process is input from the client computer 103. The input of the transfer process is transmitted to the bank system 101 via the network I / F 211 of the client computer 103. The input unit 205 of the bank system 101 receives the input of the transferred transfer process via the network I / F 207 (S701). Here, the input of the transfer process means data related to the transfer including the user code and account information of the transfer requester, the account information of the transfer destination, and the transfer date.

  Next, the control unit 201 of the bank system 101 inserts a transfer data record corresponding to each transfer process into the transfer data storage unit 400 based on the received input of the transfer process (S702). At the same time, a transfer request reception data record corresponding to each transfer process is inserted into the transfer request reception data storage unit 300.

  Next, the control unit 201 acquires all unprocessed records from the transfer request acceptance data storage unit 300 (S703). The acquired records are read one by one in ascending order of the transfer date, usage registration flag, and data reception date. In other words, if the transfer date is the earliest and there are multiple records with the same transfer date, the non-period specified transfer takes precedence (but only if the transfer date of the non-period specified transfer is the same day), and all of them are the same In the case of, processing is preferentially executed from the earliest data reception date. In the present embodiment, it is assumed that only six records shown in FIG.

  Next, the control part 201 acquires the target value of the number of transfer processes in the bank system 101 (S704). Here, the target value of the number of transfer processes is the target value of the number of transfer processes per hour in the bank system 101, and in this embodiment, the transfer process date is assigned so as not to exceed the value. As shown in FIG. 9, the target value is set for each date of each month and stored in a data file or a database table. Referring to FIG. 9, on the first day of the month and at the end of the month, the number of processes is larger than other days according to the rule of thumb so far, so the target value is set slightly higher. Since the process of this step is executed on April 15, 2013, 1400 target values are acquired. In the present embodiment, the target value is set for each day. However, one common target value may be set for all the days, and each of the 365 days may be set according to the processing load characteristics. A target value may be set. In addition, since the processing load can vary depending on the time of day, the target value may be determined every hour according to the characteristics of the processing load of each time of day. Furthermore, the target value described above may be dynamically changed based on past performance values. For example, as a result of the transfer processing being distributed according to the present invention, the average value of the number of processing cases per day is calculated, and the target value is periodically updated.

  Next, the control unit 201 refers to the performance value monitored in S700 and acquires the current performance value of the bank system 101 (S705). As shown in FIG. 8B, the monitoring time is 9:17 on April 15, 2013 when this step is executed, the number of transfer processes is 442, the CPU usage rate is 41%, and the memory The usage rate is 33%.

  Next, for the transfer request acceptance data record read in S703, it is determined whether or not transfer processing is possible based on the target value acquired in S704 and the performance value referenced in S705 (S706). Here, in the present embodiment, there are six records of transfer request acceptance data to be processed, and one of them is a non-period designated transfer, so the transfer process is given priority.

  Since the number of non-period-designated transfers shown in FIG. 8A is 400, it is determined that the processing can be executed because the total number of the current processing cases 442 is less than the target value of 1400. (Yes in S707).

  In the above example, it is determined that the transfer process for the first record can be executed. However, if it is determined that the transfer number is further large and cannot be executed (No in S708), the next transfer request data record is read. Then, it is determined whether or not execution is possible.

  Next, the control unit 201 executes the transfer process for the record of the transfer request reception data for which the transfer process is determined to be executable in S706 (S708). Specifically, a record is acquired from the transfer data storage unit 400 based on the user code of the transfer request acceptance data, and the debit processing is executed from the transfer requester's account based on the record, and the transfer destination account Execute the deposit process.

  Next, the control unit 201 executes record acquisition from the discount rate data storage unit 500 (S709) and a fee calculation process (S710). However, since the transfer process is a non-period specified transfer, the discount is not eligible, and this step Is skipped.

  Next, the control unit 201 reads the second record of the transfer request acceptance data acquired in S703, that is, the five records that are period-designated transfers in this embodiment one by one, and the above-described S705. Thru | or the process of S710 is performed.

  The transfer dates of the five period-designated transfers in FIG. 8A are all April 25, 2013, so there is no priority inferiority at this point. In this way, when the transfer due dates of a plurality of records are the same day, the above determination is made with priority given to the data reception date and time over the previous record.

  As described above, when the transfer date is the same date, the data reception date is determined with priority over the previous record, so from the first record (user code is “123456789”) in FIG. Whether transfer processing can be executed or not is sequentially determined (S707). If it can be executed, the transfer processing is executed (S708).

  Next, the control unit 201 acquires a record from the discount rate data storage unit 500 (S709). Here, in the present embodiment, the transfer process described above is performed on April 15, 2013, which is 10 days before April 25, 2013, which is the transfer date. As shown in FIG. 5, a record having a discount rate code “1” is acquired.

  Next, the control unit 201 calculates the transfer fee by multiplying the transfer fee by the discount rate “60%” acquired in S709 for the transfer fee in the executed transfer process (S710).

  Next, the control unit 201 reads the third record of the transfer request acceptance data acquired in S703, executes the above-described processing of S705 to S710, and repeats the processing until all the records are executed.

  As described above, since the transfer process is executed on any day in the period from the date of accepting the transfer request to the transfer date, it is avoided that the transfer process is concentrated on a specific date as before. , Processing load can be distributed. In addition, by applying discounts to period-designated transfers, the transfer requester is motivated to perform period-designated transfers, and the transfer fee is discounted according to the date on which the transfer process was actually executed. A discount rate according to the result of diversification can be applied. In addition, since the transfer process is given priority over the transfer process with the earlier data reception date and time, the higher discount rate will be applied to the transfer processed earlier from the transfer date. As a result, it becomes a motivation to make a transfer request earlier, as a result, the period between the transfer request date and the transfer due date becomes longer, the bank system has more freedom to assign the transfer process, and the system load is distributed. Can be planned.

  Whether or not to execute the transfer process in S706 of the present embodiment is determined based on the target value of the number of transfer processes and the number of transfer processes among the performance values monitored in S700. For example, the target value may be a hardware resource usage value such as a CPU usage rate, a memory usage rate, or a combination thereof, and is subject to execution determination in the current hardware resource usage value. The use value of the hardware resource that is expected by processing the number of transfers may be predicted, and whether or not the execution is possible is determined by comparing the predicted value and the target value.

  Next, a series of processing executed by the period designation transfer system according to another embodiment of the present invention will be described using the flowchart of FIG. The present embodiment is based on the assumption that processing is performed on April 15, 2013, and the situation that is the premise of the processing will be described with reference to FIG.

  FIG. 11A is an example of the transfer request acceptance data storage unit 300 described with reference to FIG. As shown in FIG. 11 (a), it is assumed that six period-designated transfer requests with a transfer date of April 25, 2013 were received from each user on April 15, 2013. Also in this embodiment, when there are a plurality of unprocessed transfer request acceptance data records, processing is performed with priority from the earliest transfer date, but in this embodiment, the transfer due dates of six transfer request acceptance data records are processed. Are all on the same day, the priority is determined based on the past performance values in the bank system 101. Details will be described later.

  First, as in the process of FIG. 7, the performance value is always monitored in a time zone other than this flowchart (S1000). Next, the input of the transfer process is received (S1001), and a record is inserted into the transfer data storage unit 400 and the transfer request reception data storage unit 300 (S1002).

  Next, an unprocessed record is acquired from the transfer request acceptance data storage unit 300, and all records are read (S1003).

  Next, the control part 201 acquires the target value of the number of transfer processes in the bank system 101 (S1004). Since the processing in this step is executed on April 15, 2013, 1400 values that are target values on April 15, 2013 are acquired (see FIG. 10).

  Next, the control unit 201 refers to the performance value monitored in S1000 and acquires the current performance value of the bank system 101 (S1005). As shown in FIG. 11B, the monitoring time is 9:17 on April 15, 2013 when this step is executed, the number of transfer processes is 442, the CPU usage rate is 41%, and the memory The usage rate is 33%.

  Next, the control unit 201 acquires a record of performance values of the previous year's performance from the past performance prediction data storage unit 600 (S1006). Here, the previous year record is the record for April 15, 2012, which is the same day of the previous year on April 15, 2013, in which this step is executed. In FIG.11 (c), the record of the said performance value is shown

  Next, the control unit 201 refers to the number of transfers in the transfer request reception data record read in S1003, and sets the transfer processing priority based on the target value acquired in S1004 and the past performance value acquired in S1006. Determination is made (S1007). Here, the determination is made based on the above-described past performance value so as to be a value that approximates the target value. Details will be described with reference to FIG.

  Referring to FIG. 11 (c), the number of transfer processes in the time zone from 9:00 to 10:00 on April 15, 2012 is 430, and the same time zone in the same time zone on April 15, 2013. The number of cases is expected (assuming that the time period from 9:00 to 10:00 on March 15, 2013 is also 430 cases). The same applies after 10:00. Then, when the number of processing cases of the six transfer request acceptance data records in FIG. 11A is added so as to approach the target value with respect to the number of transfer processing cases in each time zone in FIG. As shown.

  For example, as shown in FIG. 11C, since the number of transfer processes in the time period from 9:00 to 10:00 on April 15, 2013 is 430, the six transfer requests in FIG. The number of transfer of each received data record is added to 430, and the transfer process of the record that is closest to the target value of 1400 is assigned. It can be seen that the above method is the closest to the fifth record (the user code is “444444444”) (the number of transfers of the record is 980, and adding to 430 results in 1410, 1400 most closely). Further, as shown in FIG. 11 (c), since the number of transfer processes in the time period from 10:00 to 11:00 on April 15, 2012 is 520, the five transfer requests in FIG. 11 (a). When the transfer number of each received data record is added to 520, it can be seen that the record with the closest target value is the fourth record (user code is “333333333”) (800 + 520 = 1320). ). If the transfer date is assigned by the same determination method after 11 o'clock on April 15, 2013, as shown in Table 1, 1228 cases (assign the transfer process of the second record in FIG. 11A) and The number of transfer processes can be made equal to 1229 (assigning the transfer process of the third record in FIG. 11A) and the target value.

  The priority of the transfer process is determined by the method described above, and the control unit 201 performs the performance acquired in S1005 for the fifth record (user code is “444444444”) among the six transfer request reception data records. Based on the value, it is determined whether or not the upper limit value of the transfer process in the bank system 101 is exceeded (S1008). Here, the upper limit value of the number of transfer processing cases is the theoretical value per hour calculated based on the catalog value of the computer hardware on which the bank system 101 is mounted, the past actual value, the result value of the performance test, and the like. This is the upper limit of the number of transfer processing cases, and is a predetermined value. As described above, even if it is determined that the number of transfer processing cases is equal, the actual performance value in the time zone in which this step is executed (the performance value referred to in S1005) is processed in comparison with the past actual value. The number of cases may increase significantly. Therefore, the number of transfer request reception data records determined as described above is added to the number of transfer processes that is the performance value at that time, and it is determined whether or not the above-described upper limit is exceeded. In the present embodiment, assuming that the upper limit value is 1800, the number of performance values processed in S1005 is 442 as shown in FIG. 11B, and the number of transfer request acceptance data records is 980. Since this is a case, 442 cases + 980 cases = 1422 cases, and the upper limit is not exceeded, so the determination of whether or not execution is possible is determined as Yes (Yes in S1008). On the other hand, when it is determined No in this determination, priority determination is performed again in S1007.

  Next, the control unit 201 executes a transfer process (S1009), obtains a record from the discount rate data storage unit 600 (S1010), and calculates a transfer fee (step S708 to S711 in FIG. 7) ( S1011), it is determined whether or not the transfer request acceptance data record read in S1003 is the last (S1012), and if there are still unprocessed records, the steps of S1005 to S1012 are repeated.

  As described above, the transfer process can be distributed by determining the date for executing the transfer process so as to approach the target value based on the value of the number of transfers for a plurality of records having the same transfer due date. . Specifically, the transfer process of the fifth record in FIG. 11A described above is conventionally processed on April 25, 2013, and the load of the transfer process on that day is concentrated. On the other hand, according to the present embodiment, optimal load distribution can be realized by assigning 980 processes to the time zone with the lowest load on the day with the lowest load. At the same time, the batch transfer processing to a plurality of transfer destinations in the above-described comprehensive transfer can maintain the unit of batch processing as in the past. Furthermore, not only the target value for the number of transfer processes described above, but also whether or not the upper limit is exceeded, the current system load is significantly higher than the performance value of the past actual value. A case where an event occurs can be dealt with.

  Note that the past performance values described above are calculated not only in the previous year, but also on the current day (May 15, 2013) or transfer by calculating each performance value for the last several years at the same time using the least square method. The performance value on the due date (May 25, 2013) may be predicted. That is, a value that minimizes the sum of squares of deviations of performance values for the most recent years may be obtained. In addition, the performance value may be predicted by the same method as described above with reference to the performance value at the same time in the last few months, not the previous year. Furthermore, the performance value for the last several years as described above or the average value of the performance values for the last several months may be calculated to predict the performance value for the current day or the transfer date.

  Next, another specific example of determining the priority based on the number of transfer processing cases will be described with reference to FIG.

  FIG. 12A is an example of the transfer request acceptance data storage unit 300 described with reference to FIG. As shown in FIG. 12 (a), it is assumed that six period-designated transfer requests with the transfer date of April 30, 2013 were received from each user on April 25, 2013. .

  12B and 12C are examples of the past performance prediction data storage unit 600 described with reference to FIG. FIG. 12B is a record showing the performance value of April 25, 2012, one year ago, for predicting the processing load of the bank system 101 on April 25, 2013 when the transfer request was made. On the other hand, FIG. 12C shows the performance value of April 26, 2012 one year ago for predicting the processing load of the bank system 101 on April 26, 2013, which is the day after the transfer request date. It is a record.

  A specific example of the processing will be described based on the flowchart of FIG. Since S1000 to S1003 in FIG. 10 are the same, description thereof is omitted.

  In S1004, the control unit 201 acquires the target value of the number of transfer processes in the bank system 101, but not only the target value of April 25, 2013, which is the execution date of this step, but also the next day, 2013 4 The target value for month 26 is also acquired. Referring to FIG. 9, it can be seen that the target value for April 25, 2013 is 1500 and the target value for April 26, 2013 is 1,400.

  Subsequent processes in S1005 and S1006 are the same as those described above, and a description thereof is omitted. The priority determination process in S1007 will be described with reference to FIG. Referring to FIG. 12B, the number of transfer processes in the time zone from 9:00 to 10:00 on April 25, 2012 is 610, and the same processing is also performed in the same time zone on April 25, 2013. The number of cases is expected (assuming that the time period from 9:00 to 10:00 on April 25, 2013 is also 610 cases). The same applies after 10:00. Then, when the number of processing cases of the six transfer request acceptance data records in FIG. 12A is added so as to approach the target value with respect to the number of transfer processing cases in each time zone in FIG. As shown.

  For example, as shown in FIG. 12B, since the number of transfer processes in the time period from 9:00 to 10:00 on April 25, 2013 is 610, the six transfer requests in FIG. The transfer number of each of the received data records is added to 610, and the transfer process of the record that is closest to the target value of 1500 is assigned. And it can be seen that the closest approximation in the above method is the first record (user code is “123456789”) (the number of transfer of the record is 900, and adding to 610 results in 1510, Approximate 1500 cases). The transfer date is assigned by the same determination method after 11:00. In the time zone from 12:00 to 13:00 on April 25, 2013, it is assumed that the number of processing cases is estimated to be about 1290 from the previous year's results, and the subsequent time zone on the same day also has a similar load. In this case, since the period-designated transfer shown in FIG. 12A may be transferred by April 30, 2013, it is assigned to April 26, 2013 the next day. As shown in Table 2, in the time zone from 9:00 to 10:00 on April 26, 2013, 980 transfer processes of the fifth record (user code is “444444444”) in FIG. Assign. After 10 o'clock, assignment is performed in the same manner as 920 cases and 800 cases, and transfer processing is assigned so as to approach the target value of 1400 on April 26, 2013.

  Finally, the steps of FIGS. 1008 to S1012 are executed. Since these processes are the same as those described above, description thereof will be omitted.

  As described above, the description of the period designation transfer system according to the present invention has been described in detail, but the specific data structure such as the transfer request reception data storage unit 300 described in the embodiment is merely an example, Changes may be made without departing from the matters claimed.

102 network 202 system bus

In order to solve the above-mentioned problem, the period specified transfer system according to the present invention is a computer system for distributing transfer process execution dates, and is a receiving means for receiving input of transfer data related to account transfer, The transfer data is a transfer date , an identifier indicating whether it is a period-designated transfer or a date-designated transfer, and a reception means including a transfer number, a performance data acquisition means for acquiring performance data indicating a processing load state in the computer system, , An execution date assignment means for allocating an execution date of the account transfer corresponding to the transfer data based on the transfer date and the priority of the identifier in a period between the transfer data input reception date and the transfer date a is the priority of the identifier is a value indicating the date specified transfer has priority, the execution date assignment unit, wherein Determination and determining the load state judging means the load state of the from performance data computer system, on the basis of the load state and the transfer count, whether it is possible to the direct deposit executed execution date the allocated And a discount rate calculating unit that calculates a discount rate of a transfer fee related to the account transfer based on the transfer date and the assigned execution date.

Claims (11)

A computer system for distributing transfer process execution dates,
Accepting means for receiving transfer data related to account transfer, wherein the transfer data includes a transfer date and the number of transfers,
Performance data acquisition means for acquiring performance data indicating a processing load state in the computer system;
An execution date assignment means for assigning an execution date of the account transfer corresponding to the transfer data based on the transfer date in a period between the acceptance date of the input of the transfer data and the transfer date;
Load state determination means for determining a load state of the computer system from the performance data;
Based on the load state and the number of transfer processes, execution feasibility determination means for determining whether or not the account transfer can be executed on the assigned execution date;
A computer system comprising: a discount rate calculation means for calculating a discount rate of a transfer fee related to the account transfer based on the transfer date and the assigned execution date.   The computer system according to claim 1, wherein the execution date assigning unit assigns the execution date based further on a date and time when the transfer data is input.   The computer system according to claim 2, wherein the execution date assigning unit assigns the execution date further based on the number of transfers. A database storing performance data acquired by the performance data acquisition means;
Second performance data acquisition means for acquiring past performance data corresponding to the period from the database;
Second load state determination means for determining a past load state corresponding to the period of the computer system from the past performance data;
Further comprising
The computer system according to claim 1, wherein the execution date assigning unit assigns the execution date based further on a past load state corresponding to the period. A method executed by a computer for distributing transfer processing execution dates,
A step of accepting input of transfer data relating to account transfer, wherein the transfer data includes a transfer date and the number of transfers;
Obtaining performance data indicating a processing load state in the computer system;
Assigning an account transfer execution date corresponding to the transfer data based on the transfer date in a period between the transfer data input acceptance date and the transfer date;
Determining a load state of the computer system from the performance data;
Determining whether or not the account transfer can be executed on the assigned execution date based on the load state and the number of transfer processes;
Calculating a transfer fee discount rate for the account transfer based on the transfer date and the assigned execution date.   6. The method of claim 5, wherein assigning the execution date includes assigning the execution date further based on a date and time of receipt of the transfer data input.   7. The method of claim 6, wherein assigning the execution date includes assigning the execution date based further on the number of transfers. Storing the acquired performance data in a database;
Obtaining past performance data corresponding to the period from the database;
Determining a past load state corresponding to the period of the computer system from the past performance data;
Further comprising
The method according to claim 5 or 7, wherein the step of assigning the execution date includes assigning the execution date further based on a past load state corresponding to the period.   A program for causing a computer to execute the method according to any one of claims 5 to 8.   A computer-readable storage medium storing the program according to claim 9.   A computer comprising a processor and a memory, wherein the memory stores a program for causing the processor to execute the method according to any one of claims 5 to 8.

Images