JPS62248336A - Managing method for queue of center in star shaped system - Google Patents

Abstract

PURPOSE:To suppress the accumulation of commands leaving unprocessed, by deciding whether a sequence of processes are necessary or not when the command is inputted, and processing the command with the highest priority as a queue corresponding to each of the outgoing origin, and the transmission opposite of the command respective1y, when it is decided that a sequence of processes are necessary. CONSTITUTION:When the command is inputted from an i/o51 to a center 50, it is decided whether a sequence of processes for the command are necessary or not. When it is necessary to perform a sequence of processes, the command is set as the first queue for an i/o54 preferentially even when a previous appointment for the i/o54 that is a transmission opposite, is present. For this reason, when a response from the i/o54 is performed by the command corresponding to a queue 1, it is set as a queue 2. When the command for which a sequence of processes are not necessary, is inputted, queues are set as queues 4, 5-10, and they are connected in order to the queue of the i/o at each transmission opposite.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a center queue management method in a constellation system in which a plurality of terminals are connected to a center and key management is performed for each terminal.

BACKGROUND OF THE INVENTION FIG. 4 is a conceptual diagram showing the configuration of a layered system to which a center queue management method in a conventional constellation system is applied. This star system consists of a center 10 and a plurality of terminals (hereinafter referred to as i) connected to each other via the center 10.
10) 11°12, ..., 16. In such a star system, each i10 l'l,
Commands are sent from 12, . . . , 16 to the center 10 as appropriate. And center 10
In this case, command processing is ordered as shown in FIG.

First, when a command is input from, for example, 110ff to the center 10, this command is
1. And which i is the destination of this command?
/ o is determined. In this case, the destination is 110
14, this Kinney-1 is registered as the first transmission queue (hereinafter referred to as TXQ) for 11014 (see the number in the circle in the figure). Next, when a new command is entered into the center 10 (in this case the source is i/
.

12), this command is assumed to be Kinney-2. Then, it is determined which I/O is the destination of this command (in this case, it is 11011), and the I/O is sent.

It is registered as the first TXQ for 11.

Thereafter, commands input to the center 10 are sequentially queued, it is determined to which I/O they are to be sent, and they are sequentially registered as a TXQ for that I/O.

After such registration has progressed to queue 8 as shown in FIG.
When a response command is input from 14 to the center 10, this response command is made into a queue 9 and registered in a reception key (hereinafter referred to as RXQ). After determining that the destination of this response command is 11011,
It is connected to the last column as TXQ for this 110ff.

The above will be explained in more detail with reference to the flowchart of FIG.

First, it is determined whether a received command has been input in response to a command from a sender to a destination (step (hereinafter referred to as ST) 1). If it is determined as "Yes (Y)", it is determined to which I/O this command should be connected (Sr1), and it is connected to the last column of the transmission queue (TXQ) for this command ( Sr1
). Next, at that stage (appropriate commands have been input from each I/O), it is determined whether a transmission queue (T XQ ) exists (Sr1). Here, if the determination is "Y", the command corresponding to the youngest TXQ is sent to that i10 (Sr5), and the operation returns to STI.

If Sr1 determines "'No (N) jt", the operation returns to STI. Also, if Sr1 determines "N",
The operation proceeds to Sr1.

Problems to be Solved by the Invention However, in the conventional method as described above, a command must be issued even if it is known that a negative response will be returned, and commands that are not processed due to negative responses are accumulated. , there was a problem that the processing capacity of the system decreased.

The present invention has been made in view of the above problem, and when a command that requires a series of processing such as a subsequent command is input, a queue is set so that this command is processed preferentially. It is an object of the present invention to provide a center queue management method in a star system that suppresses the accumulation of unprocessed commands.

Means for Solving the Problems In order to achieve the above object, the present invention determines when a command is input from a source, determines whether this command requires a series of processing at the center, and executes the series of processing. When it is determined that it is necessary, queues are set with top priority for the calling and called terminals.

When a command is input from a working terminal, the center determines whether this command requires a series of processing (such as a response to this command, continuous processing such as a second command, etc.). If it is determined that a series of processing is necessary, the calling and called terminals are processed with the highest priority when setting up queues.

