JP7351679B2 - Computer, data control method and data store system - Google Patents

Description

The present invention relates to a queue system and a data store system that transfer data received from a client to a service providing server.

In recent years, as the number of communication terminals and IoT devices owned by users has increased, the amount of data transmitted from these devices has increased. As a system for processing these data, there is a system including a queue server.

A conventional system that maintains a queue sets a queue for each application, handles each request as a message for each queue, and controls the queue using FIFO (first-in-first-out).

Further, as a technology related to the above-mentioned queue server, there is a technology in which priority is set and processed not within a queue but between queues. There is also known a system that sets a plurality of queues and manages the priorities among the queues, thereby determining the priorities of requests among the queues and processing them according to the priorities. However, if a plurality of queues are provided in this way, it will be necessary to design the queues for each service providing system, and the operation will be complicated.

In view of the above problems, Patent Document 1 discloses an invention for controlling the queue processing order based on the correlation with other messages by assigning a key for associating mutually related messages in the same queue when the queue is stored. is disclosed.

JP2016-18222A

In recent years, as the number of communication terminals and IoT devices owned by users has increased, the amount of data transmitted from these devices has increased. Message queues are also required to have the ability to store and retrieve large amounts of data in order to serve as a receptacle for big data.

In addition to simply processing large amounts of data, there is also an opportunity to assign priorities to multiple types of data depending on the characteristics of the data to be processed, and to send data identified based on multiple conditions to the service realization server more quickly. It's starting to be demanded.

The present invention has been made in view of the above-mentioned problems, and an object of the present invention is to receive requests having multiple priorities and process them with high efficiency.

A computer including a processor, a memory, and a communication device, the control unit controlling data including a first priority determination key and a second priority determination key as a plurality of priorities received by the communication device ; a received data storage unit that stores data in the order of arrival; a storage management table that manages the first priority determination key, the second priority determination key of the data, and the identifier of the data in association with each other; a priority control information table that stores data identifiers in association with the priorities of the first priority determination key and the second priority determination key; The data including the priorities of the received data are stored in the received data storage unit in the order of arrival, and a first priority determination key and a second priority determination key are obtained from the received data as a plurality of priorities. When setting an identifier to data and storing it in the storage management table, if the first priority determination key and the second priority determination key are already registered in the priority control table, the first priority determination key and the identifier of the data is added to the storage management table in the entry of the second priority determination key, and if only the first priority determination key is already registered in the priority control table, it is added as the first priority determination key. The identifier of the data is added to the storage management table, and if there is no first priority determination key, only the identifier of the data is stored in the storage management table, and the first priority determination key, the second priority determination key, and the When storing the data identifier in the priority control table, if the first priority determination key and the second priority determination key have already been registered in the priority control table, the first priority determination key and the second priority determination key must be stored. Add the identifier of the data to the priority control table in the priority order determination key entry, and if only the first priority determination key is registered in the priority control table, the second priority determination key and the data When storing the identifier in the priority order control table and retrieving the data from the received data storage section, the first priority order determination key and the second priority order determination key are already registered in the storage management table, and the The identifiers of the entries for the first priority determination key and the second priority determination key in the priority control table match the identifiers for the entries for the first priority determination key and the second priority determination key in the storage management table. If so, data corresponding to the identifier is acquired from the received data storage unit and transmitted, and the data corresponding to the identifier of the first priority determination key and second priority determination key of the priority control table and the storage management table are transmitted. If the identifiers of the entries of the first priority determination key and the second priority determination key do not match, transmission of data corresponding to the identifiers is suspended.

According to the present invention, it becomes possible to efficiently process data received by the received data storage unit in the order of arrival based on a plurality of priorities included in the data.

The details of at least one implementation of the subject matter disclosed herein are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the disclosed subject matter will be apparent from the following disclosure, drawings, and claims.

1 is a diagram illustrating a first embodiment of the present invention and illustrating an example of processing performed in ticket reservation sales; FIG. 1 is a block diagram showing an example of the configuration of a computer system according to a first embodiment of the present invention; FIG. FIG. 1 is a block diagram showing an example of the configuration of a queue information management unit according to a first embodiment of the present invention. 1 is a flowchart illustrating a first embodiment of the present invention and illustrating an example of a request storage process performed by a priority guarantee server. 1 is a flowchart illustrating an example of request output processing performed by a priority guarantee server according to a first embodiment of the present invention. 2 is a flowchart showing an example of priority control table deletion processing performed in request output processing according to the first embodiment of the present invention. FIG. 2 is a block diagram illustrating a second embodiment of the present invention and illustrating an example of the configuration of a data store system. FIG. 7 is a diagram illustrating a second embodiment of the present invention and illustrating an example of the configuration of a queue information management section included in a statistical information operation section. 12 is a flowchart showing an example of priority update processing performed by a priority guarantee server according to a third embodiment of the present invention. 12 is a flowchart illustrating a third embodiment of the present invention and illustrating an example of request output processing performed by a priority guarantee server.

Embodiments of the present invention will be described below based on the accompanying drawings.

As mentioned above, even as the amount of data transmitted from devices such as users increases, there is a need to process large amounts of data. Additionally, there is a growing demand for opportunities to assign priorities to multiple types of data depending on the characteristics of the data to be processed, and to more quickly transmit data specified by multiple conditions to a service implementation server.

A specific example to which the present invention is applied is frequent data reception from an IoT device typified by a smart meter. It can also be applied to email services during disasters or malfunctions, and to ticket reservation and sales systems when servers are heavily accessed.

FIG. 1 shows a first embodiment of the present invention, and is a diagram showing an example of processing performed in ticket reservation sales.

Figure 1 shows a case where there are three types of ticket dates (12/10, 12/20, 12/30) and three attributes of the user who wishes to make a reservation (gold member, silver member, bronze member). There is.

