JP5849772B2 - Information processing apparatus and information processing method - Google Patents

Description

  Some embodiments according to the present invention relate to an information processing apparatus and an information processing method.

  In a computer system having a plurality of console devices such as a mainframe, the message is normally held until message output to all console devices selected for output is completed. Thus, for example, if there are multiple console devices with different I / O (Input / Output) performance, message output to the console device with the lowest I / O performance becomes a bottleneck, and message management resources are exhausted. There was a thing.

  In Patent Document 1, when the number of output messages that are overloaded in one of the console devices exceeds the number of output messages that are overloaded in the entire console device, the console device is It has been disclosed to prevent the influence on the entire computer system due to the concentrated output load on the low-speed console device by stopping.

Japanese Patent Laid-Open No. 3-198126

  However, if the console device is stopped, the entire computer system may become inoperable. Although it is conceivable that only a console device having a small influence even if it is stopped is set as a stop target, such an implementation limits the effect of reducing the load.

  Some aspects of the present invention have been made in view of the above-described problems, and an object of the present invention is to provide an information processing apparatus and an information processing method that can suppress resource depletion without stopping the console apparatus. I will.

  The information processing apparatus according to the present invention includes an input unit that receives input of messages to be output to a plurality of console devices, a temporary storage unit that temporarily stores one or more messages input from the input unit, and a storage unit that stores A plurality of management means each managing a queue in which entries for outputting stored messages to a plurality of console devices are registered; and an output means for outputting messages having entries registered in the queue to the console device. Selecting a queue for registering an entry corresponding to a new message from among the plurality of queues managed by the plurality of management units according to the output performance of the message from the output unit to the console device. Means.

  The information processing method of the present invention includes a step of receiving an input of a message for outputting to one or more console devices, a step of storing the input one or more messages in a temporary storage device, and the temporary storage device Managing one or more queues in which entries for outputting the messages stored in the plurality of console devices are respectively registered, and outputting the messages in which the entries are registered in the queue to the console device; Determining a queue for registering an entry corresponding to a new message from the plurality of queues according to the output performance of the message to the console device.

  In the present invention, “part”, “means”, and “apparatus” do not simply mean physical means, but the functions of the “part”, “means”, and “apparatus” are realized by software. This includes cases where In addition, even if the functions of one “unit”, “means”, and “device” are realized by two or more physical means or devices, two or more “parts”, “means”, and “devices” The function may be realized by one physical means or apparatus.

  According to the present invention, it is possible to provide an information processing apparatus and an information processing method capable of suppressing resource depletion without stopping the console apparatus.

It is a block diagram which shows the function structure of the computer system which concerns on embodiment. It is a block diagram which shows the structure of the I / O queue of the computer system shown in FIG. It is a block diagram for demonstrating the structure of the entry of the computer system shown in FIG. It is a flowchart which shows the flow of a process of the computer system shown in FIG. It is a flowchart which shows the flow of a process of the computer system shown in FIG. It is a figure for demonstrating the specific example of the process of the entry in the computer system shown in FIG. It is a block diagram which shows the function structure of the computer system which concerns on other embodiment. It is a block diagram which shows the function structure of the computer system which concerns on other embodiment.

  Embodiments of the present invention will be described below. In the following description and the description of the drawings to be referred to, the same or similar components are denoted by the same or similar reference numerals.

(1 Outline of the first embodiment)
Hereinafter, an outline of a computer system 10 that is an information processing apparatus according to the first embodiment will be described with reference to FIG. As shown in FIG. 1, a computer system 10 according to the present embodiment includes an application program 101 (hereinafter also simply referred to as “application 101”), a message transmission unit 103, a notification semaphore 105, a message processing unit 107, and a message log 109. , Console 111 (console 111A to 111N are collectively referred to as “console 111”, and console and console device are used synonymously), free resource management means 113, and the like.

  The computer system 10 is an information processing apparatus such as a main frame that can output a message output from the application 101 to a plurality of consoles 111. Here, even if there is a console 111 with low I / O (Input / Output) performance, the computer system 10 does not disconnect the console 111 or increase internal resources (for example, a storage area) for storing messages. The exhaustion is prevented, and the message stored in the resource is always output to the message log 109, thereby making it possible to confirm the event after the event. Hereinafter, this point will be described.

  Normally, with console control of the mainframe, a finite number of resources that can store output messages cannot be released until I / O to all consoles that have selected output is completed. When there are multiple consoles with different speeds, the console with the lowest I / O performance becomes a bottleneck and resource release is delayed, so if a new message is input during that time, a finite number of consoles will result. Resources can be depleted.

  Here, when resources are depleted, some application programs that prioritize continuation of processing over message output may stop outputting messages without waiting for resource availability. However, if the message output is stopped, the message cannot be output to the console or message log with high I / O performance, and the user cannot confirm the event after the fact.

  Further, as a technique related to the console, it may be possible to select an output console according to the level and attributes added to the console and the message. However, this is a static output console selection method that sets the level and attributes in consideration of the console I / O performance and purpose, so dynamic I / O performance fluctuations such as network load fluctuations It is difficult to deal with

  Furthermore, it may be possible to disconnect a console with low I / O performance when messages are exhausted. However, if the console is disconnected, the entire computer system may become inoperable, and the system will not become inoperable. Thus, if the object to be disconnected is limited to an output-only console (for example, a serial printer), the effect of suppressing resource depletion is limited.

  Therefore, as described above, in the computer system 10 according to the present embodiment, the output console corresponding to the fluctuation in the I / O performance of the console 111 is selected, and even if there is a console with low I / O performance, the console is disconnected. In addition, resource depletion can be prevented without adding resources, and messages stored in the resources are always output to the message log 109 to enable event post-confirmation and message linkage.

