KR101963491B1 - Scheduling method and system for converting multiple asynchronous data into serial communication - Google Patents

Abstract

The present invention relates to a scheduling method for converting multiple asynchronous data into serial communication, which combines a round robin and a priority algorithm in order to solve the real-time property and biasedness in collecting modules having different communication protocols from one module, System, a scheduling method in which a priority algorithm is applied to a transmission time distribution part of two or more asynchronous data in a round robin scheme derives a scheduling result using parameters of a buffer count coefficient and a priority coefficient Comparing the derived scheduling result value with a predetermined parameter value, packetizing the data of the module having the highest value for each module, and processing the packetized data preferentially.
In addition, a scheduling system in which a priority algorithm is applied to a transmission time distribution part of two or more asynchronous data in a round robin scheme includes a transmitter for transmitting two or more asynchronous data, an asynchronous data transmitted from the transmitter, And a receiving unit, wherein the receiving unit includes a buffer, a scheduling process, and a packetizing module.

Description

[0001] SCHEDULING METHOD AND SYSTEM FOR CONVERTING MULTIPLE ASYNCHRONOUS DATA INTO SERIAL COMMUNICATION [0002]

The present invention relates to a scheduling method and system for converting multiple asynchronous data into serial communication, and more particularly, to a scheduling method and system for converting multiple asynchronous data into serial communication, And a scheduling method and system for converting multiple asynchronous data into a serial communication.

The conventional priority algorithm is a kind of algorithm used for CPU scheduling of a computer, and priority is given to each process to process in order of priority (see FIG. 1).

In addition, Round Robin algorithm, that is, round robin scheduling, is one of preemptive scheduling designed for time-sharing systems. It employs a method of allocating processes in a time unit (time quantum) to be. FCFS (First Come, First service) method, each process is assigned a time slice of the same size. If the process does not complete the task for the allotted time, the process proceeds to the next process and the running process is sent to the back of the ready list (see FIG. 2).

However, in the conventional simple priority algorithm, there is a risk that only the data of high priority and the data of the high transmission rate is continuously transmitted, and the data of low priority is not processed. In the simple round robin algorithm, have.

It is an object of the present invention to solve the above problems and provide a scheduling method in which a priority algorithm is applied to a transmission time distribution portion of a round robin scheme for efficiently and fairly processing two or more asynchronous data.

The scheduling method for converting multiple asynchronous data into serial communication according to the present invention includes deriving a scheduling result using parameters of a buffer count coefficient and a priority coefficient, comparing the derived scheduling result value and a predetermined parameter value And packetizing data of the module having the highest value for each module, and preferentially processing the packetized data.

In addition, the priority order can be calculated by the formula of Priority (X) = (? * Buffer Count) + (? * RealTime). Here, the buffer count coefficient alpha = 0.6 and the priority coefficient beta = 0.4.

Meanwhile, a scheduling system in which two or more asynchronous data according to the present invention are applied to a transmission time distributing part of a round robin scheme includes a transmitting part for transmitting two or more asynchronous data, a transmitting part for transmitting asynchronous data transmitted from the transmitting part, Converting the data into data and receiving the data, and the receiving unit may include a buffer, a scheduling process, and a packetizing module.

In addition, the receiving unit has one buffer for each module communicating data of the transmitting unit, and can schedule the data received by the module through the serial interface.

In the scheduling method using the priority algorithm according to the present invention, when each data is packetized in a situation in which data is received in two or more asynchronous states, the scheduling method is not biased according to the importance of the data and the buffer count situation, There is an advantage that scheduling can be done.

1 is a block diagram showing a conventional priority algorithm,
2 is a block diagram illustrating a conventional round robin algorithm,
3 is a configuration diagram of an operation system according to an embodiment of the present invention.
4 is a conceptual diagram illustrating a scheduling process according to an embodiment of the present invention.

Hereinafter, a scheduling method for converting multiple asynchronous data into serial communication according to an embodiment of the present invention will be described in detail with reference to the accompanying drawings.

The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.

It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, .

In addition, suffixes "module" and " part "for the components used in the following description are given merely for convenience of description, and do not give special significance or role in themselves. Accordingly, the terms "module" and "part" may be used interchangeably.

3 is a configuration diagram of an operation system according to an embodiment of the present invention.

