JPS6247760A - Basic type cluster terminal transmission schedule system - Google Patents

Abstract

PURPOSE:To shorten the waiting time, and the reduce the load of a computer by classifying subordinate devices of a cluster terminal into devices whose processing is quick and devices whose processing is slow, and executing preferentially a transmission of the device whose processing is quick. CONSTITUTION:First of all, by a classifying means, among subordinate devices 14-1-14-8 of each cluster terminal 13-1-13-3, the device whose processing is quick and the device whose processing speed is slow are classified as a priority device and a non-priority device, respectively. When queuing of a transmitting telegraphic message has been generated, the priority device is scheduled first, and other non-priority device is made to have a transmission schedule at the time point when the transmission of the priority device has been completed. In this case, when one non-priority device has been ended, whether a transmission waiting telegraphic message has been generated in the priority device or not id discriminated, and if a transmitting telegraphic message exists, the transmission schedule is executed, and unless the transmitting telegraphic message exists, the schedule of the non-priority device is executed.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Application in Children's Business) The present invention relates to a transmission scheduling method for cluster terminals under the control of a basic communication procedure.

(Prior art) In the conventional online computing system, the cluster terminal transmission schedule method of the basic communication procedure uniformly considers all devices under the cluster terminal and sends each device sequentially in blocks or message units without discrimination. He had been hired.

(Problems to be Solved by the Invention) In the conventional transmission scheduling method described above, all devices under the cluster are scheduled for transmission uniformly. However, the disadvantage is that you have to wait for faster devices to process the data. Furthermore, if data is sent continuously to a device with a slow processing speed, the device becomes busy and retransmission processing is performed, resulting in an additional load on the computer.

An object of the present invention is to classify devices under a cluster terminal according to their processing speeds into fast processing devices and slow processing devices as non-priority devices.
When waiting for a transmission message occurs, the priority device is scheduled first, and other non-priority devices have a transmission schedule when the priority device completes transmission, but even if one non-priority device finishes, the next Without moving to the schedule of the non-priority device, it is determined whether or not there is a message waiting to be sent in the priority device, and if there is a message to be sent, it is entered into the transmission schedule, and if there is no message to be sent, the schedule for the next non-priority device is started. It is an object of the present invention to provide a basic cluster terminal transmission schedule system that eliminates the above-mentioned drawbacks by performing the following steps, shortens waiting time, and does not impose an extra load on a computer despite continuous transmission.

(Means for Solving the Problems) The basic cluster terminal transmission scheduling system according to the present invention is configured to include a classification means, a scheduling means, and a discriminating means.

The classification means is configured to:
This is for classifying multiple devices under a cluster terminal according to their processing speeds, with devices with faster processing speeds as priority devices and devices with slower processing speeds as non-priority devices.

The scheduling means is configured to schedule the priority device first when a waiting transmission message occurs, and to schedule the transmission of other non-priority devices when the transmission of the priority device is completed.

The determination means determines whether or not there is a message waiting to be transmitted in the priority device, in order to proceed to the schedule of the next non-priority device even if one of the non-priority devices is completed, and if there is a message to be transmitted, the transmission schedule is started. This is to schedule the next non-priority device if there is no transmission message.

(Example) Next, the present invention will be explained with reference to the drawings.

FIG. 1 is a block diagram showing an embodiment of a hardware configuration for realizing a basic type cluster terminal transmission schedule method according to the present invention. In Figure 1, 11 is C
The PU and 12 are lines, 15-1 to 13-3 are cluster terminals, and 14-1 to 14-8 are devices. Device 14 among devices 14-1 to 14-8
-1゜14-4.14-6 are respectively priority devices, devices 14-2, 14-8, 14-5, 14-7
.

14-8 are non-priority devices.

In Figure 1, CPUI 1 has times? fM 12 is connected, and cluster terminals 15-1 to 15-8 are connected to line 12. Devices 14-1 to 14-8 are connected under the cluster terminals 15-1 to 13-3.

The present invention is a scheduling method for efficiently transmitting data to these devices.