(2 Schematic configuration of computer system 10)
(2.1 Overall Configuration of Computer System 10)
The schematic configuration of the computer system 10 according to the first embodiment will be described below with reference to FIG. FIG. 1 is a functional block diagram showing an outline of a functional configuration of the computer system 10. As described above, the computer system 10 includes the message transmission unit 103, the notification semaphore 105, the message processing unit 107, the message log 109, the console 111, the free resource management unit 113, and the like. Information processing apparatus.

  The application 101 is an application program created by a user in an arbitrary language such as COBOL, and is executed on the computer system 10. A plurality of applications 101 may be executed simultaneously.

  The console 111 has a function of displaying a message output from the application 101 and allowing an operator (operator) to recognize the message, and a function of receiving an input from the operator through a keyboard.

  The free resource management means 113 is a module for pool management of unused message storage resources 115. More specifically, the free resource management unit 113 includes a resource acquisition function for extracting a message storage resource 115 managed as a free resource from the internal pool, and an I / O count area 119 of the message storage resource 115 described later. A resource release function for returning a resource that has become “0” to the internal pool, and a function for managing the number of managed free resources are provided.

  The message storage resource 115 is an internal memory resource for holding (temporarily storing) a message requested to be output from the application 101 in the console 111 until the output of the message is completed. As shown in FIG. 3 to be described later, the message storage resource 115 has a message storage area 117 and an I / O count area 119.

  The message storage area 117 is a storage area secured on a storage medium for storing messages. The I / O count area 119 is a storage area secured on the storage medium for storing the number of I / O queues in which the message is registered. When the output of the message related to the message storage resource 115 to the console 111 corresponding to all the registered I / O queues 210 is completed, the value of the I / O count area 119 becomes “0”, and the free resource management unit 113. Accordingly, the message storage resource 115 is released (data related to the message is deleted).

  The message transmission means 103 is used by the application 101 to copy (copy) the message input from the application 101 to the message storage resource 115 acquired using the free resource management means 113, and send the message through the notification semaphore 105. This module requests the processing means 107 to send a message.

  The notification semaphore 105 is a semaphore for notifying the message processing unit 107 of a message output request from the message transmitting unit 103 and delivering the message storage resource 115 storing the output message.

The message processing unit 107 receives the message output request from the message transmission unit 103, records the message in the message log 109, selects 0 to a plurality of consoles 111 to output the message, and selects the selected console 111. This is a module for outputting a message. The message processing unit 107 includes a console selection unit 201, an I / O queue 210 (I / O queues 210A to 210N are collectively referred to), and a message recording unit 203.
The message recording unit 203 is a module that records a message in the message log 109 and is used by the console selection unit 201.

  The console selection unit 201 records all messages requested to be output from the message transmission unit 103 in the message log 109 using the message recording unit 203, and stores the message storage resource 115 related to the message in an appropriate I / O queue. 210 is a module registered in 210. The console selection unit 201 selects (determines) the I / O queue 210 to be registered based on the message, the attribute added to the console 111, and the level using a general console routing method. When the console selection unit 201 detects resource tightness when the I / O queue 210 is selected, the console 111 having low I / O performance is excluded from the selection target, and the bottleneck of resource release due to waiting for I / O completion is eliminated. Thus, the message storage resource 115 is released quickly. Further, the console selection unit 201 has a function of resolving the resource tightness by releasing resources registered in the I / O queue and resources remaining in the notification semaphore 105.

  The I / O queue 210 is a queue for holding a reference to the message storage resource 115 registered by the console selection unit 201 until it is output to the console 111. Since a general console 111 requires about several tens of milliseconds for I / O for message output, an I / O queue 210 that holds I / O waiting messages is required for each console 111.

  The message log 109 is a message storage area for confirming a message for which an output request has been made, and is constructed by a magnetic disk such as an HDD (Hard Disk Drive).

(2.2 Configuration of I / O queue 210)
The configuration of the I / O queue 210 will be described in detail with reference to FIG. FIG. 2 is a functional block diagram showing a functional configuration of the I / O queue 210.

  The I / O queue 210 includes an entry management unit 211, a resource registration unit 215, a queue length measurement unit 217, a resource release unit 219, an I / O unit 221, a registration number recording area 223, and an I / O number. Recording area 225.

  The entry management unit 211 uses the FIFO 213 to register entries 213 registered in the I / O queue 210 (entries 213A to 213N are collectively referred to as “entry 213”; the same applies to entries 213A1 to 213A3 and entry 213B1 described later). (First In First Out). A function of adding the entry 213 to the end of the queue, a function of extracting the entry 213 from the head of the queue, and a function of extracting an arbitrary entry 213 are provided. The entry 213 is a memory resource for holding a reference to the message storage resource 115 registered in the I / O queue 210. The configuration of the entry 213 will be described in detail later with reference to FIG.

  The resource registration unit 215 is used by the console selection unit 201 to register the message storage resource 115 in the I / O queue. The resource registration unit 215 newly secures the entry 213, registers the reference to the message storage resource 115 in the new entry 213, and manages the end of the entry 213 managed by the entry management unit 211 (in the example of FIG. 2). 213A). The resource registration unit 215 has a function of incrementing (+1) the value of the I / O count area 119 of the message storage resource 115 and recording a reference from the I / O queue. Further, the resource registration unit 215 has a function of updating the number of registrations per unit time stored in the registration number recording area 223.

  The registration number recording area 223 is an area for storing the number of registrations per unit time for the I / O queue 210. The registered number recording area 223 is secured on the memory in consideration of the access speed.

  The queue length measurement unit 217 is a module for acquiring the number of entries 213 registered in the entry management unit 211 using the entry management unit 211.

  The resource release means 219 extracts and releases an arbitrary entry 213 managed by the entry management means 211 and decrements the value of the I / O count area 119 of the message storage resource 115 referred to by the entry 213 ( -1). When the value of the I / O count area 119 becomes “0”, that is, when the reference to the message storage resource 115 is lost from all the I / O queues 210, the resource release means 219 manages free resources. The means 113 is used to release the message storage resource 115.

  The I / O unit 221 extracts the entry 213 from the head of the entry management unit 211, requests the console 111 to output a message of the message storage resource 115 referred to by the entry 213, and releases the resource when the I / O is completed. 219, and a function for releasing the entry 213 and a function for updating the value of the I / O count recording area 225.

  The I / O count recording area 225 is an area for recording the time required for the most recent I / O as the number of I / O possible per unit time for the console 111 corresponding to the I / O queue 210. The I / O count recording area 225 is secured on the memory in consideration of the access speed.