Since 12/10 is the closest ticket date, we will prioritize reservations for 12/10. Furthermore, it is an important policy in providing this service that users should be given priority to gold members. These two policies will be explained in correspondence with priorities.

A comparison with a case where reservations having multiple priorities are designed using multiple queues as in the prior art instead of using one queue as in the present invention will be described below.

When adopting a configuration of multiple queues, when sending requests to multiple service providing servers, queues for each service providing server (see FIG. 2) are required, increasing design management costs.

That is, although it is preferable not to increase the number of queues according to the priority order, such a configuration is not possible. Furthermore, when a new service providing server is added and it becomes necessary to guarantee the order of existing services, development costs such as re-designing the queue are incurred. In this case, too, if the number of queues is large, re-designing the queues becomes complicated.

Furthermore, depending on the design of the queue, the subsequent order of retrieval may be determined when the queue is stored (queue in), and no determination is made when data is retrieved from the queue (queue out or dequeue). In other words, after data is stored in the queue, the order of retrieval is not changed.

In the above case, the retrieval order cannot be changed after data is stored in the queue, so it is specified according to the state of the queue server (priority guarantee server in Figure 2) whose state (load and resources) changes over time. This means that the data cannot be retrieved with priority.

By setting a priority control key for messages in one queue, the present invention controls the order of only messages that are related to each other, thereby avoiding complication in queue design even in the same queue. This enables flexible order control.

FIG. 2 shows a block diagram of a computer system according to the first embodiment of the present invention. In this embodiment, the data to be exchanged is explained as a message, but other data may be used.

In the computer system according to the first embodiment, a priority guarantee server 300 receives a request (message) sent from a client server 102 through an input interface 302 and stores it in a queue 303 .

The queue control unit 320 gives priority to the requests stored in the queue 303 based on the information of the queue information management unit 304, and the queue control unit 320 assigns priorities to the requests stored in the queue 303 from the output interface 305 to each service providing server 104-A based on the information of the queue information management unit 304. ~ Send a request to 104-C.

Thereafter, upon receiving a response to the request sent from the service providing servers 104-A to 104-C, the priority guarantee server 300 transfers the response to the client server 102. Note that in the following, when a service providing server is not individually specified, the code "104" will be used, omitting the characters after "-".

The priority guarantee server 300 is a service providing server that provides a requested service based on the request relayed by the client server 102 that sends a request to each service providing server 104 via the network 35 and the priority guarantee server 300. 104.

The priority guarantee server 300 is a computer including a processor 31, a memory 32, a storage device 33, and a communication device 34. A queue 303 for storing requests is set in the memory 32, a queue control unit 320, an input interface 302, and an output interface 305 are stored as programs, and various tables used by the queue control unit 320 are held in a queue information management unit 304. be done.

Input interface 302 receives requests from client server 102 . The queue control unit 320 stores the requests from the input interface 302 in the queue 303, and transmits the requests in the queue 303 to the service providing server 104 via the output interface 305 in accordance with priority as described later.

Each functional unit of the queue control unit 320, input interface 302, and output interface 305 is loaded into the memory 32 as a program.

The processor 31 operates as a functional unit that provides predetermined functions by executing processing according to the programs of each functional unit. For example, the processor 31 functions as the queue control unit 320 by executing processing according to a queue control program. The same applies to other programs. Furthermore, the processor 31 also operates as a functional unit that provides functions for each of the plurality of processes executed by each program. A computer and a computer system are devices and systems that include these functional units.

The storage device 33 is composed of a non-volatile storage medium and can hold programs and tables.

FIG. 3 is a diagram showing a table held by the queue information management unit 304 of FIG. 2. The queue information management unit 304 includes a queue storage management table 309, a priority control table 310, and a request acquisition management table 313.

When storing a request in the queue 303, the queue storage management table 309 manages the request ID 307, priority order determination key 1 (308a), and priority order determination key 2 (308b) in association with each other. The queue storage management table 309 stores requests in the order of arrival using the request ID 307 as a key.

The priority order determination key 1 (308a) is, for example, the reservation date, and the priority order determination key 2 (308b) is, for example, the attribute of the member (gold member, silver member, bronze member). In this embodiment, it is assumed that a priority order determination key 1 and a priority order determination key 2 are assigned to the request sent by the client server 102.

Although this embodiment shows an example in which two priority order determination keys are used, the present invention is not limited to this, and multiple types of priority order determination keys can be used.

Further, the request ID 307 only needs to be a unique value within the computer system, and may be assigned by the input interface 302 of the priority guarantee server 300 or by the client server 102.

The request acquisition management table 313 stores the request ID 314 when a request is output from the queue 303, and manages the request output from the queue 303. The request ID 314 stored in the request acquisition management table 313 is deleted after a predetermined period of time (or at a predetermined timing).

The priority control table 310 holds a list of request IDs 307a and 307b associated with the priority determination keys 315a and 315b, using priority determination key 1 (315a) and priority determination key 2 (315b) as keys. This is a table where

The queue control unit 320 controls the transmission order of requests by referring to the priority control table 310 when storing requests in the queue 303 and when acquiring requests from the queue 303.

The queue storage management table 309 and the priority control table 310 handle similar parameters, but the priority control table 310 shows a state in which requests are sorted by priority.

When acquiring requests from the queue 303, the queue control unit 320 searches the queue storage management table 309 and extracts requests that can be acquired. When the priority determination key 1 (308a) and the priority determination key 2 (308b) are set for the request ID 307 that the queue control unit 320 attempts to acquire, the queue control unit 320 determines whether or not the request ID 307 can be acquired. Then, the priority control table 310 is referred to.

The priority order determination key 1 (308a) and the priority order determination key 2 (308b) are used to determine whether the acquired requests are subject to order control when being transmitted when the queue control unit 320 takes out requests from the queue 303. This information is used to determine whether or not the

Note that among the requests stored in the queue 303, the queue control unit 320 transmits requests to which the same priority determination key 1 and priority determination key 2 are assigned in the order in which they are stored.