Embodiment FIG. 1 is a conceptual diagram showing the configuration of a constellation system to which an embodiment of the present invention is applied. This star system includes a center 50 and a plurality of terminals (hereinafter referred to as i10) 51, 52 . ...5
6. In such a star system each 11
051.52...

56 to the center 50 as appropriate. The center 50 orders the processing of commands as shown in FIG.

For example, when a command is input from 11051 to the center 50, it is determined whether or not this command requires a series of processing.

In this case, the destination of this command is 11054,
Assume that it requires a series of processing.

Then, at this stage, it is determined that a series of processing is required. As a result, this command is queued
1, and even if there is a prior commitment in the queue of 11054, this command is given priority to the first queue for 11054. Note that since a series of processing is performed, this command is also given top priority in the queue for the sender 11051. Therefore, when a response is received from the 11054 due to a command corresponding to queue 1, this response is input as a received command (RXQ) and is placed in queue 2 following the destination queue 1, and is sent to the source 1105.
Connected to the first queue of 1.

Similarly, in the present embodiment shown in FIG. 2, a command is sent from 11051 to the center 50 and placed in queue 3. Since the destination is 11054, which is given top priority by the previous command, it is connected to the head of the queue for 11054 (following the previous queue 1).

After this, if a command that does not require a series of processing is input, the queue 4,
5. ...10 and are connected to the I/O queue of each destination.

The above processing procedure will be further explained with reference to the flowchart in FIG.

First, it is determined whether or not there is a received command in response to a command input (step (hereinafter referred to as 5T) 1).

If it is determined that there is a received command, which i
It is determined whether the queue (TXQ) corresponds to /o (S
T72). Then, it is determined which position in the queue to connect to (ST73), and the queue is rearranged so that the input command is connected to a predetermined position (ST74).
). Next, it is determined whether there is a queue indicating a command to be transmitted at this stage (ST75). here,
If the determination is "yes (Y)", the first queue is transmitted (ST76). Then, it is determined whether the command requires a series of processing (ST7
7). If it is determined as “Y”, the source and destination i/
The priority of i/o is increased, and as a result, a queue is set so that commands for these i/o are processed with the highest priority (ST78). After this, the operation is fed back to 5T71.

If the determination at 5T71 is "No (N) I7", the operation proceeds to 5T75. If the determination is "N" at 5T75, the operation returns to 5T71.

If it is determined "N" in 5T77, the operation in 5T78 is not performed (returns to the operation in ST71).

In this way, when a command occurs that requires a series of processing, this command can be passed to any other i/.

This command is given priority over other commands, and then other commands are processed.

Effects of the Invention As is clear from the above description, the present invention has the following advantages: When a command is input, it is determined whether or not this command requires a series of processing, and when it is determined that a series of processing is required, this invention is executed. This command is processed with the highest priority as a queue for each command source and destination, and the accumulation of unprocessed commands is minimized.

[Brief explanation of drawings]

FIG. 1 is a conceptual diagram showing the configuration of a constellation system to which a center queue management method in a constellation system according to an embodiment of the present invention is applied, and FIG. 2 is a conceptual diagram showing an example of the operation of a center in the constellation system. Figure 3 is a flowchart showing an example of the operation of the center, Figure 4 is a conceptual diagram showing the configuration of a star system to which an example of a center queue management method in a conventional star system is applied, and Figure 5 is a flowchart showing an example of the operation of the center. FIG. 6 is a conceptual diagram showing an example of the operation of the center in the same star system, and FIG. 6 is a flowchart showing an example of the operation of the center. 50...Center, 51.52,53,54゜55.56...1100 Name of agent Patent attorney Toshi Nakao Male Haka1 person M
l Figure 2-6 Figure 3 Figure 4 Nol Figure 5 Collar Figure 6

Claims (1)

[Claims] It is determined whether the command sent from the calling terminal to the called terminal requires a series of processing, and when it is determined that a series of processing is required, the calling and called terminals A center queue management method in a star system, characterized in that queues are set with top priority for terminals.