(2.3 Configuration of entry 213)
Hereinafter, the configuration of the entry 213 will be described with reference to FIG. FIG. 3 is a block diagram for explaining the configuration of the entry 213.

  The entry 213 is linked to the reference holding area 305A1 for holding a reference to the message storage resource 115, and the entries 213 are linked in the same I / O queue 210 in the order of registration and are managed by FIFO (First In First Out). The in-queue link area 301A1 and the out-queue link area 303 for linking the entry 213 referring to the same message storage resource 115 are included.

  The links in the out-of-queue link area 303 are configured in a ring shape. For this reason, the entry 213 at the head and tail does not exist. The direction of the link may be bidirectional or unidirectional. For example, when linking three entries 213A1, entry 213B1, and entry 213C1, a ring shape such as “... Entry 213A1 entry 213B1 entry 213C1 entry 213A1 entry 213B1 entry 213C1⇔. Configure a link that circulates. With such a structure, all entries 213 can be traced from any entry 213 with the minimum steps.

  In FIG. 3, three entries 213A1 to A3 are registered in the entry management means 211 (not shown in FIG. 3) of the I / O queue 210A (I / O queue A), and the I / O queue 210B (I Example where one entry 213B1 is registered in the entry management means 211 of the / O queue B) and the leftmost (tail) entries 213A1 and B1 refer to the same message storage resource 115A It is. Since the message storage resource 115A is referenced from the two I / O queues 210, the I / O count area 119A of the message storage resource 115A is “2”.

  The entry 213 is a small memory resource of about several tens of bytes that includes only a reference to the message storage resource 115 and a link area. Therefore, a mechanism for pool management of the empty entries 213, such as the message storage resource 115 that is relatively large in size for storing messages, is not essential. In the present embodiment, the entry 213 is dynamically secured / released on the memory.

(3 Process flow)
(3.1 Message output processing flow)
The application 101 requests message transmission to an arbitrary console 111 using the message transmission unit 103. The message transmission unit 103 uses the free resource management unit 113 to acquire the message storage resource 115 managed by the free resource management unit 113. If the resource is exhausted and cannot be acquired, message transmission fails. In this case, the message requested to be transmitted is not output to the console 111 and is not recorded in the message log 109. A method of waiting until the message storage resource 115 is depleted is also conceivable. In this case, the application 101 is also stopped until the message storage resource 115 can be acquired.