FIG. 4 is a flowchart illustrating an example of a request storage process performed by the priority guarantee server 300. This process is executed at a predetermined timing, for example, when the input interface 302 receives a request.

In the request storage process, the queue control unit 320 obtains the priority determination key 1 (308a) (step 500 ) in order to determine whether or not to perform priority control on the received request. The presence or absence of the value 308a) is determined (step 501).

If there is a value for priority determination key 1 (308a), the process advances to step 502; otherwise, the process advances to step 514. In step 502, the queue control unit 320 obtains information on the priority control table 310.

Next, the queue control unit 320 determines whether the priority determination key 1 (308a) acquired in step 500 has been registered in the priority control table 310 (step 503). The queue control unit 320 proceeds to step 505 if it has been registered, and proceeds to step 504 if it has not been registered.

In step 504, the queue control unit 320 newly stores the priority determination keys 1 and 2 (315a, 315b) and the request ID 307a in the priority control table 310.

Then, the queue control unit 320 sorts the priority control table 310 storing information on new requests in ascending order of priority determination key 1 (315a) and descending order of priority determination key 2 (315b).

In this embodiment, the value of the priority determination key 1 (315a) is a serial value indicating the reservation date, and the value of the priority determination key 2 (315b) is a value indicating the attributes of the member, such as gold member = 3, silver member = 3. Member = 2, Bronze member = 1.

Next, the queue control unit 320 acquires the presence or absence of the value of the priority order determination key 2 (308b) (step 505), and determines the presence or absence of the value of the priority order determination key 2 (308b) (step 506). The queue control unit 320 proceeds to step 507 if there is a value for priority determination key 2 (308b), and proceeds to step 513 if there is no value.

In step 507, the queue control unit 320 stores the request ID (307a), priority determination key 1 (308a), and priority determination key 2 (308b) in the queue storage management table 309 in association with each other.

In step 513, the queue control unit 320 stores the request ID (307) and priority order determination key 1 (308a) in association with each other in the queue storage management table 309, and then proceeds to step 515.

Next, the queue control unit 320 obtains information on the priority control table 310 (step 508). Thereafter, the queue control unit 320 determines whether priority order determination key 2 (315b) has been registered in the priority order control table 310 (step 509). If the queue control unit 320 has already registered, it adds a new request ID 307b after the previously stored request ID 307a (step 510).

On the other hand, if they are not registered, the queue control unit 320 adds new entries for the already registered priority determination key 1 (315a) and the new priority determination key 2 (315b) to the priority control table 310. and stores the request ID 307a (step 511).

Then, the queue control unit 320 sorts the priority order control table 310 storing information on new requests in ascending order of priority order determination key 1 (315a) and descending order of priority order determination key 2 (315b).

Further, if there is no value for the priority order determination key 1 in the determination in step 501, the queue control unit 320 stores the request ID 307 in the queue storage management table 309 (step 514).

After the above processing, the queue control unit 320 stores the request in the queue 303 (step 515), and repeats the above processing every time a request is input.

Through the above processing, the queue control unit 320 determines a new priority for a request that the priority guarantee server 300 receives from the client server 102 if the priority determination keys 1 and 2 are not registered in the priority control table 310. It is registered in the priority control table 310 as keys 1 and 2 (315a, 315b), and a request ID 307a is added. Then, the queue control unit 320 sorts the priority order control table 310 in ascending order of priority order determination key 1 and in descending order of priority order determination key 2.

The queue control unit 320 also registers the request ID 307, priority determination key 1 (308a), and priority determination key 2 (308b) in the queue storage management table 309, and stores the request received from the client server 102 in the queue 303. Store.

Every time the queue control unit 320 receives a request, it adds a key to the priority control table 310 according to the presence or absence of priority determination keys 1 and 2, and then adds a request ID 307a to the order of priority determination keys 1 and 2. The priority control table 310 is sorted in descending order of priority determination key 2.

FIG. 5A is a flowchart illustrating an example of request output processing performed by the priority guarantee server. In the request output process, the queue control unit 320 acquires information from the queue storage management table 309 in order to determine requests that can be output to the service providing server 104 (step 601).

The queue control unit 320 acquires the request ID 307 of the first entry (or record) and the priority determination key 1 (308a) from the acquired information in the queue storage management table 309, and determines whether or not the priority determination key 1 exists. (Step 602). The queue control unit 320 proceeds to step 603 if the priority order determination key 1 exists, and proceeds to step 616 if the priority order determination key 1 does not exist.

In step 603, the queue control unit 320 acquires the request ID 307 and the priority determination key 2 (308b) from the first record of the acquired queue storage management table 309, and determines the presence or absence of the priority determination key 2 (step 603). The queue control unit 320 proceeds to step 604 if the priority order determination key 2 exists, and proceeds to step 610 if the priority order determination key 2 does not exist.

In step 604, the queue control unit 320 needs to maintain the priority order of request transmission to each service providing server 104. Therefore, the queue control unit 320 obtains information from the priority control table 310 (step 604).

Next, the queue control unit 320 determines whether the request ID 307a (or 307b) obtained from the priority control table 310 is the first entry (step 605).

If the request ID 307a of the first entry in the priority control table 310 matches the request ID 307 of the first entry in the queue storage management table 309, the queue control unit 320 proceeds to step 606; otherwise, the process proceeds to step 606. finish.

In step 606, the queue control unit 320 detects the request stored in the queue 303 because the request ID 307a of the first entry in the priority control table 310 matches the request ID 307 of the first entry in the queue storage management table 309. A request with a request ID matching the request ID 307a is acquired from the queue 303.

Next, the queue control unit 320 transmits the request to each service providing server 104 via the output interface 305 (step 607), and stores the transmitted request ID 314 in the request acquisition management table 313 (step 608).

Then, the queue control unit 320 deletes the entry of the transmitted request ID 307 (priority determination key 1 (308a), priority determination key 2 (308b)) from the queue storage management table 309 (step 609).

