Scheduling method, system, device and medium based on nr grant

Abstract

The present disclosure provides a scheduling method, system, device and medium based on NR-GRANT, the scheduling method based on NR-GRANT comprising: obtaining the logical channel priority of the GRANT; when the logical channel priority of at least two GRANTS is the same, calculating the priority score of each GRANT; when the transmission opportunity comes, scheduling the GRANT according to the priority score, wherein each transmission opportunity only schedules one GRANT. The present disclosure introduces the calculation of the priority score when the priority of the logical channel of two GRANTS is the same, and then selects the more suitable GRANT for transmission, preventing some GRANTS with equal priority from being long-term unscheduled, and optimizing the scheduling strategy of the GRANT.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to a method for scheduling a grant, in particular to a method, system, device and medium for scheduling a grant based on NR. BACKGROUND

[0002] Mobile communication has now entered the deployment stage of 5G New Radio (NR). The Third Generation Partnership Project (3GPP) has comprehensively enhanced the capabilities of the 5G core network. Among them, the 3GPP R16 protocol version introduces a priority scheduling strategy based on logical channels. For logical channels of different priorities, when air interface resource overlap / collision occurs, each priority will be selected, and the lower priority GRANT will be downgraded and will not be given priority in subsequent attempts to send. rd Generation Partership Project,3GPP) has comprehensively enhanced the capabilities of the 5G core network. Among them, the 3GPP R16 protocol version introduces a priority scheduling strategy based on logical channels. For logical channels of different priorities, when air interface resource overlap / collision occurs, each priority will be selected, and the lower priority GRANT will be downgraded and will not be given priority in subsequent attempts to send.

[0003] The above-mentioned protocol does not specify how to handle GRANTs of the same priority, resulting in the inability to accurately determine which GRANT to schedule first when GRANTs of the same priority need to be scheduled, resulting in some GRANTs of the same priority being unable to be scheduled for a long time. SUMMARY

[0004] The technical problem to be solved by the present disclosure is to overcome the defect that some GRANTs of the same priority cannot be scheduled for a long time in the prior art, and to provide a method, system, device and medium for scheduling a grant based on NR.

[0005] The present disclosure solves the above technical problems by the following technical solutions:

[0006] In a first aspect, the present disclosure provides a method for scheduling a grant based on NR, the scheduling method comprising:

[0007] obtaining the logical channel priority of the GRANT;

[0008] When the logical channel priorities of at least two GRANTs are the same, calculating the priority score of each GRANT;

[0009] When the transmission opportunity comes, scheduling the GRANT according to the priority score, wherein each transmission opportunity only schedules one GRANT.

[0010] Preferably, the transmission opportunity of the GRANT is obtained based on pre-configuration or real-time scheduling.

[0011] Preferably, the priority score is calculated based on at least one of the normalized buffer data proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT, and the number of consecutive non-scheduling times of the GRANT.

[0012] Preferably, the priority score is determined by the following formula:

[0013] P 优先级分值 = a*PendingLength + b*HistorySchedRate + c*NoSchedSpan;

[0014] wherein PendingLength is the normalized buffer data proportion of the logical channel where the GRANT is located, HistorySchedRate is the historical scheduling rate of the GRANT, and NoSchedSpan is the number of consecutive non-scheduling times of the GRANT.

[0015] a represents the buffer data proportion coefficient, b represents the historical scheduling rate proportion coefficient, and c represents the number of consecutive non-scheduling times proportion coefficient; the sum of a, b, and c is 1.

[0016] Preferably, in the above parameters, c > a > b.

[0017] Preferably, the step of calculating the priority score of each GRANT further comprises:

[0018] initializing the historical scheduling rate and the number of consecutive non-scheduling times of the GRANT;

[0019] obtaining the current buffer data amount of the logical channel where the GRANT is located.

[0020] Preferably, the scheduling method comprises:

[0021] when the transmission opportunity comes again, updating the historical scheduling rate, the number of consecutive non-scheduling times of the GRANT, and the current buffer data amount of the logical channel where the GRANT is located according to the scheduling result of the historical transmission opportunity;

[0022] updating the priority score of each GRANT;

[0023] scheduling the GRANT according to the priority score.

[0024] Preferably, the scheduling method further comprises:

[0025] when the priority scores of the at least two GRANTS are the same, scheduling the GRANTS according to the preset number of the GRANT;