When the message storage resource 115 can be acquired, the message transmission unit 103 copies the message requested to be transmitted from the application 101 to the message storage area 117 of the message storage resource 115 and sets “0” in the I / O count area 119. set. Further, the message transmission unit 103 sets the acquired message storage resource 115 in the notification semaphore 105 and notifies the message processing unit 107 of a message transmission request.
Hereinafter, the processing flow of the message processing means 107 will be described with reference to FIG.

  First, the console selection unit 201 waits for the notification semaphore 105, and receives the message transmission request from the message transmission unit 103 and the message storage resource 115 (S401).

  Next, the console selection unit 201 confirms the number of free resources using the free resource management unit 113 (S403). Here, a resource release start value for starting the resource release is determined in advance. If the number of free resources (free storage capacity) becomes equal to or less than the resource release start value, the process proceeds to S405 to release the resource. To start. Otherwise, the process proceeds to S419 without releasing the resources.

  In S419, the console selection unit 201 uses the message recording unit 203 to output the message stored in the message storage area 117 of the message storage resource 115 to the message log 109. Thereafter, the process proceeds to a console selection process described later with reference to FIG.

  If the number of free resources (free storage capacity) is equal to or less than the resource release start value in S403, the resource storage has been detected, and release of the message storage resource 115 is started. First, the number of entries 213 is inspected for all I / O queues 210 existing in the system using the queue length measuring means 217 (S405). If there is no I / O queue 210 in which the entry 213 is registered, the process proceeds to S407. If one or more I / O queues 210 in which the entry 213 is registered exist, the process proceeds to S415.

  When the message storage resource 115 registered in the I / O queue 210 does not exist, the release of the message storage resource 115 staying in the notification semaphore 105 is started. At this time, instead of giving up the message output to the console 111, a record is left in the message log 109. The message recording means 203 outputs the message stored in the message storage area 117 of the message storage resource 115 to the message log 109 (S407), and the free resource management means 113 releases the message storage resource 115 (S409). .

  Thereafter, the free resource management unit 113 confirms the number of free resources again (S411). At this time, the value of the resource release end value that ends the resource release (the resource release end value is equal to or greater than the resource release start value) is determined in advance, and the number of free resources is restored to the resource release end value or more. If so, the process returns to S401. Thereafter, unless the free resources decrease and become the resource release start value again or less, the process proceeds to the console selection process described later with reference to FIG. 5 through S403 (No) and S419.

  If the number of free resources is less than the resource release end value in S411 (No in S411), the message processing unit 107 takes out the message storage resource 115 storing the message related to the next message output request from the notification semaphore 105 ( S413), the process is returned to S407, the output to the message log 109 (S407) and the resource release (S409) are repeated.

  If there is one or more I / O queues 210 in which the entry 213 is registered in S405 (Yes in S405), the message storage resource 115 is released in preference to the entry 213 registered in the I / O queue 210. To do. The message processing unit 107 checks all the I / O queues 210 in which the entries 213 are registered as resources to be released, and selects an entry 213 that is predicted to take the longest time for I / O completion. Here, the I / O queue 210 includes an I / O count recording area 225 for recording the number of I / Os possible per unit time, and the I / O means 221 records the I / O count recording area for each I / O. 225 is updated. Therefore, the message processing unit 107 converts the possible number of I / Os per unit time into the time required for one I / O, and then multiplies this with the number of entries 213 measured by the queue length measurement unit 217. Thus, it is possible to predict the time required from the present time to the completion of the I / O of the current end entry 213. Therefore, the message processing unit 107 sets the message storage resource 115 referred to by the entry 213 at the end of the I / O queue 210 that is predicted to take the longest time as a release target.

  When the message storage resource 115 referred to by the entry 213 to be released is also routed to another console 111, the message storage resource 115 is also referenced from the entry 213 of the other I / O queue 210. It will be done. Therefore, the free resource management unit 113 cannot release the message storage resource 115 until the entries 213 of all the I / O queues 210 to be referenced are released. Therefore, since all the entries 213 that refer to the message storage resource 115 to be released can be traced by referring to the out-queue link area 303 of the entry 213, the resource releasing means 219 releases all the entries 213. The free resource management unit 113 releases the message storage resource 115 (S415). A specific example of the process of S415 will be described later with reference to FIG.

  After releasing the message storage resource 115, the message processing unit 107 uses the free resource management unit 113 to check the number of free resources. When the number of free resources exceeds the predetermined resource release end value (Yes in S417), the console selection unit 201 still stores the message stored in the message storage area 117 of the message storage resource 115 in the message log. If not output to 109, the message recording means 203 is used to output the message to the message log 109 (S419). Thereafter, the release process ends, and the process proceeds to the console selection process described in FIG. If the number of free resources has not recovered to the resource release end value or more (No in S417), the process returns to S405, and the resource release process is continued.

  Next, the flow of console selection processing by the console selection unit 201 will be described with reference to FIG. FIG. 5 is a flowchart showing a processing flow of the console selection unit 201.

  First, the console selection unit 201 selects an unprocessed I / O queue 210 in order to process all the I / O queues 210 in order (S501). When all the I / O queues 210 have been processed and there is no I / O queue 210 that can be selected in S501 (Yes in S503), the console selection unit 201 ends the processing, and the message processing unit 107 continues to the next processing. The message processing described with reference to FIG. 4 is started.

  If there is a selectable I / O queue 210 (No in S503), it is determined whether or not the console 111 corresponding to the I / O queue 210 is a routing target (S505). For example, a general console routing method can be used for the determination. In the present embodiment, when one or more attributes added to the message match one or more attributes added to the console 111 and the message level added to the message is equal to or higher than the console level added to the console 111 In addition, the I / O queue 210 corresponding to the console 111 is set as a routing target. If it is not a routing target (No in S505), the console selection unit 201 returns the process to S501 and selects the next unprocessed I / O queue 210.

  When the console 111 corresponding to the I / O queue selected in S505 is a routing target (Yes in S505), the console selection unit 201 uses the free resource management unit 113 to free the message storage resource 115. Check the number of When the number of free message storage resources 115 (free storage capacity) is equal to or less than a predetermined suppression threshold (Yes in S507), the process proceeds to S511 to register the message in the I / O queue 210. It is determined whether or not. It should be noted that the suppression of registration to the I / O queue 210 is preferably started at an earlier stage than the resource release process of FIG. 3, and therefore, the suppression threshold is set to a value larger than the resource release quality.

  If the number of empty message storage resources 115 is greater than the suppression threshold (No in S507), it can be determined that the message storage resources 115 are not tight, so the console selection unit 201 considers the I / O performance of the console 111. Without registering, the message storage resource 115 is registered in the I / O queue 210 (S509). Registration in the I / O queue 210 uses resource registration means 215. At this time, the resource registration unit 215 secures a new entry 213 and adds it to the end of the I / O queue 210 using the entry management unit 211. The entry management means 211 uses the intra-queue link area 301 of the entry 213 to configure the FIFO queue structure.

  Further, the console selection unit 201 sets a reference to the message storage resource 115 to be registered in the reference holding area 305 of the entry 213, and increments (+1) the I / O count area 119A of the message storage resource 115. When the message is registered in the other I / O queue 210, the console selection unit 201 temporarily remembers the registered entry 213, and the entry 213 is queued with the entry 213 secured in this step. Link in the outer link area 303.

Further, the console selection unit 201 updates the registration number per unit time in the registration number recording area 223 by the resource registration unit 215. The console selection unit 201 can obtain the number of registrations per unit time by recording a plurality of times when the resource registration unit 215 registers the resources for the past unit time in the registration number recording area 223. .
After completing the registration processing in the I / O queue 210, the console selection unit 201 returns to S501 and selects the next unprocessed I / O queue 210.