Next, the queue control unit 320 deletes the transmitted request ID 307a (or 307b) from the priority control table 310, and then ends the process (step 650). This process will be described later with reference to FIG. 5B.

Note that if the determination result in step 605 is NO, it means that the request to be obtained is not stored in the first entry of the priority control table 310, and it is determined that there are other requests to be sent with priority. , then the process ends without executing anything.

Further, if the determination result in step 603 is NO, the first entry in the queue storage management table 309 does not have a priority determination key 2 but has a priority determination key 1, so that requests cannot be sent to each service providing server 104. Need to maintain priorities. Therefore, information is obtained from the priority control table 310 (step 610).

Next, the queue control unit 320 determines whether the request ID 307a (or 307b) obtained from the priority control table 310 is the first entry (step 611).

If the request ID 307a of the first entry in the priority control table 310 matches the request ID 307 of the first entry in the queue storage management table 309, the queue control unit 320 proceeds to step 612; otherwise, the process proceeds to step 612. finish.

In step 612, the queue control unit 320 detects the request stored in the queue 303 because the request ID 307a of the first entry in the priority control table 310 matches the request ID 307 of the first entry in the queue storage management table 309. A request with a request ID matching the request ID 307a is acquired from the queue 303.

Next, the queue control unit 320 transmits the request to each service providing server 104 via the output interface 305 (step 613), and stores the transmitted request ID 314 in the request acquisition management table 313 (step 614).

The queue control unit 320 then deletes the entry of the transmitted request ID 307 from the queue storage management table 309 (step 615), and then proceeds to step 650.

Note that if the determination result in step 611 is NO, it means that the request ID that you attempted to obtain is not stored at the beginning, and it is determined that there are other requests that should be sent with priority, so nothing can be done after that. Terminate processing without doing so.

Further, if the determination result in step 602 is NO, the request does not have priority order determination key 1 or priority order determination key 2, so there is no priority order for the request to be transmitted to each service providing server 104.

Therefore, the queue control unit 320 obtains the request corresponding to the first request ID 307 of the queue storage management table 309 from the queue 303 (step 616). Next, the queue control unit 320 transmits the acquired request to each service providing server 104 (step 617), and the queue control unit 320 stores the transmitted request ID in the request acquisition management table 313 (step 618). . Finally, the queue control unit 320 deletes the entry of the request ID from the queue storage management table 309 (step 619), and then proceeds to step 700.

In step 650, as shown in FIG. 5B, first, in step 651, the queue control unit 320 refers to the entry including the transmitted request ID 307a in the priority control table 310, and determines whether there is another request ID 307b in the entry. It is determined whether or not (step 652).

If there is another request ID 307b, the process proceeds to step 653, and the queue control unit 320 deletes only the transmitted request ID 307a. On the other hand, if there is no other request ID 307b, the process proceeds to step 704, and the queue control unit 320 deletes the entry including the transmitted request ID 307a.

Through the above processing, the queue control unit 320 temporarily stores the received requests in the queue 303 in the order of arrival, and when taking out the requests from the queue 303, the priority determination key 1 (315a) and the priority determination key 2 (315b) ) are sequentially output from the first entry of the priority control table 310 sorted in a predetermined order and transmitted to the service providing server 104.

This allows the priority guarantee server 300 to process received requests with high efficiency while maintaining the order of the priority determination keys 1 and 2. In this embodiment, it is assumed that priority determination keys 1 and 2 are assigned to requests from the client server 102, and the processing in steps 610 to 615 and 616 to 619 when there is no priority determination key is This will be an exception handling.

Note that although this embodiment shows an example in which requests are stored in the queue 303, the present invention is not limited to this. A buffer may be set in the memory 32 instead of the queue 303, and received requests may be stored in this buffer.

That is, the priority guarantee server 300 only needs to set an area (received data storage unit) on the memory 32 for storing received requests in the order of arrival, and uses a storage area that does not have a FIFO (First In First Out) function. be able to.

Further, in this embodiment, an example has been shown in which the priority guarantee server 300 receives requests including a plurality of types of priorities, but the priority level guarantee server 300 is not limited to requests. For example, if the priority guarantee server 300 accepts data including multiple types of priorities, temporarily stores it in the received data storage unit, and retrieves the data from the received data storage unit according to the multiple types of priorities. good.

FIG. 6 is a block diagram showing an example of the configuration of a data store system according to a second embodiment of the present invention. The data store system includes an Advanced Message Queue (AMQ), and by distributing and managing in-memory queues that span multiple message queue servers 730a and 730b, it is possible to smooth out sudden traffic and to prevent uninterrupted traffic. This system is effective for high-speed, large-volume data processing systems. This embodiment shows an example of applying queue control similar to that of the first embodiment to an extended message queue to efficiently process requests including a plurality of types of priorities.

The data store system includes clients 700a, 700b, a load balancer 720, message queue servers 730a, 730b, a load balancer 770, and service providing servers 780a, 780b.

Note that the load balancer 720 and clients 700a and 700b and the load balancer 770 and service providing servers 780a and 780b are connected via a network (not shown). Furthermore, the message queue servers 730a and 730b are connected to each other via a network (not shown).

The service providing servers 780a and 780b are servers that provide predetermined services to the clients 700a and 700b. The service providing server 780a and the service providing server 780b have the same configuration and distribute the load. A service providing program 790a is running on the service providing server 780a. A service providing program 790b is running on the service providing server 780b.

The clients 700a and 700b are clients that use the services of the service providing servers 780a and 780b. Client 700a and client 700b have the same configuration. The client 700a is running a client program 710a. The client 700b is running a client program 710b.

The load balancer 720 distributes requests sent by the client programs 710a and 710b of the clients 700a and 700b to the plurality of message queue servers 730a and 730b.