[0026] wherein the GRANT with a higher number is preferentially scheduled.

[0027] Preferably, the scheduling the GRANT according to the priority score further comprises:

[0028] packetizing and sending data volume of the GRANT to be scheduled.

[0029] In a second aspect, the present disclosure provides a scheduling system of NR-based GRANT, comprising:

[0030] an acquisition module, configured to acquire logical channel priority of the GRANT;

[0031] a calculation module, configured to calculate priority score of each of the GRANT when logical channel priorities of at least two of the GRANT are the same;

[0032] a scheduling module, configured to schedule the GRANT according to the priority score when a transmission occasion comes, wherein only one of the GRANT is scheduled in each transmission occasion.

[0033] In a third aspect, the present disclosure provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned scheduling method of NR-based GRANT when executing the computer program.

[0034] In a fourth aspect, the present disclosure provides a chip applied to an electronic device, wherein the chip is configured to execute the above-mentioned scheduling method of NR-based GRANT.

[0035] In a fifth aspect, the present disclosure provides a chip module applied to an electronic device, comprising a transceiver component and a chip, wherein the chip is configured to execute the above-mentioned scheduling method of NR-based GRANT.

[0036] In a sixth aspect, the present disclosure provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program is configured to implement the above-mentioned scheduling method of NR-based GRANT when executed by a processor.

[0037] The present disclosure has the following positive progress effects: the present disclosure introduces calculation of priority score when priorities of logical channels of two of the GRANT are the same, and then selects a more suitable GRANT for scheduling and sending, thereby preventing some of the GRANTs with equal priority from being unable to be scheduled for a long time, and optimizing the scheduling strategy of the GRANT. BRIEF DESCRIPTION OF DRAWINGS

[0038] Figure 1 a flowchart of a scheduling method of NR-based GRANT provided by Embodiment 1 of the present disclosure;

[0039] Figure 2 A priority decision schematic diagram provided for Embodiment 1 of the present disclosure;

[0040] Figure 3 A schematic diagram of a first transmission occasion provided for Embodiment 1 of the present disclosure;

[0041] Figure 4 A partial flowchart of S102 step in a scheduling method based on NR-GRANT provided for Embodiment 1 of the present disclosure;

[0042] Figure 5 A flowchart of another scheduling method based on NR-GRANT provided for Embodiment 1 of the present disclosure;

[0043] Figure 6 A schematic diagram of a second transmission occasion provided for Embodiment 1 of the present disclosure;

[0044] Figure 7 A schematic diagram of a third transmission occasion provided for Embodiment 1 of the present disclosure;

[0045] Figure 8 A module schematic diagram of a scheduling system based on NR-GRANT provided for Embodiment 2 of the present disclosure;

[0046] Figure 9 A structural diagram of an electronic device provided for Embodiment 3 of the present disclosure. DETAILED DESCRIPTION

[0047] The present disclosure will be further illustrated by way of examples below, but the present disclosure is not limited in the scope of the examples.

[0048] Embodiment 1

[0049] The present disclosure provides a scheduling method based on NR-GRANT, referring to Figure 1 , the scheduling method comprises:

[0050] S101, acquiring the logical channel priority (Priority) of GRANT.

[0051] Wherein, referring to Figure 2 , the types of GRANT include CG GRANT, Dynamic GRANT, SR, and those skilled in the art should understand that the types of GRANT are not limited to the above three. The logical channel priority of the acquired GRANT, for example, the logical channel priority of CG GRANT k1~CG GRANT k N is A, the logical channel priority of Dynamic GRANT m1 is B, and the logical channel priority of SR is C. CG GRANT k N+1The logical channel priority of the CG GRANT k1 is A, the logical channel priority of the CG GRANT k2 is B, the logical channel priority of the CG GRANT k3 is C, and the logical channel priority of the CG GRANT k4 is D. Priority A > Priority B > Priority C > Priority D, and those skilled in the art should understand that the priority basis is set according to the actual situation.

[0052] S102, when the logical channel priorities of at least two GRANTS are the same, the priority score of each GRANT is calculated.