Figure 2 shows cluster seabeds 13-1 to 13 shown in Figure 1.
FIG. 3 is an explanatory diagram showing a series of controls necessary for configuration 3.

In FIG. 2, 21 is a line control table, 22-1 to 22-
8 are cluster terminal control tables, 23-1 to 23-8, respectively.
14 are device control tables.

In FIG. 2, cluster terminal control tables 22-1 to 22-3 are linked under the line control table 21, and device control tables 2 and 2 are linked under each cluster terminal control table 22-1 to 22-3.
3-1 to 23-8 are linked. Therefore, from the line control table 21 to the cluster terminal control tables 22-1 to 22-
3, the device control tables 23-1 to 23-8 are obtained.

FIG. 3 is an explanatory diagram showing information included in the line control table 21 and device control tables 23-1 to 23-8 necessary for carrying out the present invention. The line control table 21 shows the number NPV of priority devices under the line.

Number of non-priority devices NNV, priority device current control table address APV1 non-priority device current control table address ANV1-Priority device transmission counter NPS for counting how many priority devices have transmitted during the transmission schedule of the cycle.

A priority device schedule counter NPc1 is used to count how many priority devices are scheduled during one transmission schedule in order to determine the end of the f destination device's schedule, and how many priority devices are scheduled during one transmission schedule. There is a non-transmission non-priority device counter NNS for counting whether a non-priority device has not transmitted.

The device control table 21 indicates whether to perform continuous block transmission or not.
Alternatively, the threshold identifier MB indicating whether to perform continuous message transmission, the threshold number MBC, the number of blocks waiting to be sent on the device, the number of blocks waiting to be sent, S B The number of messages waiting to be sent on the OX device, waiting to be sent. Message number SMc.

There is also a data address DAP indicating the address of the first data buffer waiting for transmission.

Next, the operation of the present invention will be explained.

FIG. 4 is a flowchart showing the flow of operations in the above embodiment. When the transmission schedule starts in FIG. 4, first step F determines whether there is a priority device.
1 to determine whether there is a priority device. If the priority device does not exist, the process branches to connector No. 2, and schedules the non-priority device according to the current reference step FIO of the non-priority device. If the priority device is recognized in the priority device presence/absence determination step F1, the 'a' destination f device is referred to in the priority device current reference step F2, and the presence or absence of transmission waiting data is determined in the presence/absence of transmission waiting data determination step F8. do. If there is data, it is transmitted in accordance with the threshold value in a threshold value transmission step F4. At this time,
In order to memorize the transmission, the priority device transmission counter is counted up at step F5. Also,
In order to find the timing to shift to a schedule for a non-priority device, after updating the current status in a priority device current update step F6, scheduled priority devices are counted in a priority device schedule counter step F7. Processing of all priority devices is now easier υ
Whether or not the processing has ended is determined in the next priority device schedule counter determination step F8, and if the processing for all priority devices has been completed, the next non-priority device schedule begins. If there is an unprocessed priority device, the same process as branching to connector number 1 is executed. If there is no data waiting to be sent in step F8 for determining the presence or absence of data waiting to be sent, then in step F6 for updating the priority device current, is there any current device? Update.

Regarding the schedule of non-priority devices, it is determined in priority device transmission counter determination step F8 whether or not all priority devices have not yet transmitted. If all have not been transmitted, the presence or absence of a non-priority device is further determined in a non-priority device presence/absence determination step Fil. If there are no non-priority devices, the transmission schedule ends. If there is a transmitting device in the priority device transmission counter determination step F9, or if there is a non-priority device in the non-priority device presence/absence determination step Fil, the non-priority device current reference step FI
The non-priority device is referred to in O, and the presence or absence of data waiting to be sent is determined in step F12 for determining the presence or absence of data waiting to be sent.

If there is data, threshold value transmission step F17 according to the threshold value.
Send with .