Message queue servers 730a and 730b are computers that temporarily store message data of requests from clients 700a and 700b to service providing servers 780a and 780b, and perform queue control of message queues. The message queue server 730a and the message queue server 730b have the same configuration, and the load is distributed.

The message queue server 730a is a server that constitutes a data store system, and includes a storage device 760a, a distributed data store 750a, and a message queue control unit 740a.

Similarly, the message queue server 730b is a server that constitutes a data store system, and includes a storage device 760b, a distributed data store 750b, and a message queue control unit 740b.

The message queue control units 740a and 740b are realized by executing a software program on a processor (not shown), and control queuing of requests (message data). The internal configuration and processing of the message queue control units 740a and 740b will be described later.

Distributed data stores 750a, 750b share storage devices 760a, 760b of message queue servers 730a, 730b, and make message queues (not shown) mutually usable. Note that the message queue is set in the distributed data stores 750a, 750b of the shared storage devices 760a, 760b.

The load balancer 770 distributes message data sent by the message queue control units 740a and 740b of the message queue servers 730a and 730b to the service providing servers 780a and 780b.

Note that in FIG. 6, there are two clients 700a and 700b, two message queue servers, and two service providing servers, but this is just an example of the configuration, and even if two or more clients, message queue servers, and service providing servers exist. good.

Next, details of the message queue servers 730a and 730b will be explained. This embodiment will be explained using the message queue server 730a as an example.

The message queue control unit 740a functions by a processor (not shown) executing a software program and using hardware resources such as a main storage device and an auxiliary storage device.

The message queue control section 740a includes a request transmission/reception section 741, a statistical information operation section 742, a message data information summary operation section 743, a registry update section 745, a message data information operation section 746, and a message data information selection section 749. Contains.

The request transmitting/receiving unit 741 transmits and receives request message data to and from a plurality of clients 700a and 700b and service providing servers 780a and 780b.

The statistical information operation unit 742 calculates statistical information of message data of requests received from the clients 700a and 700b, and stores it in the statistical information registry 747 via the registry update unit 745. The statistical information of message data is information summarizing the addition of message data to the storage devices 760a and 760b and the acquisition of message data from the storage devices 760a and 760b.

In addition, the message data information selection unit 749 that has received the acquisition source determination request accesses the statistical information registry 747, the message data information summary registry 751, and the message queue setting registry 748, and determines the average number of acquired message data and the message data information. Get the summary and the number of message queue control subjects.

In the message queue setting registry 748, various setting information regarding message queues is registered in advance. The number of message queue control subjects is registered as one of the setting information. The number of message queue control subjects is information indicating the number of subjects that control the message queue.

The main body of message queue control is the message queue control units 740a and 740b.In other words, it can be said to be a message queue control program executed by a processor in the message queue servers 730a and 730b.

FIG. 7 is a diagram showing an example of the configuration of the queue information management section 304 included in the statistical information operation section 742.

The queue information manager 304 includes data structures that control the priority of message queues implemented by distributed data stores 750a, 750b (AMQ). Similar to FIG. 3 of the first embodiment, the queue information management unit 304 includes a queue storage management table 309, a priority control table 310, and a request acquisition management table 313.

The queue storage management table 309 differs from the configuration of the first embodiment in that addresses 800 of the message queue servers 730a and 730b are added. The other configurations are the same as those of the first embodiment. Although the queue system of this embodiment is controlled using FIFO, each request ID can be managed using an address 800 by using a data store system. The address 800 can be the IP address or MAC address of the message queue servers 730a, 730b.

The priority order control table 310 is a table that uses priority order determination key 1 (308a) and priority order determination key 2 (308b) as keys, and includes a list of request IDs 307a and 307b associated with each priority order determination key.

The message queue control unit 740a controls the transmission order of requests by referring to the priority control table 310 when storing requests in the message queue and when acquiring requests from the message queue.

When acquiring requests from the message queue, the message queue control unit 740a searches the queue storage management table 309 and extracts requests that can be acquired. If priority order determination key 1 (308a) and priority order determination key 2 (308b) are set for the request ID 307 that is attempted to be obtained, the priority order control table 310 is used to determine whether or not the request ID 307 can be obtained. refer.

In this embodiment, when the message queue control unit 740a takes out a request from the message queue, it specifies the address 800 corresponding to the request to be taken out, and by taking out the request from the message queue, the data store system sends the request from the message queue. You can control the priority of requests. The same applies to the message queue control unit 740b.

Note that although this embodiment shows an example in which received requests are stored in a message queue, the present invention is not limited to this. Instead of a message queue, a buffer may be set up in the distributed data stores 750a, 750b, and received requests may be stored in this buffer.

That is, in the message queue servers 730a and 730b, an area (received data storage unit) for storing received requests in the order of arrival may be set on the distributed data stores 750a and 750b, and a storage area without a FIFO function may be used. I can do it.

Furthermore, the priority for the attribute of the priority order determining key 2 can be set according to the size (capacity) of the queue 303 or buffer. For example, if the size of the queue 303 is large, the priority of the attribute of the priority determination key 2 described above is set, and if the size of the queue 303 is small, the message queue servers 730a and 730b receive the message and then provide service. It is possible to set a high priority for attributes that require a long delay before being output to the providing server 104.

Furthermore, the priority for the attribute of the priority order determination key 2 is not limited to the size of the received data storage unit (queue 303 or buffer), and the priority is not limited to the size of the received data storage unit (queue 303 or buffer), but after the message is received by the message queue servers 730a and 730b and sent to the service providing server 104. A high priority may be set for the attribute of the priority determination key 2 that has a long delay time until output.

FIG. 8 is a flowchart showing an example of priority update processing performed by the priority guarantee server 300 according to the third embodiment of the present invention. This embodiment shows an example in which the priority of the priority order determination key 2 shown in the first embodiment is variably controlled.