[0053] Wherein, referring to Figure 2 and Figure 3 When the logical channel priorities of the CG GRANT k1 to the CG GRANT k N are all A, the priority scores of the CG GRANT k1 to the CG GRANT k N respectively need to be calculated. For example, at the first transmission opportunity, the priority score of the CG GRANT k1 is 0.045, the priority score of the CG GRANT k2 is 0.036, and the priority score of the CG GRANT k3 is all 0.027.

[0054] S103, when the transmission opportunity comes, the GRANT is scheduled according to the priority score, wherein only one GRANT is scheduled at each transmission opportunity.

[0055] Wherein, when the transmission opportunity comes, according to the priority scores of the CG GRANT k1 to the CG GRANT k N , it is decided which CG GRANT in the CG GRANT k1 to the CG GRANT k N is scheduled. For example, at the first transmission opportunity, the CG GRANT k1 with a priority score of 0.045 is sent.

[0056] In this embodiment, by introducing the calculation of the priority score when the logical channel priorities of two GRANTS are the same, the more suitable GRANT for scheduling is selected for transmission, preventing some GRANTS with equal priority from being long-term unscheduled, and optimizing the scheduling strategy of the GRANT.

[0057] In an optional embodiment, the transmission opportunity of the GRANT is obtained based on pre-configuration or real-time scheduling.

[0058] Wherein, the transmission opportunity of the GRANT can be configured by the base station to the user through timing scheduling, or through real-time dynamic scheduling.

[0059] In an optional embodiment, the priority score is calculated based on at least one of the normalized buffer data volume proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT authorization, and the number of consecutive unscheduled times of the GRANT. In an optional embodiment, the priority score is calculated based on at least one of the normalized buffer data volume proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT authorization, and the number of consecutive unscheduled times of the GRANT.

[0060] wherein, at each transmission occasion, the priority score is calculated based on at least one of the normalized buffer data amount proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT, and the number of consecutive non-scheduling times of the GRANT according to the priority score. Those skilled in the art should understand that the result obtained by calculating the priority score through the above three is more accurate.

[0061] In an optional embodiment, the priority score is determined by the following formula:

[0062] P 优先级分值 = a * PendingLength + b * HistorySchedRate + c

[0063] NoSchedSpan;

[0064] wherein, PendingLength is the normalized buffer data amount proportion of the logical channel where the GRANT is located, HistorySchedRate is the historical scheduling rate of the GRANT, and NoSchedSpan is the number of consecutive non-scheduling times of the GRANT.

[0065] a represents the buffer data proportion coefficient, b represents the historical scheduling rate proportion coefficient, and c represents the number of consecutive non-scheduling times proportion coefficient; the sum of a, b, and c is 1.

[0066] wherein, the priority score is calculated by introducing a, b, and c proportion coefficients. For example, referring to Figure 1 a = 0.3, b = 0.2, and c = 0.5, and the sum of a, b, and c is 1.

[0067] In an optional embodiment, c > a > b.

[0068] wherein, the sum of a, b, and c is 1, and the proportion coefficients can be adjusted according to the actual transmission situation. Generally, the proportion coefficient of the number of consecutive non-scheduling times has the highest proportion, the proportion coefficient of the buffer data has the second highest proportion, and the proportion coefficient of the historical scheduling rate has the lowest proportion, so as to avoid the situation that the GRANT which has not been scheduled for a long time is starved.

[0069] In this embodiment, when the priorities of the logical channels of two GRANTS are the same, the priority score is calculated by introducing the normalized buffer data amount proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT, and the number of consecutive non-scheduling times of the GRANT, and the buffer data proportion coefficient, the historical scheduling rate proportion coefficient, and the number of consecutive non-scheduling times proportion coefficient, so as to select the GRANT which is more suitable for scheduling to be sent, prevent some GRANTS with the same priority from being scheduled for a long time, and optimize the scheduling strategy of the GRANT.

[0070] In an optional embodiment, referring to Figure 4 , the step of calculating the priority score of each GRANT in step S102 further comprises:

[0071] S1021, initializing the historical scheduling rate and the continuous unscheduled times of the GRANT.

[0072] In calculating the priority score of each GRANT, the historical scheduling rate and the continuous unscheduled times of the GRANT need to be initialized first. Referring to Figure 3 , the historical scheduling rate and the continuous unscheduled times of CG GRANT k1~CG GRANT k N are all initialized to 0 at the first transmission opportunity.

[0073] S1022, obtaining the current buffered data amount of the logical channel where the GRANT is located.