If the number of free resources is equal to or less than the suppression threshold in S507 (Yes in S507), it can be considered that the tightness of the message storage resource 115 has been detected. The registration of the message storage resource 115 to the lower console 111 is suppressed. More specifically, the console selection unit 201 compares the number of registrations per unit time recorded in the registration number recording area 223 recorded in S509 with the number of I / Os possible per unit time in the I / O number recording area 225. To do. If the number of registrations per unit time is larger (Yes in S511), it can be determined that the I / O performance of the corresponding console 111 cannot catch up with the message output request, so the console selection unit 201 stores in the I / O queue 210. The process does not proceed to S509 for registering the message storage resource 115, but returns to S501 to select the next unprocessed I / O queue 210. Otherwise, since the I / O performance of the I / O queue 210 to be processed is considered sufficient to process the message output request, the console selection unit 201 proceeds to S509 and proceeds to the I / O concerned Register resources in the queue 210.
Here, the processing of the I / O unit 221 will be briefly described. The I / O unit 221 operates in parallel with the console selection unit 201 independently.

  The I / O unit 221 uses the entry management unit 211 to extract the first entry 213 and requests the console 111 to output a message of the message storage resource 115 referred to by the extracted entry 213. Here, if the entry 213 does not exist, the I / O means 221 waits until a new entry 213 is registered.

Further, the I / O unit 221 waits for I / O completion of the message output request, and uses the time required for the I / O to calculate the number of I / Os possible per unit time in the I / O number recording area 225. Update. The number of possible I / Os is preferably obtained by averaging the time required for the most recent I / O in order to suppress fluctuations due to errors.
After completing the I / O, the I / O unit 221 uses the resource release unit 219 to release the entry 213 and return to the retrieval of the head entry 213.

(3.2 Specific example of processing for releasing message storage resource 115 related to entry 213)
Hereinafter, a specific example of the process of FIG. 4S415 will be described with reference to FIG.

  In the example of FIG. 6, three I / O queues 210A (I / O queue A), I / O queue 210B (I / O queue B), and I / O queue 210C (I / O queue C) are provided. Queue 210 is configured, four entries 213A1, 213A2, 213A3, and 213A4 are in I / O queue 210A, and three entries 213B1, 213B2, and 213B3 are in I / O queue 210B, one in I / O queue 210C. An entry 213C1 is registered. Here, the message processing means 107 refers to the I / O count recording area 225, so that the time required for one I / O of each I / O queue 210 is 10 ms for the I / O queue 210A, Assume that the O queue 210B can be obtained as 20 ms and the I / O queue 210C as 30 ms.

  The message processing unit 107 examines all the I / O queues 210 and selects an entry 213 that is predicted to take the longest time to complete the I / O. The entry 213 that takes the longest time in each I / O queue 210 is the entry 213 at the end of the queue that makes the I / O request last, so the console selection unit 201 uses the I of the entries 213A1, 213B1, and 213C1. / O Completion time is predicted. When the product of the time required for one I / O and the queue length is calculated for each entry 213, the entry 213A1 is 40 ms, the entry 213B1 is 60 ms, and the entry 213C1 is 30 ms. Therefore, since it is considered that the entry 213B1 takes the longest time to complete the I / O, the console selection unit 201 sets the entry 213B1 as a release target.

  In the example of FIG. 6, the entry 213B1 is linked to the entry 213A2 and the entry 213C1 by the out-of-queue link area 303. Since this indicates that the entry 213A2 and the entry 213C1 refer to the same message storage resource 115 as the entry 213B1, the message processing unit 107 also sets the entry 213A2 and the entry 213C1 as the release targets.

  The message processing unit 107 traces the link outside the queue from the entry 213B1, releases the entries 213B1, 213C1, and 213A2 in this order using the resource release unit 219, and uses the free resource management unit 113 to release these entries. The message storage resource 115 referred to by 213 is released.

(4. Effects according to the first embodiment)
As described above, in the computer system 10 according to the present embodiment, even if there is a console 111 with low I / O performance, it is difficult for the message storage resource 115 to be exhausted. This is because, in S511 of the console selection process (FIG. 5), the I / O queue 210 of the console 111 having a smaller number of I / Os than the number of message registrations is excluded from the registration target of the message storage resource 115. In this way, by removing the console 111 whose I / O performance is lower than the message registration frequency from being subject to routing, it is possible to eliminate the bottleneck of resource release due to waiting for I / O completion. I can release it.

  In addition, the computer system 10 according to the present embodiment quickly resolves the resource tightness. This is because when resources are tight, the message processing means 107 takes the time to complete I / O most among the resources registered in the I / O queue 210 in S405, S415, and S417 shown in FIG. This is because such resources are selected and released immediately.

  Furthermore, in the computer system 10 according to the present embodiment, since the message stored in the message storage resource 115 is always output to the message log 109, a message that has not been output to the console 111 can be confirmed afterwards. This is always output to the message log 109 where high-speed I / O can be performed, and by suppressing output to the console 111 with low I / O performance, resource depletion can be achieved without disconnecting the console 111 or adding resources. And post-confirmation of the message is possible. The reason is that a message is output to the message log 109 before releasing resources in S407 and S419 of the message processing shown in FIG.

(5 Other embodiments)
Hereinafter, other embodiments will be described. Here, the same reference numerals are given to the same configurations as those in the above embodiment, and the description thereof is omitted. In addition, the description of the operational effects common to the above embodiment is also omitted.