In the first embodiment, the priority (priority order) for the attribute of the priority order determination key 2 is fixed so that the priority becomes higher as the member becomes a bronze member, a silver member, and a gold member. If the number of requests from silver members (or bronze members) increases temporarily, if priority is always given to gold members, there is a risk that the queue 303 will not be able to be operated efficiently.

Therefore, in this embodiment, an example will be shown in which the priority order is dynamically controlled according to the number of requests for each attribute of the priority order determination key 2.

The process in FIG. 8 is repeatedly executed at a predetermined period. First, the queue control unit 320 sets a preset threshold Th for each attribute of the priority order determining key 2 (step 620). The threshold Th is, for example, the ratio of requests for each attribute of the priority determining key 2 to the queue 303, and is set to 99%.

The queue control unit 320 calculates the number of requests in the queue 303 for each attribute (priority) of the priority determination key 2, and calculates the number of requests for each attribute of the priority determination key 2 and the maximum storage number of the queue 303. The ratio (occupancy) is calculated (step 621).

Next, the queue control unit 320 determines whether there is an attribute (priority) that exceeds the threshold Th among the occupancy rates for each attribute (step 622). If there is an attribute whose occupancy rate exceeds the threshold Th, the process proceeds to step 623; otherwise, the process ends.

In step 623, the queue control unit 320 increases the priority of the attribute whose occupancy rate exceeds the threshold Th. Similar to the first embodiment, the priority for the attribute of the priority order determination key 2 is priority = 1 for bronze members, priority = 2 for silver members, and priority = 3 for gold members. If so, the queue control unit 320 adds "3" to the priority of the attribute that exceeds the threshold Th.

Then, in step 624, the queue control unit 320 sorts and updates the priority control table 310 with the changed priorities.

Through the above processing, when the number of requests with low priority temporarily increases, the priority can be dynamically increased, thereby making it possible to use the queue 303 efficiently. Furthermore, the queue control unit 320 may return the priority corresponding to the attribute to its original value when the occupancy rate becomes equal to or less than the threshold Th.

FIG. 9 is a flowchart showing an example of request output processing performed by the priority guarantee server 300, according to the third embodiment of the present invention. In this embodiment, instead of the priority of the first embodiment, a processing number is set for the attribute of priority determination key 2, so that even if a large number of requests for an attribute with a high priority are sent, a request with a low priority is set. An example of preventing requests for attributes from being processed rarely is shown below.

The process in FIG. 9 is performed in place of FIGS. 5A and 5B of the first embodiment. In this embodiment, as the number of items to be processed for the attribute of priority determination key 2, the number of items to be processed for gold members N1 = 7 items, the number of items to be processed for silver members N2 = 2 items, and the number of items to be processed for bronze members N3 = 1 item. shown, but not limited to. For example, the ratio of processing requests for gold members, silver members, and bronze members may be 7:2:1.

The queue control unit 320 selects N1 gold member request IDs 307a (307b) from the top of the priority control table 310 (step 630). Note that if the number of request IDs 307a of gold members in the queue 303 is less than N1, the queue control unit 320 selects all the gold members.

Next, the queue control unit 320 transmits requests in order from the beginning of the request ID 307a of the selected N1 gold members (step 631). That is, the queue control unit 320 takes out the request corresponding to the request ID 307a from the queue 303 and transmits it to the service providing server 104 via the output interface 305.

The queue control unit 320 stores the transmitted request ID 307a in the request acquisition management table 313, deletes the transmitted request ID 307a from the priority control table 310, and deletes the transmitted request ID 307a from the queue storage management table 309 corresponding to the request ID 307a. The entry is deleted (step 632). Note that, if no other request ID 307b is stored in the entry including the transmitted request ID 307a in the priority order control table 310, the queue control unit 320 deletes the entry.

The queue control unit 320 determines whether or not there is an unsent request ID 307a selected by the gold member (step 633). If there is an unsent request ID 307a, the process returns to step 631 and repeats the above process. On the other hand, if there is no unsent request ID 307a, the process advances to step 634.

The queue control unit 320 selects N2 silver member request IDs 307a (307b) from the top of the priority control table 310 (step 634). Note that if the number of request IDs 307a of silver members in the queue 303 is less than N2, the queue control unit 320 selects all the silver members.

Next, the queue control unit 320 transmits requests in order from the beginning of the selected N2 request IDs 307a (step 635). That is, the queue control unit 320 takes out the request corresponding to the request ID 307a from the queue 303 and transmits it to the service providing server 104 via the output interface 305.

The queue control unit 320 stores the transmitted request ID 307a in the request acquisition management table 313, deletes the transmitted request ID 307a from the priority control table 310, and deletes the transmitted request ID 307a from the queue storage management table 309 corresponding to the request ID 307a. The entry is deleted (step 636). Note that, if no other request ID 307b is stored in the entry including the transmitted request ID 307a in the priority order control table 310, the queue control unit 320 deletes the entry.

The queue control unit 320 determines whether or not there is an unsent request ID 307a selected by the silver member (step 637). If there is an unsent request ID 307a, the process returns to step 635 and repeats the above process. On the other hand, if there is no unsent request ID 307a, the process advances to step 638.

The queue control unit 320 selects N3 bronze member request IDs 307a (307b) from the top of the priority control table 310 (step 638). Note that, if the number of request IDs 307a of bronze members in the queue 303 is less than N3, the queue control unit 320 selects all of the bronze members.

Next, the queue control unit 320 transmits requests in order from the beginning of the selected N3 request IDs 307a (step 639). That is, the queue control unit 320 takes out the request corresponding to the request ID 307a from the queue 303 and transmits it to the service providing server 104 via the output interface 305.

The queue control unit 320 stores the transmitted request ID 307a in the request acquisition management table 313, deletes the transmitted request ID 307a from the priority control table 310, and deletes the transmitted request ID 307a from the queue storage management table 309 corresponding to the request ID 307a. The entry is deleted (step 640). Note that, if no other request ID 307b is stored in the entry including the transmitted request ID 307a in the priority order control table 310, the queue control unit 320 deletes the entry.