[0074] The current buffered data amount of the logical channel where the GRANT is located needs to be obtained first, which is the basis for calculating the normalized buffered data amount proportion of the logical channel where the GRANT is located in the priority score. Referring to Figure 3 , the current storage data amount of CG GRANT k1 is 500 Bytes, the current storage data amount of CG GRANT k2 is 400 Bytes, and the current storage data amount of CG GRANT k3 is all 300 Bytes at the first transmission opportunity.

[0075] In this embodiment, when the priorities of the logical channels of two GRANTS are the same, the calculation of the priority score is introduced, and the normalized buffered data amount of the logical channel where the GRANT is located is calculated by initializing the historical scheduling rate and the continuous unscheduled times of the GRANT and obtaining the current buffered data amount of the logical channel where the GRANT is located, so as to select the GRANT more suitable for scheduling for transmission, prevent some GRANTS with the same priority from being long-term unscheduled, and optimize the scheduling strategy of the GRANT.

[0076] In an optional embodiment, referring to Figure 5 , the scheduling method comprises:

[0077] S201, when the transmission opportunity comes again, updating the historical scheduling rate, the continuous unscheduled times of the GRANT, and the current buffered data amount of the logical channel where the GRANT is located according to the scheduling result of the historical transmission opportunity.

[0078] When the next transmission occasion comes again, the historical scheduling rate, the number of consecutive non-scheduling times and the current buffer data amount of the logical channel where the GRANT is located of each GRANT are updated according to the result of the previous transmission occasion. For example, see Figure 3 and Figure 6 The CG GRANT k1 has been scheduled at the first transmission occasion, and the size of the scheduling grant of the CG GRANT k1 is 300 Bytes. When the second transmission occasion comes, the current buffer data amount of the CG GRANT k1 is updated to 200 Bytes, the historical scheduling rate is updated to 1, and the number of consecutive non-scheduling times is updated to 0. The CG GRANT k2 to the CG GRANT k N synchronous adjustment.

[0079] S202, updating the priority score of each GRANT.

[0080] When the historical scheduling rate, the number of consecutive non-scheduling times and the current buffer data amount of the logical channel where the GRANT is located are updated, the priority score of each GRANT is recalculated. For example, see Figure 6 At the second transmission occasion, the priority score of the CG GRANT k1 is updated to 0.22, the priority score of the CG GRANT k2 is updated to 0.54, and the priority scores of the CG GRANT k3 to the CG GRANT k N are all updated to 0.53.

[0081] S203, scheduling the GRANT according to the priority score.

[0082] At the second transmission occasion, the CG GRANT k2 with the priority score of 0.54 is sent.

[0083] In this embodiment, the priority score is updated when the next transmission occasion comes again, and then the GRANT that is more suitable for scheduling is selected for sending, so that the GRANT with the same priority is prevented from being long-term unscheduled, and the scheduling strategy of the GRANT is optimized.

[0084] In an optional embodiment, the scheduling method further comprises:

[0085] When the priority scores of the at least two GRANTS are the same, the GRANT is scheduled according to the preset number of the GRANT. The GRANT with the earlier number is preferentially scheduled.

[0086] For example, see Figure 7 When the CG GRANT k3 to the CG GRANT k NThe priority score of the CG GRANT k1 is the same as that of the CG GRANT k3, and the CG GRANT k1 is preferentially scheduled.

[0087] In an optional embodiment, scheduling the GRANT according to the priority score further comprises:

[0088] The data amount of the GRANT to be scheduled is packaged and sent.

[0089] For example, referring to Figure 3 , the scheduling grant size of the CG GRANT k1 is 300 Bytes, that is, the data amount of 300 Bytes is packaged and sent.

[0090] In an actual example, referring to Figure 3 , Figure 6 and Figure 7 :

[0091] (1) Obtain the logical channel priority of the GRANT, the logical channel priority of the CG GRANT k1- CG GRANT k N (N=10) is A, the logical channel priority of the Dynamic GRANT m1 is B, the logical channel priority of the SR is C, and the logical channel priority of the CG GRANT k N+1 is D. The priority A> priority B> priority C> priority D. a=0.3, b=0.2, c=0.5. Because the logical channel priority of the CG GRANT k1- CG GRANT k N is the highest, that is, when the transmission opportunity comes, the CG GRANT in the CG GRANT k1- CG GRANT k N is sent first.