Referring to FIG. 3, the operation system of the present invention may include a transmitter and a receiver.

The transmitting unit is composed of modules having two or more asynchronous data for transmitting data to the receiving unit.

The receiving unit may include a buffer, a scheduling process, and a packetizing module. That is, the receiving unit may have a structure in which the receiving unit has one buffer for each module that performs data communication with the transmitting unit, and schedules the data received from each module with a serial interface.

Each module 3 of the transmitter 1 performs asynchronous data communication with the receiver 2, which is the main system, and the data of each module are different from each other in real time. The receiving unit 2 receives asynchronous data from two or more modules and reconstructs the data collected by the module to fit the packet 6 for one communication. In this process, a process of scheduling received data must be applied in order to reconstruct two or more asynchronous data into one packet (6) and perform serial communication.

 As a suitable scheduling method to process each module 's data fairly, priority algorithm was applied to the transmission time distribution part of Round Robin method. If both of the existing priority algorithm and the Round Robin algorithm are combined and applied at the same time, efficient scheduling in non-synchronous situations is possible.

4 is a conceptual diagram illustrating a scheduling process according to an embodiment of the present invention.

Referring to FIG. 4, the scheduling algorithm of the present invention derives a scheduling result 14 through a buffer count coefficient 10, a priority coefficient 11, and an equation 15 using two parameters.

 The importance (12) of the data received by each module is determined, and data 13 is accumulated for each buffer connected to each module upon receiving the asynchronous data. At this time, the data of the module having the highest value is calculated and compiled for each module through the predetermined equation (15) using the parameters (10, 11) already set and placed in the packet (6). If the buffer data 13 is accumulated in a small amount, the data of the module having the relatively high priority 12 is accumulated in the buffer data 13. If the buffer data 13 is piled up, the data of the corresponding module will be processed first and packetized 14. As a result, the optimum priority is determined by the importance 12 of the data of the module and the amount of buffer data 13, and the data of each module can be processed fairly.

The priority can be calculated by the following equation and can be expressed by the following equation (1).

[Mathematical Expression]

Priority (X) = (? * Buffer Count) + (? * RealTime)

Here, the buffer count coefficient? = 0.6 and the importance coefficient? = 0.4 are set.

Therefore, the data having a large number of buffer data is processed first, and the data having the next greatest priority (RealTime) is processed with the next priority (see FIG. 4).

Therefore, according to the present invention, when packetizing each data in a situation where data is received in two or more asynchronous states, scheduling can be performed to ensure real-time performance without being biased according to importance of data and buffer count situation.

The foregoing description describes embodiments of the present invention in terms of the processing steps required to implement embodiments of the present invention. These steps may be performed by a suitably programmed computer, the configuration of which is well known in the art. Suitable computers may be implemented using, for example, well-known computer processors, memory units, storage devices, computer software, and other components.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is clearly understood that the same is by way of illustration and example only and is not to be construed as limiting the scope of the invention as defined by the appended claims. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention.

1: Transmitter (asynchronous data) 2: Receiver (synchronous data)
3: Transmitter module 4: Buffer
5: scheduling process 6: packet module
10: buffer count coefficient 11: importance coefficient
13: buffer data 14: packetization
15: Priority formula

Claims (6)

A transmission unit for transmitting at least two asynchronous data; and a reception unit for receiving the asynchronous data transmitted from the transmission unit and converting the asynchronous data into synchronous data, wherein the at least two asynchronous data are divided into a round- A scheduling method for converting multiple asynchronous data to a serial communication using a priority algorithm,
Wherein the receiving unit derives a scheduling result using parameters of a buffer count coefficient and a priority coefficient;
Comparing the derived scheduling result value with a predetermined parameter value to packetize module data having the highest value for each module; And
And preferentially processing the packetized data,
The priority order may be,
Priority (X) = (? * Buffer Count) + (? * RealTime)
, Wherein? Is a buffer count coefficient, and? Is an importance coefficient. The method of claim 1, wherein the? delete The method according to claim 1,
Wherein the buffer count coefficient alpha is set to 0.6. ≪ RTI ID = 0.0 > 8. < / RTI > The method according to claim 1,
Wherein the importance coefficient (beta) is set to 0.4. ≪ RTI ID = 0.0 > 11. < / RTI > delete delete

Images