At this time, the untransmitted non-priority device counter is cleared in the untransmitted non-priority device counter clear step F18,
The process branches to non-priority device current update step F14. If there is no data waiting to be sent in step F12 for determining the presence or absence of data waiting to be sent, the unsent non-priority device counter is counted up in step F13, and the current device of the non-priority device is updated in step F14. If all the non-priority devices have not transmitted in the untransmitted counter determination step F], 5, and all the priority devices have not transmitted in the prioritized device transmission counter determination step F19, branch to connector No. 8. The 16th schedule ends.

If there is a non-priority device that has transmitted in the non-transmission counter determination step F15, or if there is a priority device that has transmitted in the priority device transmission counter determination step F19, priority is given in the priority device transmission counter clear step F16. Clear the device transmission counter and branch to connector number 1.

As described above, the presence or absence of a priority device is determined, and if there is a priority device, the transmission schedule schedules all priority devices and then executes processing for only one non-priority device. After processing, update the current processing device of the non-priority device and re-enter the schedule of the priority device. This operation is repeated, and the schedule ends when all priority devices and all non-priority devices have no messages waiting to be sent.

Next, assume that in the hardware configuration of FIG. 1, there is data waiting to be transmitted as shown in FIG.

In FIG. 5, the same elements as in FIG. 2 are given the same numbers as 0M11・M 12・M, l・M, 2・
0゛・M81 + M8! each indicates a message waiting to be output.

FIG. 6 shows the order in which these messages are output.

■ to O indicate the time order of message output.

The devices 14-1 to 14-8 described in FIG. 1 correspond to the device control tables 23-1 to 23-8, respectively. Device control table 23-1 shows output waiting message M1□1.
M and 2 correspond, and the output waiting message M21 +MH corresponds to the device control table 23-2. Thereafter, similarly, the device control table 23-8 shows output waiting messages M,
,.

M8. corresponds.

(Effects of the Invention) As explained above, the present invention classifies devices under a cluster terminal according to their processing speeds, with fast processing devices being classified as priority devices and slow processing devices being classified as non-priority devices. When a queue occurs, the priority device is scheduled first, and other non-priority devices have a transmission schedule when the priority device completes transmission, but even if one non-priority device finishes, the next non-priority device Instead of moving to the schedule, it is determined whether there is a message waiting to be transmitted in the priority device, and if there is a message to be transmitted, it is placed in the transmission schedule, and if there is no message to be transmitted, the next non-priority device is scheduled. Yoshi,
This has the effect of making it possible to use cluster terminals efficiently and improving computer processing efficiency.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of hardware for realizing the basic cluster terminal transmission scheduling method according to the present invention. FIG. 2 is an explanatory diagram showing control corresponding to the hardware configuration of FIG. 1. FIG. 8 is an explanatory diagram showing all information used in the control of FIG. 2. FIG. 4 is a flowchart explaining the operation in the embodiment of the present invention. FIG. 5 is an explanatory diagram showing messages waiting for output corresponding to the hardware of FIG. 1. FIG. 6 is an explanatory diagram showing the chronological order of messages waiting to be output that are sent as a result of processing. 11 ・ ・ ・ CPU 12@-Line 13-1 to 13-8...Cluster terminal 14-1 to 14
-8・Φ・Device 21.22-1~22-8.23-1~23-8...
...Control table F1 to F19---Processing step Mis + Mit (i=:l~8)...Output waiting message

Claims (1)

[Claims] In sending data to a cluster terminal under basic communication procedure control of an online computer system, multiple devices under the cluster terminal are classified according to their processing speeds, with devices with faster processing speeds being classified as priority devices and devices with slower processing speeds being classified as non-priority devices. and a classification means for scheduling the priority device first when waiting for a transmission message occurs, and scheduling the transmission of other non-priority devices when the transmission of the priority device is completed. and a scheduling means for determining whether or not a message waiting to be transmitted is generated in the priority device without moving to the schedule of the next non-priority device even if one of the non-priority devices ends, 1. A basic cluster terminal transmission schedule system, characterized in that the basic cluster terminal transmission schedule system is characterized in that it is configured to include a determining means for entering the transmission schedule if the transmission message does not exist, and for scheduling the next non-priority device if the transmission message does not exist.