[0092] Initialize the historical scheduling rate and the number of consecutive unscheduled times of the GRANT. At the first transmission opportunity, the historical scheduling rate and the number of consecutive unscheduled times of the CG GRANT k1- CG GRANT k N are all initialized to 0. The current storage data amount of the CG GRANT k1 is 500 Bytes, the current storage data amount of the CG GRANT k2 is 400 Bytes, and the current storage data amount of the CG GRANT k3- CG GRANT k N is 300 Bytes.

[0093] (2) At the first transmission opportunity, calculate the CG GRANT k1- CG GRANT k 优先级分值 based on the formula P Npriority score of the CG GRANT k1.

[0094]

[0095]

[0096]

[0097] Based on the priority score of the CG GRANT k1~CG GRANT k N , the CG GRANT k1 with a priority score of 0.045 is sent at the first transmission occasion, and data with a size of 300 Bytes according to the scheduling grant size of the CG GRANT k1 is packaged and sent.

[0098] (3) At the second transmission occasion, based on the sending situation at the first transmission occasion, the history scheduling rate, the number of consecutive unscheduled times, and the current buffer data size of the logical channel where the GRANT is located of the CG GRANT k1~CG GRANT k N are updated: the current storage data size of the CG GRANT k1 is 200 Bytes, the history scheduling rate is 1, and the number of consecutive unscheduled times is 0; the current storage data size of the CG GRANT k2 is 400 Bytes, the history scheduling rate is 0, and the number of consecutive unscheduled times is 1; the current storage data size of the CG GRANT k3~CG GRANT k N is 300 Bytes, the history scheduling rate is 0, and the number of consecutive unscheduled times is 1. Based on the formula P 优先级分值 = a*PendingLength + b*HistorySchedRate + c*NoSchedSpan, the priority scores of the CG GRANT k1~CG GRANT k N are calculated again.

[0099]

[0100]

[0101]

[0102] Based on the priority score of the CG GRANT k1~CG GRANT k N , the CG GRANT k2 with a priority score of 0.54 is sent at the second transmission occasion, and data with a size of 400 Bytes according to the scheduling grant size of the CG GRANT k2 is packaged and sent.

[0103] (4) At the third transmission opportunity, according to the sending of the first transmission opportunity and the second transmission opportunity, the CG GRANT k1~CG GRANT k N , the historical scheduling rate, the number of consecutive unscheduled times and the current cache data amount of the logical channel where the GRANT is located: the current storage data amount of CG GRANT k1 is 200Bytes, the historical scheduling rate is 0.5, and the number of consecutive unscheduled times is 1; the current storage data amount of CG GRANT k2 is 0Bytes, the historical scheduling rate is 0.5, and the number of consecutive unscheduled times is 1; the current storage data amount of CG GRANT k3~CG GRANT k N is 300Bytes, the historical scheduling rate is 0, and the number of consecutive unscheduled times is 2. Based on the formula P 优先级分值 =a*PendingLength+b*HistorySchedRate+c*NoSchedSpan, the priority score of CG GRANT k1~CG GRANT k N is calculated again.

[0104]

[0105]

[0106]

[0107] Based on the priority score of CG GRANT k1~CG GRANT k N , at the third transmission opportunity, one CG GRANT of CG GRANT k3~CG GRANT k N with a priority score of 1.03 is sent, and since according to the number, the number of CG GRANT k3 is in the front, that is, the data amount of 300Bytes according to the scheduling authorization size of CG GRANT k3 is packaged and sent.

[0108] Embodiment 2

[0109] The embodiment provides a scheduling system based on NR GRANT, referring to Figure 8 , the scheduling system comprises:

[0110] The acquisition module 101 is used for acquiring the logical channel priority of the GRANT.

[0111] Referring to Figure 2The types of the GRANTs include CG GRANT, Dynamic GRANT, SR, and those skilled in the art should understand that the types of the GRANTs are not limited to the above three. The logical channel priority of the acquired GRANT, for example, the logical channel priority of CG GRANT k1~CG GRANT k N is A, the logical channel priority of Dynamic GRANT m1 is B, and the logical channel priority of SR is C. The logical channel priority of CG GRANT k N+1 is D. The priority A > the priority B > the priority C > the priority D, and those skilled in the art should understand that the judgment basis of the priority is set according to the actual situation.