The queue control unit 320 determines whether or not there is an unsent request ID 307a selected by the bronze member (step 641). If there is an unsent request ID 307a, the process returns to step 639 and repeats the above process. On the other hand, if there is no unsent request ID 307a, the process ends.

Through the above processing, requests for each attribute of the priority determination key 2 stored in the queue 303 are output to the service providing server 104 at a predetermined ratio, and even if a large number of requests for attributes with high priority are sent, It becomes possible to reliably process requests with low priority attributes.

Note that since the process of this embodiment processes N1+N2+N3 requests, it may be repeatedly executed every time the number of requests stored in the queue 303 reaches a predetermined number or a predetermined ratio.
<Conclusion>

As described above, the priority guarantee server 300 and data store system of the first to fourth embodiments described above can have the following configuration.

(1) A computer (priority guarantee server 300) including a processor (31), a memory (32), and a communication device (34), wherein the computer (priority guarantee server 300) includes a plurality of priorities (priority It has a control unit (queue control unit 320) that controls data (requests) including decision keys 1 and 2 (308a, 308b), and the control unit (320) is configured to control data (queue control unit 320) that controls data (requests) including decision keys 1 and 2 (308a, 308b), The data including the priorities (308a, 308b) are stored in the received data storage unit (queue 303) in the order of arrival, and when the data is retrieved from the received data storage unit (303), the data including the priorities (308a, 308b) Change the order of retrieval based on

With the above configuration, the queue control unit 320 temporarily stores received requests in the queue 303 in the order of arrival, and when taking out requests from the queue 303, the priority determination key 1 (315a) and the priority determination key 2 (315b) ) are sequentially output from the first entry of the priority control table 310 sorted in a predetermined order and transmitted to the service providing server 104. This makes it possible to process requests with multiple priorities with high efficiency.

(2) In the computer (300) according to (1) above, the plurality of priorities (308a, 308b) are set based on the capacity of the received data storage section (303).

With the above configuration, for example, when the size of the queue 303 is large, the priority of the attribute of the preset priority determination key 2 is set, and when the size of the queue 303 is small, the priority guarantee server 300 It is possible to set a high priority to an attribute that requires a long delay from receiving to outputting to the service providing server 104.

(3) The computer (300) according to (1) above, wherein the control unit (320) has a ratio according to the plurality of priorities (308a, 308b), and the received data storage unit ( 303), the order of extraction is changed based on the ratio.

With the above configuration, requests for each attribute of the priority determination key 2 stored in the queue 303 are output at a predetermined ratio, and even if a large number of requests for attributes with high priority are sent, requests for attributes with low priority are output. requests can be reliably processed.

(4) In the computer (300) according to (1) above, the control unit (320) acquires a plurality of priorities (308a, 308b) from the received data and applies the received data to the computer (300). An identifier (request ID 307) is set, the identifier (307) of the data is associated with the plurality of priorities (308a, 308b) using the plurality of priorities (308a, 308b) as keys, and priority control information (priority order control table 310), and the priority control information (310) is sorted in the order preset for the plurality of priorities (308a, 308b).

With the above configuration, when storing requests, the priority control table 310 is sorted in the order set in the priority determination keys 1 and 2, and the order of the request IDs 307 is updated. This allows the priority guarantee server 300 to process received requests with high efficiency while maintaining the order of the priority determination keys 1 and 2.

(5) In the computer (300) according to (4) above, the control unit (320) associates the plurality of priorities (308a, 308b) with the identifier (307) of the received data, Using the identifier (307) as a key, the data is stored in the data management information (queue storage management table 309) in the order of arrival of the data.

With the above configuration, in the queue storage management table 309, it is possible to associate the request ID 307 with the priority order determination keys 1 and 2 and manage them in the order of arrival.

(6) In the computer (300) according to (1) above, the control unit (320) controls the number of data in the received data storage unit (303) for each priority (308a, 308b). The priority order of the priority data (308a, 308b) whose number of data exceeds a preset threshold is changed.

With the above configuration, when the number of low-priority requests temporarily increases, the queue 303 can be used efficiently by dynamically increasing the priority.

Note that the present invention is not limited to the above-described embodiments, and includes various modifications. For example, the embodiments described above are described in detail to explain the present invention in an easy-to-understand manner, and the present invention is not necessarily limited to having all the configurations described. Furthermore, it is possible to replace a part of the configuration of one embodiment with the configuration of another embodiment, and it is also possible to add the configuration of another embodiment to the configuration of one embodiment. Furthermore, addition, deletion, or replacement of other configurations to some of the configurations of each embodiment may be applied singly or in combination.

Further, each of the above-mentioned configurations, functions, processing units, processing means, etc. may be partially or entirely realized in hardware by designing, for example, an integrated circuit. Moreover, each of the above-mentioned configurations, functions, etc. may be realized by software by a processor interpreting and executing a program that realizes each function. Information such as programs, tables, files, etc. that implement each function can be stored in a memory, a recording device such as a hard disk, an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.

Further, the control lines and information lines are shown to be necessary for explanation purposes, and not all control lines and information lines are necessarily shown in the product. In reality, almost all components may be considered to be interconnected.

31 Processor 32 Memory 34 Communication device 303 Queue 307 Request ID
308a, 308b Priority determination keys 1, 2
309 Queue storage management table 310 Priority control table 320 Queue control unit 313 Request acquisition management table 740a, 740b Message queue server

Claims (5)