(5.1 Second Embodiment)
Some console messages require a response from an operator who operates the console 111. However, if the message is not output to the console 111 by releasing a resource of a message that requires an operator response or suppressing registration in the I / O queue 210, the operator may not be aware of the response request. . In the above-described embodiment, it is possible to check the message log 109 later, but it is not possible to respond in real time. Therefore, in the second embodiment, a message that requires an operator response is displayed on the console 111 without releasing the resource even when the message storage resource 115 is tight.
Therefore, in the second embodiment, a response flag is added to the message storage resource 115. Hereinafter, the processing of this embodiment that is different from the above embodiment will be mainly described.

  The application 101 informs the message transmission means 103 that the message requires an operator response when a message transmission request is made. The message transmission unit 103 sets whether or not an operator response is required in the response flag when acquiring the message storage resource 115 using the free resource management unit 113. The message processing unit 107 selects only the entry 213 whose response flag value is “response unnecessary” from the message storage resources 115 registered in the I / O queue 210 in S415 of FIG. An entry 213 that is predicted to take time to complete is set as a release target. Here, for the prediction of the I / O completion time, the number of entries 213 measured by the queue length measuring means 217 is not used, but what number the target entry 213 is from the head of the I / O queue. Use the value.

  Also, whether there is a registered resource in the I / O queue in S405 of FIG. 4 is determined if the response flags of all message storage resources 115 in the I / O queue 210 require an operator response. Since there is no resource that can be released in the I / O queue 210, a change is made to determine that there is no registered resource.

  Furthermore, if the response flag of the message storage resource 115 to be released in S409 of FIG. 4 is “operator response required”, the resource is not released and the process proceeds to the console selection process shown in FIG. At this time, after the console selection process is completed, the process returns to S409.

  Further, in S511 of FIG. 5, the message storage resource 115 of “Operator response required” does not determine registration suppression, and proceeds to S509 to register the resource in the I / O queue 210.

  With this implementation, according to the present embodiment, even when the message storage resource 115 is tight, an operator response message is displayed on the console 111, so the operator can respond in real time. It becomes like this. This is because, as described above, messages that require an operator response are not subject to resource release and registration suppression.