[0112] The calculation module 102 is configured to calculate the priority score of each of the GRANTs when the logical channel priorities of at least two of the GRANTs are the same.

[0113] Wherein, referring to Figure 2 and Figure 3 , when the logical channel priorities of CG GRANT k1~CG GRANT k N are all A, the priority scores of CG GRANT k1~CG GRANT k N respectively need to be calculated. For example, at the first transmission opportunity, the priority score of CG GRANT k1 is 0.045, the priority score of CG GRANT k2 is 0.036, and the priority scores of CG GRANT k3~CG GRANT k N are all 0.027.

[0114] The scheduling module 103 is configured to schedule the GRANTs according to the priority scores when the transmission opportunity comes, wherein only one of the GRANTs is scheduled at each transmission opportunity.

[0115] Wherein, when the transmission opportunity comes, according to the priority scores of CG GRANT k1~CG GRANT k N , it is determined which one of CG GRANT k1~CG GRANT k N is scheduled. For example, at the first transmission opportunity, CG GRANT k1 with the priority score of 0.045 is sent.

[0116] In the embodiment, by introducing the calculation of the priority score when the priorities of the two GRANTS of the logical channel are the same, the more suitable GRANT for scheduling is selected for transmission, and the scheduling strategy of the GRANT is optimized.

[0117] Embodiment 3

[0118] The embodiment provides an electronic device, Figure 9 A schematic diagram of modules of the electronic device is shown. The electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the scheduling method of the NR-based GRANT of the embodiment 1 when executing the program. Figure 9 The electronic device 30 shown is merely an example and should not impose any limitation on the functions and usage range of the embodiments of the present disclosure.

[0119] As shown in Figure 5 The electronic device 30 can be in the form of a general computing device, for example, it can be a server device. The components of the electronic device 30 can include but are not limited to: the above-mentioned at least one processor 31, the above-mentioned at least one memory 32, a bus 33 connecting different system components including the memory 32 and the processor 31.

[0120] The bus 33 includes a data bus, an address bus, and a control bus.

[0121] The memory 32 can include a volatile memory, such as a random access memory (RAM) 321 and / or a cache memory 322, and can further include a read-only memory (ROM) 323.

[0122] The memory 32 can further include a program / utility 325 having a set (at least one) of program modules 324, such as an operating system, one or more application programs, other program modules, and program data, and each of these examples, or some combination thereof, can include implementation of a network environment.

[0123] The processor 31 performs various function applications and data processing by running the computer program stored in the memory 32, such as the scheduling method of the NR-based GRANT of the embodiment 1 of the present disclosure.

[0124] The electronic device 30 can also communicate with one or more external devices 34 (such as a keyboard, a pointing device, etc.) via an input / output (I / O) interface 35. Furthermore, the model generated device 30 can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 36. As shown inFigure 5 As shown, network adapter 36 communicates with other modules of model-generated device 30 over bus 33. It should be appreciated that other hardware and / or software modules can be used in conjunction with model-generated device 30, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (redundant array of independent disks) systems, tape drives, and data backup storage systems, etc. as are known to those of ordinary skill in the art.

[0125] It should be noted that although several units / modules or sub-units / modules of an electronic device are mentioned in the foregoing detailed description, such division is merely exemplary and not mandatory. Indeed, according to embodiments of the present disclosure, features and functions of two or more units / modules described above can be embodied in one unit / module. Conversely, features and functions of one unit / module described above can be further divided into units / modules embodied by multiple units / modules.

[0126] Embodiment 4

[0127] A chip applied to the electronic device of embodiment 3, for performing the scheduling method based on NR-GRANT of embodiment 1.

[0128] Embodiment 5

[0129] A chip module applied to the electronic device of embodiment 3, for performing the scheduling method based on NR-GRANT of embodiment 1.

[0130] Embodiment 6

[0131] The embodiment provides a computer readable storage medium, and a computer program is stored on the computer readable storage medium. The program is executed by a processor to implement the scheduling method based on NR-GRANT of embodiment 1.

[0132] More specifically, the readable storage medium can include, but is not limited to: a portable disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0133] In possible embodiments, the present disclosure can also be implemented in the form of a program product, which includes program codes for causing a terminal device to execute the scheduling method based on NR-GRANT of embodiment 1 when the program product is run on the terminal device.