A computer including a processor, a memory, and a communication device,
a control unit that controls data including a first priority determination key and a second priority determination key as the plurality of priorities received by the communication device ;
a received data storage unit that stores the data in the order of arrival;
a storage management table that manages the first priority determination key and second priority determination key of the data in association with the identifier of the data;
a priority control information table that stores one or more identifiers of the data in association with the priorities of the first priority determination key and the second priority determination key;
has
The control unit includes:
storing data including a plurality of priorities received by the communication device in the received data storage unit in the order of arrival;
When acquiring a first priority determination key and a second priority determination key as a plurality of priorities from the received data, setting an identifier to the received data, and storing it in the storage management table,
If the first priority determination key and the second priority determination key are already registered in the priority control table, the identifier of the data is stored in the entry of the first priority determination key and the second priority determination key in the management table. Add to
If only the first priority determination key has been registered in the priority control table, add the first priority determination key and the data identifier to the storage management table;
If there is no first priority determination key, only the identifier of the data is stored in the storage management table, and when storing the first priority determination key, the second priority determination key, and the identifier of the data in the priority control table. for,
If the first priority determination key and the second priority determination key have already been registered in the priority control table, the identifier of the data is assigned to the entry of the first priority determination key and the second priority determination key for priority control. add to table,
If only the first priority determination key has been registered in the priority control table, store the second priority determination key and the identifier of the data in the priority control table;
When retrieving the data from the received data storage section,
The first priority determination key and the second priority determination key have been registered in the storage management table, and the identifiers of the entries for the first priority determination key and the second priority determination key in the priority control table , if the identifiers of the entries of the first priority determination key and the second priority determination key of the storage management table match, acquiring data corresponding to the identifier from the received data storage unit and transmitting it;
The identifiers of the first priority determination key and second priority determination key of the priority control table do not match the identifiers of the entries of the first priority determination key and second priority determination key of the storage management table. A computer characterized in that, in this case, transmission of data corresponding to the identifier is suspended . The computer according to claim 1,
When the control unit retrieves the data from the received data storage unit,
If the second priority determination key has not been registered in the storage management table, transmit if the identifier of the first entry in the priority control table matches the identifier of the first entry in the storage management table. A calculator characterized by: A data control method for controlling data received by a computer including a processor, a memory, and a communication device, the method comprising:
a data storage step in which the computer stores data including a first priority determination key and a second priority determination key as the plurality of priorities received by the communication device in the received data storage unit in the order of arrival;
The computer acquires a first priority determination key and a second priority determination key as a plurality of priorities from the received data, sets an identifier to the received data, and stores the same in a storage management table. a storage step;
a priority control table storage step in which the computer stores the first priority determination key, the second priority determination key, and the identifier of the data in a priority control table;
a data output step in which the computer retrieves the data from the received data storage unit;
including ;
The storing management table storing step includes:
If the first priority determination key and the second priority determination key are already registered in the priority control table, the identifier of the data is stored in the entry of the first priority determination key and the second priority determination key in the management table. Add to
If only the first priority determination key has been registered in the priority control table, add the first priority determination key and the data identifier to the storage management table;
If there is no first priority determination key, only the identifier of the data is stored in the storage management table,
The step of storing the priority control table
If the first priority determination key and the second priority determination key have already been registered in the priority control table, the identifier of the data is assigned to the entry of the first priority determination key and the second priority determination key for priority control. add to table,
If only the first priority determination key has been registered in the priority control table, store the second priority determination key and the identifier of the data in the priority control table;
The data output step includes:
The first priority determination key and the second priority determination key have been registered in the storage management table, and the identifiers of the entries for the first priority determination key and the second priority determination key in the priority control table , if the identifiers of the entries of the first priority determination key and the second priority determination key of the storage management table match, acquiring data corresponding to the identifier from the received data storage unit and transmitting it;
The identifiers of the first priority determination key and second priority determination key of the priority control table do not match the identifiers of the entries of the first priority determination key and second priority determination key of the storage management table. A data control method characterized by suspending transmission of data corresponding to the identifier in the case where the identifier is the identifier . 4. The data control method according to claim 3,
The data output step includes:
If the second priority determination key has not been registered in the storage management table, transmit if the identifier of the first entry in the priority control table matches the identifier of the first entry in the storage management table. A data control method characterized by: A data store system having a plurality of message control servers including a processor, a memory, and a communication device,
The message control server includes:
a received data storage unit shared by the plurality of message control servers;
a control unit that controls data including a first priority determination key and a second priority determination key as the plurality of priorities received by the communication device;
a storage management table that manages the first priority determination key and second priority determination key of the data in association with the identifier of the data;
a priority control information table that stores one or more identifiers of the data in association with the priorities of the first priority determination key and the second priority determination key;
has
The control unit includes:
storing data including a plurality of priorities received by the communication device in the received data storage unit in the order of arrival;
When acquiring a first priority determination key and a second priority determination key as a plurality of priorities from the received data, setting an identifier to the received data, and storing it in the storage management table,
If the first priority determination key and the second priority determination key are already registered in the priority control table, the identifier of the data is stored in the entry of the first priority determination key and the second priority determination key in the management table. Add to
If only the first priority determination key has been registered in the priority control table, add the first priority determination key and the data identifier to the storage management table;
If there is no first priority determination key, only the identifier of the data is stored in the storage management table,
When storing the first priority determination key, the second priority determination key, and the data identifier in the priority control table,
If the first priority determination key and the second priority determination key have already been registered in the priority control table, the identifier of the data is assigned to the entry of the first priority determination key and the second priority determination key for priority control. add to table,
If only the first priority determination key has been registered in the priority control table, store the second priority determination key and the identifier of the data in the priority control table;
When retrieving the data from the received data storage section,
The first priority determination key and the second priority determination key have been registered in the storage management table, and the identifiers of the entries for the first priority determination key and the second priority determination key in the priority control table , if the identifiers of the entries of the first priority determination key and the second priority determination key of the storage management table match, acquiring data corresponding to the identifier from the received data storage unit and transmitting it;
The identifiers of the first priority determination key and second priority determination key of the priority control table do not match the identifiers of the entries of the first priority determination key and second priority determination key of the storage management table. A data store system characterized in that, in some cases, transmission of data corresponding to the identifier is suspended .

Images