(5.2 Third Embodiment)
Hereinafter, a third embodiment will be described. As described above, according to the second embodiment, when the message storage resource 115 is tight, an operator response message is output to the console 111 regardless of the presence of the operator. However, since the console 111 without an operator cannot respond immediately, it can be considered that output is not essential even for a message requiring an operator response. Therefore, in this embodiment, a message is not output to the console 111 with low I / O performance without an operator when the message storage resource 115 is tight.

  FIG. 7 shows a functional configuration of the computer system 10 according to the third embodiment. As shown in FIG. 7, in the present embodiment, operator detection means 601 (operator detection means 601 to 601 N are collectively referred to as “console configuration” in the console 111 compared to the functional configuration of the embodiment described above shown in FIG. 1. The operator detection means 601 "is added.).

  Here, the operator detection means 601 is a module for confirming (determining) the presence or absence of an operator of the corresponding console 111. As a method for detecting the presence of the operator, for example, the following method can be considered.

  As a first method, a determination method using an input signal from an input device such as a keyboard or a mouse provided in the console 111 is conceivable. In this case, for example, the operator detection unit 601 can determine that an operator exists when an input signal is input from a keyboard or a mouse within a certain time. On the other hand, when there is no input for a certain period of time, the operator detection means 601 determines that there is no operator.

  As the second method, a console button displayed on the console 111 is provided with a leave button and a seat button that can be pressed exclusively, and the operator detecting means 601 is configured so that the operator can operate while the seat button is pressed. Judge as existing. On the other hand, while the away button is pressed, the operator detection unit 601 determines that the operator is absent.

  As a third method, a pressure sensor is provided in a chair provided in the console 111 so that the operator detection means 601 can detect the seating of the operator. When a pressure higher than a certain level is detected within a certain time, the operator detection unit 601 determines that an operator is present. On the other hand, when the pressure above a certain level is not detected within a certain time, the operator detection means 601 determines that the operator is absent.

As a fourth method, a program interface for starting automatic operation and ending automatic operation is provided in the console 111 so as to correspond to the case where the automatic operation program operates instead of the operator. The operator detection means 601 determines that the operator exists when the automatic operation program notifies the start of automatic operation using the automatic operation start interface, and the automatic operation program uses the automatic operation end interface to perform automatic operation. When the end is notified, it is determined that the operator is absent.
The processing flow of this embodiment will be described below. Basically, it is similar to the second embodiment described above, but differs in the following points.

  First, in the process of S511 in FIG. 5, the operator detection unit 601 of the I / O queue 210 to be processed is used to check whether an operator exists. If there is an operator, the process proceeds to S509 without determining whether or not to suppress the registration of the message storage resource 115, and the message storage resource 115 is registered in the I / O queue 210. If there is no operator, registration suppression is determined, and if suppression is not necessary, the process proceeds to S509. If suppression is necessary, the process proceeds to S501.

  By implementing in this way, the computer system 10 according to the present embodiment can quickly recover the free resources without causing the console 111 without an operator to delay the release of the message storage resource 115. It becomes. This is because the use of the operator detection unit 601 in S511 of FIG. 5 does not register the message storage resource 115 in the I / O queue 210 of the console 111 with low I / O performance without an operator, so that the console 111 becomes a bottleneck. This is because the free resource management unit 113 can release resources without delay.

(5.3 Fourth Embodiment)
In the above-described embodiment, when the message storage resource 115 is tight, the entry 213 that can be predicted to take the longest time to complete I / O among all the I / O queues 210 is released. In this regard, in the fourth embodiment, another selection method of the entry 213 to be released will be described.
In the method of the present embodiment described below, the entry 213 is released by changing the process of S415 of FIG. 4 to one of the following in the first embodiment.

(1) As a first method, a method of giving priority to the console 111 is conceivable. In this case, of the I / O queue 210 in which the entry 213 exists, the entry 213 of the console 111 having the lowest priority is set as a release target. For example, when there are five levels of priority, the highest priority is 1 and the lowest priority is 5, the resource release means 219 has the highest I / O queue among the I / O queues 210 of all the consoles 111 with priority 5. The entry 213 that takes time to complete is released. If there is no releasable entry 213 in the console 111 with priority 5, the entry 213 is selected from the console 111 with priority 4 and released. Similarly, if there is no releasable entry 213, the console 111 with the priority 1 is searched. The entry 213 is released by tracing the out-of-queue link area 303 and releasing all the entries 213 referring to the same resource by using the resource releasing means 219.
By mounting in this way, the user can set the console 111 that prioritizes output when resources are tight, according to priority.

  (2) As a second method, it is conceivable to release the message storage resource 115 having the fewest registered I / O queues 210. In this case, the number of registered I / O queues 210 can be confirmed by tracing the non-queue link area 303 of the message storage resource 115. By checking the number of registered I / O queues 210 for all I / O queues 210 and their entries 213, the entry 213 having the smallest number of registered I / O queues 210 can be determined. The entry 213 is released by tracing the out-of-queue link area 303 and releasing all the entries 213 that refer to the same view source using the resource releasing means 219.

  By implementing in this way, the number of operators affected by resource release can be minimized. This is because, as the number of routed consoles 111 increases, the number of operators affected by the resource release increases, but this method is because the routed console 111 releases from fewer resources.

  (3) After the operator absent console 111 is clarified by the operator detection means 601 shown in the second embodiment, the most complete I / O is completed in the I / O queue 210 corresponding to the console 111 absent the operator. The entry 213 that takes a long time to be selected is selected and released. The entry 213 is released by tracing the out-of-queue link area 303 and releasing all the entries 213 referring to the same message storage resource 115 by using the resource release means 219.

  By implementing in this way, the computer system 10 according to the present embodiment releases the message storage resource 115 from the console 111 where there is no operator, so that messages can be preferentially output to the console 111 where the operator exists. For the console 111 where there is no operator, the message log 109 only needs to be confirmed afterwards, so it can be considered that output to the console 111 is not essential.

(5.4 Fifth Embodiment)
The fifth embodiment will be described below. Each of the above embodiments has an effect of suppressing the depletion of the message storage resource 115. However, when the resource is depleted, the acquisition of the resource may fail and the application 101 may fail to transmit the message. It was. Therefore, when the message storage resource 115 is depleted, the computer system 10 according to the present embodiment assigns resources to the application 101 that desires priority acquisition of resources.

  The configuration of the computer system 10 according to the present embodiment will be described with reference to FIG. In FIG. 8, an application 101B is an application that can transmit a message with priority over the application 101 even when resources are exhausted. The difference between the computer system 10 shown in FIG. 8 and the computer system 10 according to the first embodiment described with reference to FIG. 1 is that when the message storage resource 115 is depleted, resources are preferentially acquired and a message is transmitted. A message priority transmission unit 103B that enables communication, a resource allocation notification from the console selection unit 201, and a priority notification semaphore 105B for receiving the allocated message storage resource 115 are added.

Note that the application 101A, the message transmission unit 103A, and the notification semaphore 105A correspond to the application 101, the message transmission unit 103, and the notification semaphore 105 of the first embodiment, respectively.
Hereinafter, the flow of processing of the computer system 10 according to the present embodiment will be described focusing on differences from the first embodiment.

  The application 101A requests message transmission to an arbitrary console 111 using the message priority transmission unit 103B. The message priority transmission means 103B uses the free resource management means 113 to acquire the message storage resource 115. The operation after the message storage resource 115 is acquired is the same as that of the message transmission unit 103 of the first embodiment.

  When the message storage resource 115 is exhausted and cannot be acquired, the priority notification semaphore 105B is waited for, and the resource allocation notification from the console selection unit 201 and the allocated message storage resource 115 are received. The operation after receiving the message storage resource 115 is the same as the processing when the message transmission unit 103 can acquire the message storage resource 115 in the first embodiment.

  Also, the processing of S409 and S415 of FIG. 4 is different as follows. First, in S409, the priority notification semaphore 105B is inspected, and if the message priority transmission unit 103B is waiting for resource allocation, the resource allocation is not released, but the resource allocation is performed using the priority notification semaphore 105B. Along with the notification, it is transmitted to the message priority transmission means 103B. If resource allocation is not awaited, free resource management means 113 is used to release the resource.

  Regarding the processing of S415, the processing up to the determination of the entry 213 to be released is the same processing as in the first embodiment. Alternatively, the process of the fourth embodiment may be used. After the entry 213 to be released is determined, the priority notification semaphore 105B is inspected, and if the message priority transmission means 103B waits for the resource allocation, the non-queue link area 303 of the entry 213 to be released is traced to refer to the same resource. All the entries 213 to be performed are taken out from the entry management means 211 of each I / O queue 210 and released. The message storage resource 115 referred to by the released entry 213 is not released, but is transmitted to the message priority transmission means 103B together with the resource allocation notification using the priority notification semaphore 105B.

  If the message priority transmission means 103B does not wait for resource allocation, the message priority transmission means 103B follows the off-queue link area 303 of the entry 213 to be released, and all the entries 213 that refer to the same resource are assigned to the resource release means 219 of each I / O queue 210. Use to release.

  According to the present embodiment, when the message storage resource 115 is depleted, resources can be preferentially allocated to the application 101B and the message transmission of the application 101B can be guaranteed. This is because in S409 and S415 of FIG. 4, the message storage resource 115 to be released is directly assigned to the message priority transmission unit 103B without returning to the free resource management unit 113.

(6 Appendix)
Note that the configurations of the above-described embodiments may be combined or some of the components may be replaced. The configuration of the present invention is not limited to the above-described embodiment, and various modifications may be made without departing from the scope of the present invention.
A part or all of each of the above-described embodiments can be described as in the following supplementary notes, but is not limited thereto.

(Appendix 1)
Input means for receiving a message to be output to a plurality of console devices; temporary storage means for temporarily storing one or more messages input from the input means; and a plurality of messages stored in the temporary storage means. A plurality of management means each managing a queue in which an entry for output to the console device is registered; an output means for outputting a message in which an entry is registered in the queue to the console device; and the console from the output means An information processing unit including: a selecting unit that determines the queue for registering an entry corresponding to a new message from the plurality of queues managed by the plurality of managing units according to output performance of a message to the apparatus. apparatus.

(Appendix 2)
The information processing apparatus according to appendix 1, wherein the selection unit determines the queue for registering an entry corresponding to a new message when the storage capacity of the temporary storage unit falls below a first threshold.

(Appendix 3)
The information processing apparatus according to appendix 1 or appendix 2, further comprising a deletion unit capable of deleting a message from the temporary storage unit before completion of output from the output unit to the console device.

(Appendix 4)
The information processing apparatus according to appendix 3, wherein the deletion unit deletes the message from the temporary storage unit according to the output performance of the message from the output unit to the console device.

(Appendix 5)
Appendix 3 or Appendix 4 further comprising log recording means for recording information about the message to be deleted on a recording medium when the deletion means deletes the message stored in the temporary storage means before the output to the console device is completed. The information processing apparatus described.

(Appendix 6)
The information processing apparatus according to any one of attachments 3 to 5, wherein the deletion unit deletes a message from the temporary storage unit when a storage capacity of the temporary storage unit falls below a second threshold value.

(Appendix 7)
The selection unit is configured to select a new message from the plurality of queues respectively managed by the plurality of management units based on a comparison between the number of registered messages to be output from the output unit to the console device and the number of outputable messages. The information processing apparatus according to any one of appendix 1 to appendix 6, wherein the queue for registering an entry corresponding to is determined.

(Appendix 8)
Detection means for detecting presence / absence of an operator of the console device is further provided, and the selection means includes the queue corresponding to the console device in which the operator exists, the queue for registering an entry corresponding to a new message, The information processing apparatus according to any one of supplementary notes 1 to 6.

(Appendix 9)
The input means receives a message input from a first application and a second application having a higher priority than the first application, and the deletion means is requested to primarily store a message from the second application. The information processing apparatus according to any one of appendix 3 to appendix 7, wherein the message is deleted from the primary storage unit and the message from the second application is stored.

(Appendix 10)
Receiving a message to be output to one or more console devices; storing the input one or more messages in a temporary storage device; and storing a plurality of messages stored in the temporary storage device. Managing one or more queues in which entries for output to the console device are registered; outputting a message in which entries are registered in the queue to the console device; and messages for the console device And determining a queue for registering an entry corresponding to a new message from the plurality of queues according to output performance.

  DESCRIPTION OF SYMBOLS 10 ... Computer system, 101 ... Application program, 103 ... Message transmission means, 105 ... Notification semaphore, 107 ... Message processing means, 109 ... Message log, 111 ... Console, 113 ... Free resource management means, 115 ... Message storage resource, 201 ... Console selection means, 203 ... Message recording means, 210 ... I / O queue

Claims (10)

An input means for receiving input of a message for outputting to a plurality of console devices;
Temporary storage means for temporarily storing one or more messages input from the input means;
A plurality of management means each managing a queue in which entries for outputting a message stored in the temporary storage means to a plurality of the console devices are registered;
Output means for outputting a message whose entry is registered in the queue to the console device;
Selection means for deciding the queue for registering an entry corresponding to a new message from among the plurality of queues managed by a plurality of management means according to the output performance of messages from the output means to the console device An information processing apparatus comprising: The selection means determines the queue for registering an entry corresponding to a new message when the storage capacity of the temporary storage means falls below a first threshold;
The information processing apparatus according to claim 1. The information processing apparatus according to claim 1, further comprising a deletion unit that can delete a message from the temporary storage unit before completion of output from the output unit to the console device. The deletion unit deletes the message from the temporary storage unit according to the output performance of the message from the output unit to the console device.
The information processing apparatus according to claim 3. The log recording means which records the information regarding the message to delete on a recording medium, when the deletion means deletes the message which the temporary storage means memorizes before the output to the console device is completed. Item 5. The information processing apparatus according to Item 4. The deleting means deletes the message from the temporary storage means when the storage capacity of the temporary storage means falls below a second threshold;
The information processing apparatus according to any one of claims 3 to 5. The selection unit is configured to select a new message from the plurality of queues respectively managed by the plurality of management units based on a comparison between the number of registered messages to be output from the output unit to the console device and the number of outputable messages. Determining the queue to register the entry corresponding to
The information processing apparatus according to any one of claims 1 to 6. It further comprises detection means for detecting the presence or absence of an operator of the console device,
The selecting means sets the queue corresponding to the console device in which an operator is present as the queue for registering an entry corresponding to a new message.
The information processing apparatus according to any one of claims 1 to 6. The input means receives a message from a first application and a second application having a higher priority than the first application,
The deletion unit deletes the message from the primary storage unit and stores the message from the second application when the primary storage of the message is requested from the second application.
The information processing apparatus according to any one of claims 3 to 7. Receiving a message for output to one or more console devices;
Storing one or more input messages in a temporary storage device that temporarily stores the messages;
Managing one or more queues in which entries for outputting messages stored in the temporary storage device to each of the plurality of console devices are registered;
Outputting a message whose entry is registered in the queue to the console device;
Determining a queue for registering an entry corresponding to a new message from the plurality of queues according to the output performance of a message to the console device.

Images