[0134] programmable logic arrays, field programmable gate arrays, processors, controllers, micro-controllers, microprocessors, other electronic digital turbines, or similar compute logic devices. The program code can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's device, partly on the user's device, as a stand-alone software package, partly on the user's device and partly on a remote device or entirely on the remote device. In the latter scenario, the remote device can be connected to the user's device through any type of network, including a local area network ("LAN"), a wide area network ("WAN"), the Internet, or the like.

[0135] Although the specific embodiments of the present disclosure have been described above, those skilled in the art will understand that the present disclosure is only illustrative, and the scope of protection of the present disclosure is defined by the appended claims. Those skilled in the art can make various changes or modifications to the embodiments without departing from the principles and essence of the present disclosure, and such changes and modifications fall within the scope of protection of the present disclosure.

Claims

1. A method of scheduling based on NR-GRANT, characterized in that, The scheduling method comprises: obtaining the logical channel priority of the GRANT; when the logical channel priorities of at least two of the GRANTs are the same, calculating the priority score of each of the GRANTs; when a transmission opportunity arrives, scheduling the GRANTs according to the priority scores, wherein only one of the GRANTs is scheduled for each transmission opportunity; the priority score is calculated based on at least one of the normalized buffer data proportion of the logical channel where the GRANT is located, the historical scheduling rate of the GRANT, and the number of consecutive times of non-scheduling of the GRANT. 2.The NR grant based scheduling method of claim 1, wherein, The transmission opportunity of the GRANT is obtained based on pre-configuration or real-time scheduling. 3.The NR grant based scheduling method of claim 1, wherein, The priority score is determined by the following formula: P 优先级分值 = a * PendingLength + b * HistorySchedRate + c * NoSchedSpan; wherein PendingLength is the normalized buffer data proportion of the logical channel where the GRANT is located, HistorySchedRate is the historical scheduling rate of the GRANT, and NoSchedSpan is the number of consecutive times of non-scheduling of the GRANT; a represents the buffer data proportion coefficient, b represents the historical scheduling rate proportion coefficient, and c represents the number of consecutive times of non-scheduling proportion coefficient; the sum of a, b, and c is 1. 4.The NR-based grant scheduling method of claim 3, wherein, c>a>b.

5. The NR-based grant scheduling method of claim 3 or 4, wherein, The step of calculating the priority score of each of the GRANTs further comprises: initializing the historical scheduling rate and the number of consecutive times of non-scheduling of the GRANT; obtaining the current buffer data amount of the logical channel where the GRANT is located. 6.The NR grant based scheduling method of claim 1, wherein, The scheduling method comprises: when the transmission opportunity arrives again, updating the historical scheduling rate, the number of consecutive times of non-scheduling of the GRANT, and the current buffer data amount of the logical channel where the GRANT is located according to the scheduling result of the historical transmission opportunity; updating the priority score of each of the GRANTs; scheduling the GRANTs according to the priority scores. 7.The NR grant based scheduling method of claim 1, wherein, The scheduling method further comprises: when the priority scores of the at least two of the GRANTs are the same, scheduling the GRANTs according to the preset number of the GRANTs; wherein the GRANTs with earlier numbers are preferentially scheduled. 8.The NR grant based scheduling method of claim 1, wherein, The scheduling of the GRANTs according to the priority scores further comprises: packaging and sending the data amount of the scheduled GRANT.

9. A scheduling system based on NR-GRANT, characterized by, The scheduling system comprises: an obtaining module for obtaining the logical channel priority of the GRANT; a calculating module for calculating the priority score of each of the GRANTs when the logical channel priorities of at least two of the GRANTs are the same; a scheduling module for scheduling the GRANTs according to the priority scores when a transmission opportunity arrives, wherein only one of the GRANTs is scheduled for each transmission opportunity.

10. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor implements the scheduling method of the NR-based GRANT when executing the computer program.

11. A chip used in electronic devices, characterized in that, The chip is used to execute the scheduling method of the NR-based GRANT.

12. A chip module, used in electronic devices, characterized in that, The transceiver assembly and the chip for performing the method of scheduling of NR-based GRANT according to any one of claims 1-8 are included.

13. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the method of scheduling of NR-based GRANT according to any one of claims 1-8.

Images