CN112383964B - Single-core multi-task scheduling method and system of wireless network physical layer - Google Patents
Single-core multi-task scheduling method and system of wireless network physical layer Download PDFInfo
- Publication number
- CN112383964B CN112383964B CN202011129851.8A CN202011129851A CN112383964B CN 112383964 B CN112383964 B CN 112383964B CN 202011129851 A CN202011129851 A CN 202011129851A CN 112383964 B CN112383964 B CN 112383964B
- Authority
- CN
- China
- Prior art keywords
- task
- signal processing
- channel
- time
- processing task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
Abstract
The embodiment of the invention provides a method and a system for single-core multi-task scheduling of a wireless network physical layer, wherein the method comprises the following steps: acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell; sequencing all the channels and the signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task; and scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask. The embodiment of the invention realizes the efficient single-core multi-task real-time scheduling under the condition of not increasing the resource overhead and complexity.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a method and a system for single-core multi-task scheduling of a wireless network physical layer.
Background
The interface protocol of the wireless network is mainly divided into three layers, including a physical layer L1, a data link layer L2 and a network layer L3. The physical layer is located at the lowest layer of the radio interface and provides information transfer service for L2 and higher layers. The service provided by the physical layer is described by a transmission channel, and the transmission channel is mapped into an uplink physical channel and a downlink physical channel. For the uplink channel, the physical layer needs to complete the processes of multi-antenna reception, demodulation, decoding, and the like. For the downlink channel, the physical layer needs to complete the processes of coding and rate matching, modulation, resource mapping, antenna mapping, and the like. In addition, the physical layer needs to complete a series of processes of transmitting and receiving the reference signal.
The physical layer also controls the timing of L2 and L3, which is consistent with the timing of the air interface signals. In a fixed time unit, the physical layer needs to interact with L2 to complete specific uplink and downlink processing work. These tasks may be performed in several separate tasks, and the physical layer has the following characteristics when processing these tasks: firstly, the real-time performance is realized, and a task queue can be dynamically organized in each time unit; secondly, the timeliness is achieved, each task has respective deadline, and if the deadline is exceeded, the execution result of the task has no meaning.
In the current physical layer multi-task real-time scheduling implementation scheme, there are multi-core multi-task and single-core multi-task schemes. The multi-core multitask has rich core resources and low scheduling pressure, but has high requirements on hardware resources of a processor and high corresponding cost. In contrast, the single-core multi-task scheme has low requirement on hardware resources, so that the method has great advantage in cost. In the single-core multitask scheme, preemptive mode and non-preemptive mode are divided. The former ensures that the high-priority task can be executed first by differentiating the priority, the method is simpler in software implementation, but the task switching brings extra overhead; the latter adopts a multi-task polling mode, does not have the resource overhead of scheduling, but needs a more complex algorithm to select the task to be executed; meanwhile, the two methods have the common defects that the currently scheduled task is determined according to the historical scheduling condition of the task, deviation is easy to occur in scheduling, overtime tasks waste time slices, or the time slices have more spare time slices, so that the core resources cannot be effectively utilized.
Therefore, it is necessary to provide a new method for scheduling single-core multiple tasks, aiming at many disadvantages of the conventional scheduling scheme for single-core multiple tasks.
Disclosure of Invention
The embodiment of the invention provides a method and a system for single-core multi-task scheduling of a wireless network physical layer, which are used for solving the defects that the single-core multi-task needs extra resource overhead, the method is complex and resources are wasted in the prior art, and the single-core multi-task real-time scheduling is efficiently carried out under the condition that the resource overhead and the complexity are not increased.
The embodiment of the invention provides a single-core multi-task scheduling method of a wireless network physical layer, which comprises the following steps:
acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell;
sequencing all the channels and the signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task;
and scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask.
According to the single-core multi-task scheduling method of the wireless network physical layer, the step of calculating the time overhead of each sub task in each channel and signal processing task comprises the following steps:
acquiring time overhead reference values of each key value task and non-key value task under each subtask; the key value tasks are tasks with time spending and one or more key values in a linear relation, the key values are task parameter values relevant to the time spending of the tasks, and the non-key value tasks are tasks with the time spending and the key values irrelevant;
obtaining a key value of the key task from a scheduling message issued by a data link layer in the interface protocol before the beginning of each time slot;
and acquiring the time overhead of each subtask according to the time overhead reference value of each key value task and each non-key value task under each subtask and the key value of each key value task.
According to the method for dispatching the single-core multiple tasks of the wireless network physical layer, the step of acquiring the time overhead reference values of each key value task and each non-key value task under each subtask comprises the following steps:
measuring the starting time and the ending time of the reference operation of each key value task for multiple times;
calculating the time overhead of each reference operation of each key value task according to the starting time and the ending time of each reference operation of each key value task;
calculating the average value of the time spending of the multiple reference operations of each key value task, and taking the average value as the time spending reference value of each key value task;
and testing each non-key value task of time, and acquiring a time overhead reference value of each non-key value task.
According to the method for scheduling the single-core multiple tasks of the wireless network physical layer, the subtasks comprise a flow control task and an algorithm processing task;
the communication, message reading and writing and task dispatching among the tasks under the flow control tasks are non-key value tasks;
and each link of the algorithm processing class task is a key value task.
According to the method for scheduling the single-core multiple tasks of the wireless network physical layer, the step of scheduling the subtasks in each channel and signal processing task according to the sequence of the channel and signal processing task and the time overhead of each subtask comprises the following steps:
for the current time slot, sequentially allocating time slices for the channels and the signal processing tasks according to the sequence of the channels and the signal processing tasks;
if the type of any channel or signal processing task is a first type, time slice distribution is carried out by taking the channel or signal processing task as a unit;
and if the type of any channel or signal processing task is the second type, time slice distribution is carried out by taking the subtask of the channel or signal processing task as a unit.
According to the method for scheduling the single core multiple tasks of the physical layer of the wireless network, if any channel or signal processing task is of the first type, the step of allocating the time slice by taking the channel or signal processing task as a unit comprises the following steps:
if the type of any arbitrary channel or signal processing task is the first type and the channel or signal processing task is not allocated with a time slice, adding the time overheads of all the subtasks of the channel or signal processing task to obtain the time overheads of the channel or signal processing task;
if the time overhead of the channel or the signal processing task is greater than the length of the residual time slice of the current time slot, the time slice is not allocated to the channel or the signal processing task in the current time slot;
if the time overhead of the channel or the signal processing task is less than or equal to the length of the residual time slice of the current time slot, the time slice is distributed for the whole channel or the signal processing task, and the length of the residual time slice of the current time slot is updated to be the length of the residual time slice of the current time slot minus the time overhead of the channel or the signal processing task.
According to the method for scheduling a single core multiple tasks of a wireless network physical layer in an embodiment of the present invention, if any of the channels or the types of the signal processing tasks is the second type, the step of allocating time slices in units of subtasks of the channel or the signal processing task includes:
if any arbitrary channel or signal processing task is of a second type and the channel or signal processing task has a subtask which is not allocated with a time slice, adding the time overheads of the subtasks which are not allocated with the time slice by the channel or signal processing task to obtain the time overheads of the channel or signal processing task;
if the time cost of the channel or the signal processing task is larger than the length of the residual time slice of the current time slot, selecting part of subtasks from the subtasks of the unallocated time slice to allocate the time slice, calculating the total time cost of the selected part of subtasks, and updating the length of the residual time slice of the current time slot into the length of the residual time slice of the current time slot minus the total time cost of the selected part of subtasks;
if the time overhead of the channel or the signal processing task is less than or equal to the length of the remaining time slice of the current time slot, allocating time slices to all the sub-tasks which are not allocated with the time slices in the channel or the signal processing task, and updating the length of the remaining time slice of the current time slot into the length of the remaining time slice of the current time slot minus the time overhead of the channel or the signal processing task.
An embodiment of the present invention further provides a single-core multi-task scheduling system in a wireless network physical layer, including:
the acquisition module is used for acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network and acquiring a channel and a signal processing task of the cell from the configuration of the cell;
the processing module is used for sequencing all the channels and the signal processing tasks of the cell according to the sequence of the priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task;
and the scheduling module is used for scheduling the subtasks in each channel and each signal processing task according to the sequencing of the channels and the signal processing tasks and the time overhead of each subtask.
The embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and when the processor executes the program, the processor implements the steps of any one of the above-mentioned methods for single-core multi-task scheduling of a wireless network physical layer.
An embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the method for single-core multitask scheduling of a physical layer of a wireless network as described in any one of the above.
According to the method and the system for dispatching the single core multiple tasks of the physical layer of the wireless network, all the channels and the signal processing tasks are sequenced from high to low according to the priority by acquiring the channels and the signal processing tasks of the cell, and the subtasks are dispatched according to the sequencing of the channels and each channel and the signal processing task and the time overhead of the subtasks. On one hand, the subtasks are directly and sequentially scheduled according to the sequencing order of the channel and the signal processing task, and the method for determining the scheduled subtasks is simple and has high calculation speed; on the other hand, the time expenditure of each subtask is known before the subtasks are scheduled, the subtasks are scheduled in real time according to the time expenditures of the subtasks, time slices can be reasonably distributed, resources are fully and effectively utilized, and the task scheduling efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a flowchart illustrating a method for scheduling a single core multiple tasks in a physical layer of a wireless network according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a task queue formed by uplink channel processing tasks in a single-core multi-task scheduling method of a wireless network physical layer according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of channel estimation subtask distribution in a method for single-core multi-task scheduling in a physical layer of a wireless network according to an embodiment of the present invention;
fig. 4 is a schematic flowchart illustrating allocation of a first type of channel and a signal processing task time slice in a method for single-core multi-task scheduling in a physical layer of a wireless network according to an embodiment of the present invention;
fig. 5 is a schematic flowchart illustrating allocation of a second type channel and a signal processing task time slice in a method for single-core multi-task scheduling in a physical layer of a wireless network according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a single-core multi-task scheduling system of a wireless network physical layer according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The following describes a method for single-core multi-task scheduling in a wireless network physical layer according to an embodiment of the present invention with reference to fig. 1, where the method includes: s101, acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell;
the wireless network may be a 5G wireless network, an LTE (Long Term Evolution) wireless network, or the like. The physical layer provides information transmission services for the network layer through a transmission channel, and the physical layer also needs to complete the sending and receiving processes of the reference signal. The physical layer transmission channel may be divided into an uplink channel and a downlink channel, and the signal may be divided into an uplink signal and a downlink signal. Common Uplink channels include PRACH (Physical Random Access Channel), PUSCH (Physical Uplink Shared Channel), and PUCCH (Physical Uplink Control Channel), Downlink channels include PBCH (Physical Broadcast Channel), PDSCH (Physical Downlink Shared Channel), PDCCH (Physical Downlink Control Channel), and SSB (Synchronization Signal and PBCH block), and Uplink and Downlink signals include SRS (Sounding Reference Signal), PSS (Primary Synchronization Signal )/SSS (Synchronization Signal, Secondary Synchronization Signal), and CSI-State Reference Signal (RS). Each channel and signal operates differently. The configuration of the current cell can be obtained through a network layer, and the channel and the signal processing task which need to be processed by the current cell are determined. The channel and signal processing tasks are divided into several channels and signal processing tasks according to the work of the channel and signal, such as a PUSCH processing task, a PUCCH processing task, and the like.
S102, sequencing all channels and signal processing tasks of the cell according to the sequence of the priority levels of the channels and the signal processing tasks, which are acquired in advance, from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task;
the priority obtained in advance is preset according to the priority relation of the uplink and downlink scheduling tasks of the physical layer from high to low. And the priority relation of the scheduling task is determined according to the timeliness of the task and the characteristics of the task. For example, the task of processing data and control channels is prioritized over the task of processing PRACH channels and uplink and downlink signals. The PUSCH processing task completes the decoding processing of the uplink code stream data, needs to be completed in a time unit, has the highest priority and is arranged at the first position; the PUCCH processing task completes the decoding of the uplink control information, needs to be completed in a time unit, has higher priority and is arranged at the second position; the PRACH and SRS (Sounding Reference Signal) processing tasks respectively complete random access detection and SRS Signal measurement, and are not high in timeliness, and therefore are respectively arranged in the third and fourth locations.
After the channels and the signal processing tasks of the cell are obtained, the channels and the signal processing tasks are sequenced according to a sequence from high to low of a priority level which is obtained in advance, and the obtained channels and the signal processing tasks are sequentially processed according to the sequencing sequence. Each channel and signal processing task comprises a plurality of subtasks, for example, the PUSCH processing task comprises a PUSCH time domain preprocessing subtask and a PUSCH channel estimation subtask. Each subtask is arranged according to a preset sequence. After the channels and the signal processing tasks are ordered according to the sequence, a task queue can be obtained. Fig. 2 is a task queue formed by the uplink channel processing tasks.
And S103, scheduling the subtasks in each channel and signal processing task according to the sequence of the channel and signal processing task and the time overhead of each subtask.
Specifically, the task to be scheduled at present can be determined according to the sequence of the task queue, the time overhead for scheduling the subtask can be determined according to the overhead time of the subtask, and then whether to schedule the subtask is determined by combining the situation of the current time period. By the scheduling method, not only can the task with high priority be scheduled first, but also the time slice can be allocated reasonably.
In this embodiment, by acquiring channels and signal processing tasks of a cell, all the channels and signal processing tasks are sorted from high to low in priority, and the subtasks are scheduled according to the sorting of the channels and each channel and signal processing task and the time overhead of the subtasks. On one hand, the subtasks are sequentially scheduled directly according to the sequencing order of the channels and the signal processing tasks, and the method for determining the scheduled subtasks is simple and has high calculation speed; on the other hand, the time expenditure of each subtask is known before the subtask is scheduled, the subtask is scheduled in real time according to the time expenditure of the subtask, time slices can be reasonably distributed, resources are fully and effectively utilized, and the task scheduling efficiency is improved.
On the basis of the foregoing embodiments, the step of calculating the time overhead of each sub-task in each channel and signal processing task in this embodiment includes: acquiring time overhead reference values of each key value task and non-key value task under each subtask; the key value task is a task with time spending in linear relation with one or more key values, the key value is a task parameter value related to the time spending of the task, and the non-key value task is a task with time spending unrelated to the key value;
wherein each subtask includes a key value task and a non-key value task. For example, the channel estimation subtask includes a critical value task including data reading and channel estimation, and a non-critical value task including message receiving and message sending. It can be converted into a key-value task and a non-key-value task for each task. In order to facilitate the scheduling of each subtask, each subtask is numbered continuously, indexes are set for key value tasks and non-key value tasks in the subtasks according to the numbers, and time overhead reference values of the key value tasks and the non-key values are stored in an array TspendIn this way, the input index can be used for inquiring any key value task or non-key value task. As shown in fig. 3, which is a queue for converting the channel estimation subtask into the critical value and non-critical value tasks.
The key value task is a task in which the time overhead is linearly related to one or more key values, that is, if a certain task has one key value, the time overhead is t when the key value is 1, and the time overhead is n x t when the key value is n. For example, the reference operation of the channel estimation key task is to perform conjugate multiplication on data of 1 subcarrier on 1 symbol and data of the local pilot, and the reference operation flow is fixed, so that the time overhead does not change, and therefore, the total time overhead of the channel estimation key task is linearly related to the number of pilot symbols sym _ num and the number of subcarriers sc _ num. The key value in the channel estimation key value task is the number of symbols and the number of subcarriers. The pseudocode for the key value task ChannelEstimate _ KeyJob and the key values sym _ num, sc _ num may be represented as follows:
wherein, the reference operation of the key value task is f _ dmrs _ conj _ mul (), and if the time overhead of the reference operation is tbaseThen the time overhead of the key value task is tch_est＝tbaseSym _ num sc _ num. Because of tbaseIs not changed, so tch_estOnly a linear relation in direct proportion to the key values sym _ num and sc _ num is achieved, and by the method, the time overhead of the key value task can be accurately quantized.
The non-key value task means that the execution flow is fixed and is not related to other factors, and the time overhead is basically unchanged. For example, the task of receiving message non-key values is used for completing message receiving and parsing with fixed size, and the time consumption is basically unchanged. The reference value of the time overhead refers to the time overhead of the reference operation, the reference operation of the channel estimation key value task is the conjugate multiplication of the data of 1 subcarrier on 1 symbol and the data of the local pilot frequency, and the time overhead for executing the reference operation is the reference value of the time overhead.
Obtaining a key value of the key task from a scheduling message issued by a data link layer in the interface protocol before the beginning of each time slot; and acquiring the time overhead of each subtask according to the time overhead reference values of each key value task and each non-key value task under each subtask and the key values of each key value task.
Taking the channel estimation composite task as an example, the channel estimation composite task includes two key value tasks DataLoad _ KeyJob and ChannelEstimate _ KeyJob. The number of pilot symbols and the number of resource blocks are obtained from the scheduling message of L2, and two corresponding key values, i.e., the number of symbols sym _ num and the number of subcarriers sc _ num, are obtained through calculation. Then, the time reference values of the two key value tasks are acquired from an array Tpend specially recording the task time overhead, namely Tpend [ l ] and Tpend [ l +2], and then according to a linear relation, the time overheads of the two key value tasks can be calculated to be Tpend [ l ] sym _ num and Tpend [ l +2] sym _ num sc _ num.
And directly acquiring time reference values of two non-key value tasks from Tpend, wherein the time reference values are Tpend [ l +1 ]]And Tspnd [ l +3]. Finally, the time overhead of the whole channel estimation composite task is calculated to be tchest_mux＝Tspend[l]*sym_num*sc_num+Tspend[l+2]*sym_num*sc_num+Tspend[l+1]+Tspend[l+3]. Therefore, the time overhead of the channel estimation composite task is accurately quantified according to the real-time parameters. And analogizing in turn, and finishing the time overhead calculation of all the subtasks in the current time slot.
On the basis of the foregoing embodiment, in this embodiment, the step of obtaining the time overhead reference values of each key value task and non-key value task under each subtask includes: measuring the starting time and the ending time of the reference operation of each key value task for multiple times; calculating the time overhead of each reference operation of each key value task according to the starting time and the ending time of each reference operation of each key value task; calculating the average value of the time spending of the multiple reference operations of each key value task, and taking the average value as the time spending reference value of each key value task; and measuring each non-key value task for multiple times, and acquiring the time overhead reference value of each non-key value task.
Specifically, for non-critical value tasks and critical value tasks, the time overhead reference value utilizes a system clock, and the starting time t is recorded before the task startsstartEnd of the taskEnd time t of post-recordingstopThen time overhead tspend＝tstop-tstart. Then executing t pairs for multiple times of circulationspendAnd averaging to obtain an average value which is the time reference value. The index of the channel estimation key value task is l +2, and the time reference value is stored in Tspend[l+2]If the index of the message receiving task is l, the time reference is stored in Tspend[l]In (1). The embodiment saves the task index to a special array TspendIn the later use, the index is directly used for inquiring.
On the basis of the above embodiment, the subtasks in this embodiment include a flow control type task and an algorithm processing type task; the communication, the message reading and writing and the task dispatching among the tasks under the flow control tasks are non-key value tasks; and each link of the algorithm processing class task is a key value task.
Specifically, the subtasks are divided into critical tasks and non-critical tasks according to different types of the subtasks, and the critical value tasks and the non-critical value tasks in each subtask are combined in a serial connection mode.
On the basis of the foregoing embodiments, in this embodiment, the step of scheduling the subtasks in each channel and signal processing task according to the ordering of the channel and signal processing task and the time overhead of each subtask includes: for the current time slot, sequentially allocating time slices for the channels and the signal processing tasks according to the sequence of the channels and the signal processing tasks; if the type of any channel or signal processing task is the first type, time slice distribution is carried out by taking the channel or signal processing task as a unit; and if the type of any channel or signal processing task is the second type, time slice distribution is carried out by taking the subtask of the channel or signal processing task as a unit.
Specifically, after acquiring the channel and the signal processing task, the current timeslot needs to determine the type of the channel or the signal processing task before allocating the time slice to the channel and the signal processing task. Different types of processing tasks have different requirements on timeliness. If the type of a certain channel or signal processing task is the first type, all the subtasks included in the channel or signal processing task need to be completed and executed in a single time slot, so when time slice allocation is performed on the channel or signal processing task, the time overhead of all the subtasks in the channel or signal processing task should be comprehensively considered. As shown in fig. 2, the PUSCH processing task needs to be completed in one timeslot, and includes a PUSCH time domain preprocessing subtask, a PUSCH channel estimation subtask, a PUSCH channel equalization subtask, a PUSCH demapping, demodulating, decoding subtask, and a PUSCH reporting subtask, and the time overhead of all the subtasks is taken into consideration comprehensively as the basis for time slice allocation.
If the type of a certain channel or signal processing task is the second type, the sub-tasks included in the channel or signal processing task can be completed in multiple time slots, that is, if part of the sub-tasks in the current time slot are not completed, the sub-tasks can be completed in the next time slot. Therefore, when time slice allocation is carried out on the task, the overhead time of a single subtask is used as the basis of the time slice allocation. As shown in fig. 2, the PUSCH processing task may be completed in multiple time slots, where the PRACH processing task includes a PRACH time domain preprocessing subtask, a PRACH detection subtask, and a PRACH reporting subtask, and if the PRACH detection subtask and the PRACH reporting subtask are not completed in the current time slot, the PRACH processing task may be completed in the next time slot. And only allocating time slices for the PRACH time domain preprocessing subtasks in the current time slot.
When time slice allocation is carried out on the channels and the signal processing tasks, the time slices are allocated according to the sequence and different timeliness requirements of each channel and each signal processing task, so that the time slice allocation is more reasonable, resources are fully and effectively utilized, and the scheduling is more accurate and ordered. It is also ensured that each channel and signal processing task assigned to a time slice can be performed.
On the basis of the foregoing embodiment, in this embodiment, if the type of any channel or signal processing task is the first type, the step of allocating time slices in units of the channel or signal processing task includes: if the type of any arbitrary channel or signal processing task is the first type and the channel or signal processing task is not allocated with a time slice, adding the time overheads of all the subtasks of the channel or signal processing task to obtain the time overheads of the channel or signal processing task; if the time overhead of the channel or the signal processing task is greater than the length of the residual time slice of the current time slot, the time slice is not allocated to the channel or the signal processing task in the current time slot; if the time overhead of the channel or the signal processing task is less than or equal to the length of the residual time slice of the current time slot, the time slice is wholly allocated to the channel or the signal processing task, and the length of the residual time slice of the current time slot is updated to be the length of the residual time slice of the current time slot minus the time overhead of the channel or the signal processing task.
Specifically, a flag to be scheduled is set for a certain channel or signal processing task, which indicates that a current time slot has a flag to be scheduled, the minimum value of the flag is equal to 0, which indicates that the current time slot has no subtask to be scheduled, and the maximum value of the flag is equal to the number Nmux of composite tasks included in the channel and the signal processing task, which indicates that all the subtasks of the current time slot are in a state to be scheduled. The channel and the signal processing task have two allowed scheduling flags flgalowstart and flgalowend, which indicate that the current time slot allows the task to start scheduling from the subtask numbered flgalowstart until the subtask numbered flgalowend ends, and the allowed scheduling flag ranges from 1 to Nmux. And if the type of the channel or the signal processing task is the first type and the channel or the signal processing task is not allocated with the time slice, namely the mark to be scheduled is Nmux, scheduling all the subtasks in the channel or the signal processing task as a whole. Before scheduling, the overhead time of all the subtasks is added to obtain the overhead time of the channel or the signal processing task, and whether the overhead time meets the requirement of time slice allocation is judged. If the requirement of time slice distribution is met, the time slices are distributed for the whole channel or signal processing task, and all subtasks are scheduled; otherwise, the time slice is not allocated to the channel or the signal processing task in the current time slot, the length of the remaining time slice of the current time slot is not changed, and any subtask in the channel or the signal processing task is not scheduled. A first type of channel or signal processing task time slice allocation flow is shown in fig. 4.
On the basis of the foregoing embodiment, in this embodiment, if the type of any one of the channels or the signal processing tasks is the second type, the step of performing time slice allocation in units of sub-tasks of the channel or the signal processing task includes: if any arbitrary channel or signal processing task is of a second type and the channel or signal processing task has a subtask which is not allocated with a time slice, adding the time overheads of the subtasks which are not allocated with the time slice by the channel or signal processing task to obtain the time overheads of the channel or signal processing task; if the time cost of the channel or the signal processing task is larger than the length of the residual time slice of the current time slot, selecting part of subtasks from the subtasks of the unallocated time slice to allocate the time slice, calculating the total time cost of the selected part of subtasks, and updating the length of the residual time slice of the current time slot into the length of the residual time slice of the current time slot minus the total time cost of the selected part of subtasks; if the time overhead of the channel or the signal processing task is less than or equal to the length of the remaining time slice of the current time slot, allocating time slices to all the sub-tasks which are not allocated with the time slices in the channel or the signal processing task, and updating the length of the remaining time slice of the current time slot into the length of the remaining time slice of the current time slot minus the time overhead of the channel or the signal processing task.
Specifically, if the type of the channel to be scheduled or the signal processing task of the current time slot is the second type, the sub-task is taken as the minimum unit for scheduling, that is, the overhead time of a single sub-task is taken as the basis for time slice allocation. If the current time slot is the starting time slot of the channel or the signal processing task, the task is a new task, and all the subtasks are in a state to be scheduled, the flagallwait is Nmux; if the current time slot is not the starting time slot of the channel or the signal processing task, the task is not a new task, and the number of the subtasks to be scheduled is equal to the total number of the subtasks minus the number of the previously scheduled subtasks, then the flgalowwait is Nmux-flgalowend. Adding the spending time of all subtasks to be scheduled of the current time slot to obtain the time spending of the channel or the signal processing task, then judging whether the spending time meets the requirement of time slice allocation, if so, allocating time slices for the channel or the signal processing task, and scheduling all subtasks to be scheduledIs executed. If the requirement of time slice distribution is not met, the time slices cannot be completely distributed to all the subtasks to be scheduled, and only N can be selected from the time slicestmpEach subtask to be scheduled allocates a time slice to it. Wherein the selected part of the subtasks to be scheduled need to meet a preset condition. Wherein N istmpThe condition to be satisfied is NtmpThe sum of the time cost of each subtask is less than or equal to the remaining time slice length of the current time slot, but NtmpThe sum of the time overheads of +1 subtasks to be scheduled is greater than the remaining slot chip length of the current slot. The unselected sub-tasks to be scheduled may be allocated time slices for them in the next time slot. A second type of channel or signal processing task time slice allocation flow is shown in fig. 5.
The following describes the single-core multi-task scheduling system of the wireless network physical layer provided in the embodiment of the present invention, and the single-core multi-task scheduling system of the wireless network physical layer described below and the single-core multi-task scheduling method of the wireless network physical layer described above may be referred to each other.
As shown in fig. 6, the single-core multi-task scheduling system of the wireless network physical layer provided in this embodiment includes an obtaining module 601, a processing module 602, and a scheduling module 603;
the obtaining module 601 is configured to obtain a configuration of a cell from a network layer in an interface protocol of a wireless network, and obtain a channel and a signal processing task of the cell from the configuration of the cell;
the wireless network may be a 5G wireless network, an LTE wireless network, or the like. The physical layer provides information transmission service for the network layer through the transmission channel, and in addition, the physical layer needs to complete the sending and receiving processing of the reference signal. The physical layer transmission channel may be divided into an uplink channel and a downlink channel, and the signal may be divided into an uplink signal and a downlink signal. Each type of channel and signal operates differently. The configuration of the current cell can be obtained through a network layer, and the channel and the signal processing task which need to be processed by the current cell are determined. The channel and signal processing tasks are divided into a plurality of channel and signal processing tasks according to the work of the channels and signals.
A processing module 602, configured to sequence all channels and signal processing tasks of the cell according to a sequence from high to low of a pre-obtained priority of each channel and signal processing task, and calculate a time overhead of each sub-task of each channel and signal processing task;
the priority obtained in advance is preset according to the priority relation of the uplink and downlink scheduling tasks of the physical layer from high to low. And the priority relation of the scheduling task is determined according to the timeliness of the task and the characteristics of the task. After the channels and the signal processing tasks of the cell are obtained, the channels and the signal processing tasks are sequenced according to a sequence from high to low of a priority level which is obtained in advance, and the obtained channels and the signal processing tasks are sequentially processed according to the sequencing sequence. Each channel and signal processing task in turn comprises a plurality of subtasks.
And the scheduling module 603 is configured to schedule the subtasks in each channel and signal processing task according to the ordering of the channel and signal processing task and the time overhead of each subtask.
Specifically, the task to be scheduled at present can be determined according to the sequence of the task queue, the time overhead for scheduling the subtask can be determined according to the overhead time of the subtask, and then whether to schedule the subtask is determined by combining the situation of the current time period. By the scheduling method, not only can the task with high priority be scheduled first, but also the time slice can be allocated reasonably.
In this embodiment, by acquiring channels and signal processing tasks of a cell, all the channels and signal processing tasks are sorted from high to low in priority, and the subtasks are scheduled according to the sorting of the channels and each channel and signal processing task and the time overhead of the subtasks. On one hand, the subtasks are directly and sequentially scheduled according to the sequencing order of the channel and the signal processing task, and the method for determining the scheduled subtasks is simple and has high calculation speed; on the other hand, the time expenditure of each subtask is known before the subtasks are scheduled, the subtasks are scheduled in real time according to the time expenditures of the subtasks, time slices can be reasonably distributed, resources are fully and effectively utilized, and the task scheduling efficiency is improved.
On the basis of the foregoing embodiment, the processing module in this embodiment is further configured to: acquiring time overhead reference values of each key value task and non-key value task under each subtask; the key value tasks are tasks with time spending and one or more key values in a linear relation, the key values are task parameter values relevant to the time spending of the tasks, and the non-key value tasks are tasks with the time spending and the key values irrelevant; obtaining a key value of the key task from a scheduling message issued by a data link layer in the interface protocol before the beginning of each time slot; and acquiring the time overhead of each subtask according to the time overhead reference values of each key value task and each non-key value task under each subtask and the key values of each key value task.
On the basis of the foregoing embodiment, the calculating module in this embodiment is specifically configured to: measuring the starting time and the ending time of the reference operation of each key value task for multiple times; calculating the time overhead of each reference operation of each key value task according to the starting time and the ending time of each reference operation of each key value task; calculating the average value of the time spending of multiple times of reference operation of each key value task, and taking the average value as the time spending reference value of each key value task; and directly testing each non-key value task to obtain a time overhead reference value of each non-key value task.
On the basis of the above embodiment, the subtasks in this embodiment include a flow control type task and an algorithm processing type task; the communication, the message reading and writing and the task dispatching among the tasks under the flow control tasks are non-key value tasks; and each link of the algorithm processing class task is a key value task.
On the basis of the foregoing embodiment, in this embodiment, the scheduling module is further configured to: for the current time slot, sequentially allocating time slices for the channels and the signal processing tasks according to the sequence of the channels and the signal processing tasks; if the type of any channel or signal processing task is the first type, time slice distribution is carried out by taking the channel or signal processing task as a unit; and if the type of any channel or signal processing task is the second type, time slice distribution is carried out by taking the subtask of the channel or signal processing task as a unit.
On the basis of the foregoing embodiment, in this embodiment, the scheduling module is further configured to: if the type of any arbitrary channel or signal processing task is the first type and the channel or signal processing task is not allocated with a time slice, adding the time overheads of all the subtasks of the channel or signal processing task to obtain the time overheads of the channel or signal processing task; if the time overhead of the channel or the signal processing task is greater than the length of the residual time slice of the current time slot, the time slice is not allocated to the channel or the signal processing task in the current time slot; if the time overhead of the channel or the signal processing task is less than or equal to the length of the residual time slice of the current time slot, the time slice is distributed for the whole channel or the signal processing task, and the length of the residual time slice of the current time slot is updated to be the length of the residual time slice of the current time slot minus the time overhead of the channel or the signal processing task.
On the basis of the foregoing embodiment, in this embodiment, the scheduling module is further configured to: if any arbitrary channel or signal processing task is of a second type and the channel or signal processing task has a subtask which is not allocated with a time slice, adding the time overheads of the subtasks which are not allocated with the time slice by the channel or signal processing task to obtain the time overheads of the channel or signal processing task; if the time cost of the channel or the signal processing task is larger than the length of the residual time slice of the current time slot, selecting part of subtasks from the subtasks of the unallocated time slice to allocate the time slice, calculating the total time cost of the selected part of subtasks, and updating the length of the residual time slice of the current time slot into the length of the residual time slice of the current time slot minus the total time cost of the selected part of subtasks; if the time overhead of the channel or the signal processing task is less than or equal to the length of the remaining time slice of the current time slot, allocating time slices to all the sub-tasks which are not allocated with the time slices in the channel or the signal processing task, and updating the length of the remaining time slice of the current time slot into the length of the remaining time slice of the current time slot minus the time overhead of the channel or the signal processing task.
Fig. 7 illustrates a physical structure diagram of an electronic device, which may include, as shown in fig. 7: a processor (processor)701, a communication Interface (Communications Interface)702, a memory (memory)703 and a communication bus 704, wherein the processor 701, the communication Interface 702 and the memory 703 are in communication with each other via the communication bus 704. The processor 701 may invoke logic instructions in the memory 703 to perform a method of single core multi-tasking scheduling of the physical layer of a wireless network, the method comprising: acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell; sequencing all the channels and the signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task; and scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask.
In addition, the logic instructions in the memory 703 can be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, an embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program stored on a non-transitory computer-readable storage medium, the computer program includes program instructions, and when the program instructions are executed by a computer, the computer is capable of executing the method for single-core multitask scheduling of a wireless network physical layer provided by the foregoing method embodiments, where the method includes: acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell; sequencing all channels and signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and signal processing task; and scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask.
In yet another aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program is implemented by a processor to perform the method for single-core multi-task scheduling of a wireless network physical layer provided in the foregoing embodiments, and the method includes: acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell; sequencing all the channels and the signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task; and scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask.
The above-described system embodiments are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. A method for scheduling a single core multiple tasks of a wireless network physical layer is characterized by comprising the following steps:
acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network, and acquiring a channel and a signal processing task of the cell from the configuration of the cell;
sequencing all channels and signal processing tasks of the cell according to the sequence of the pre-acquired priority of each channel and signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and signal processing task;
scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask;
the step of scheduling the subtasks in each channel and signal processing task according to the sequencing of the channel and signal processing task and the time overhead of each subtask comprises:
for the current time slot, sequentially allocating time slices for the channels and the signal processing tasks according to the sequence of the channels and the signal processing tasks;
if the type of any channel or signal processing task is the first type, time slice distribution is carried out by taking the channel or signal processing task as a unit;
and if the type of any channel or signal processing task is the second type, time slice distribution is carried out by taking the subtask of the channel or signal processing task as a unit.
2. The method of claim 1, wherein the step of calculating the time overhead of each sub-task in each channel and signal processing task comprises:
acquiring time overhead reference values of each key value task and non-key value task under each subtask; the key value task is a task with time spending in linear relation with one or more key values, the key value is a task parameter value related to the time spending of the task, and the non-key value task is a task with time spending unrelated to the key value;
obtaining a key value of the key value task from a scheduling message issued by a data link layer in the interface protocol before the beginning of each time slot;
and acquiring the time overhead of each subtask according to the time overhead reference values of each key value task and each non-key value task under each subtask and the key values of each key value task.
3. The method according to claim 2, wherein the step of obtaining the time overhead reference values of the key value tasks and the non-key value tasks under each subtask comprises:
measuring the starting time and the ending time of the reference operation of each key value task for multiple times;
calculating the time overhead of each reference operation of each key value task according to the starting time and the ending time of each reference operation of each key value task;
calculating the average value of the time spending of multiple times of reference operation of each key value task, and taking the average value as the time spending reference value of each key value task;
and directly testing each non-key value task to obtain a time overhead reference value of each non-key value task.
4. The method according to claim 2, wherein the subtasks include a flow control type task and an algorithm processing type task;
the communication, the message reading and writing and the task dispatching among the tasks under the flow control tasks are non-key value tasks;
and each link of the algorithm processing class task is a key value task.
5. The method of claim 1, wherein if the type of any channel or signal processing task is the first type, the step of allocating time slices in units of the channel or signal processing task comprises:
if the type of any arbitrary channel or signal processing task is a first type and the channel or signal processing task is not allocated with a time slice, adding the time overheads of all the subtasks of the channel or signal processing task to obtain the time overheads of the channel or signal processing task;
if the time overhead of the channel or the signal processing task is larger than the length of the residual time slice of the current time slot, the time slice is not allocated to the channel or the signal processing task in the current time slot;
if the time overhead of the channel or the signal processing task is less than or equal to the length of the residual time slice of the current time slot, the time slice is wholly allocated to the channel or the signal processing task, and the length of the residual time slice of the current time slot is updated to be the length of the residual time slice of the current time slot minus the time overhead of the channel or the signal processing task.
6. The method of claim 1, wherein if the type of any of the channels or signal processing tasks is the second type, the step of allocating time slices in units of sub-tasks of the channel or signal processing task comprises:
if the type of any arbitrary channel or signal processing task is a second type and the channel or signal processing task has a subtask with an unallocated time slice, adding the time overheads of the subtask with the unallocated time slice of the channel or signal processing task to obtain the time overheads of the channel or signal processing task;
if the time cost of the channel or the signal processing task is larger than the remaining time slice length of the current time slot, selecting part of subtasks from the subtasks of the unallocated time slice to allocate the time slice, calculating the total time cost of the selected part of subtasks, and updating the remaining time slice length of the current time slot to the remaining time slice length of the current time slot minus the total time cost of the selected part of subtasks;
if the time overhead of the channel or the signal processing task is less than or equal to the length of the remaining time slice of the current time slot, allocating time slices to all the sub-tasks which are not allocated with the time slices in the channel or the signal processing task, and updating the length of the remaining time slice of the current time slot into the length of the remaining time slice of the current time slot minus the time overhead of the channel or the signal processing task.
7. A single-core multi-task scheduling system of a wireless network physical layer, comprising:
the acquisition module is used for acquiring the configuration of a cell from a network layer in an interface protocol of a wireless network and acquiring a channel and a signal processing task of the cell from the configuration of the cell;
the processing module is used for sequencing all the channels and the signal processing tasks of the cell according to the sequence of the priority of each channel and the signal processing task from high to low, and calculating the time overhead of each sub-task of each channel and each signal processing task;
the scheduling module is used for scheduling the subtasks in each channel and each signal processing task according to the sequencing of the channels and the signal processing tasks and the time overhead of each subtask;
the scheduling module is further configured to:
for the current time slot, sequentially allocating time slices for the channels and the signal processing tasks according to the sequence of the channels and the signal processing tasks;
if the type of any channel or signal processing task is the first type, time slice distribution is carried out by taking the channel or signal processing task as a unit;
and if the type of any channel or signal processing task is the second type, time slice distribution is carried out by taking the subtask of the channel or signal processing task as a unit.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of the method for single core multitask scheduling of the physical layer of the wireless network as claimed in any one of claims 1 to 6.
9. A non-transitory computer readable storage medium, having stored thereon a computer program, wherein the computer program, when being executed by a processor, implements the steps of the method for single core multi-tasking scheduling of the physical layer of a wireless network according to any of the claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011129851.8A CN112383964B (en) | 2020-10-21 | 2020-10-21 | Single-core multi-task scheduling method and system of wireless network physical layer |
| PCT/CN2021/115711 WO2022083297A1 (en) | 2020-10-21 | 2021-08-31 | Single-core multi-task scheduling method and system for physical layer of wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011129851.8A CN112383964B (en) | 2020-10-21 | 2020-10-21 | Single-core multi-task scheduling method and system of wireless network physical layer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112383964A CN112383964A (en) | 2021-02-19 |
| CN112383964B true CN112383964B (en) | 2022-07-19 |
Family
ID=74580368
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011129851.8A Active CN112383964B (en) | 2020-10-21 | 2020-10-21 | Single-core multi-task scheduling method and system of wireless network physical layer |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112383964B (en) |
| WO (1) | WO2022083297A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112383964B (en) * | 2020-10-21 | 2022-07-19 | 武汉虹信科技发展有限责任公司 | Single-core multi-task scheduling method and system of wireless network physical layer |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102573073A (en) * | 2011-01-04 | 2012-07-11 | 中兴通讯股份有限公司 | Resource allocation method and system for physical layer of terminal |
| CN104536835A (en) * | 2014-12-12 | 2015-04-22 | 北京控制工程研究所 | Self-adaption task scheduling method in hot backup real-time control system |
| CN105204857A (en) * | 2015-09-21 | 2015-12-30 | 中国船舶重工集团公司第七〇五研究所 | Design method of embedded control system capable of accurately scheduling a plurality of time slices based on polling mode |
| CN107333282A (en) * | 2017-06-05 | 2017-11-07 | 惠州Tcl移动通信有限公司 | A kind of 5G terminal general-purpose platform optimization methods and system based on GPP |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1299454C (en) * | 2003-06-18 | 2007-02-07 | 清华大学 | Scheduling method for ensuring service quality of real time operation in OFDM |
| CN101610551B (en) * | 2008-06-20 | 2011-12-07 | 普天信息技术研究院有限公司 | Resource scheduling method for HSUPA |
| CN101541072B (en) * | 2009-04-16 | 2011-06-01 | 北京天碁科技有限公司 | Mobile communication terminal and dispatching method thereof |
| CN103906257B (en) * | 2014-04-18 | 2017-09-08 | 北京邮电大学 | LTE wide-band communication system computing resource schedulers and its dispatching method based on GPP |
| CN112383964B (en) * | 2020-10-21 | 2022-07-19 | 武汉虹信科技发展有限责任公司 | Single-core multi-task scheduling method and system of wireless network physical layer |
-
2020
- 2020-10-21 CN CN202011129851.8A patent/CN112383964B/en active Active
-
2021
- 2021-08-31 WO PCT/CN2021/115711 patent/WO2022083297A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102573073A (en) * | 2011-01-04 | 2012-07-11 | 中兴通讯股份有限公司 | Resource allocation method and system for physical layer of terminal |
| CN104536835A (en) * | 2014-12-12 | 2015-04-22 | 北京控制工程研究所 | Self-adaption task scheduling method in hot backup real-time control system |
| CN105204857A (en) * | 2015-09-21 | 2015-12-30 | 中国船舶重工集团公司第七〇五研究所 | Design method of embedded control system capable of accurately scheduling a plurality of time slices based on polling mode |
| CN107333282A (en) * | 2017-06-05 | 2017-11-07 | 惠州Tcl移动通信有限公司 | A kind of 5G terminal general-purpose platform optimization methods and system based on GPP |
| EP3637830A1 (en) * | 2017-06-05 | 2020-04-15 | JRD Communication (Shenzhen) Ltd | Gpp-based 5g terminal common platform optimization method and system |
Non-Patent Citations (2)
| Title |
|---|
| Scheduling policies for joint optimization of DLC and physical layer in mobile communication systems;Bing Chen;《The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications》;20021210;全文 * |
| 李小文;5G系统终端物理层控制的设计与实现;《电子技术应用》;20190406;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112383964A (en) | 2021-02-19 |
| WO2022083297A1 (en) | 2022-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109565861B (en) | Method and apparatus for data transmission in next generation cellular networks | |
| JP5573957B2 (en) | Resource allocation method and apparatus in communication network | |
| CN108111281B (en) | Data channel parameter configuration method and device | |
| US20210227520A1 (en) | Downlink Control Information DCI Sending Method And Apparatus | |
| EP2805561B1 (en) | Resource allocation in an orthogonal frequency division multiplexing system | |
| CN110535597B (en) | Quasi co-location reference signal determination method, apparatus, network device and storage medium | |
| US11375488B2 (en) | Method for determining and configuring a resource used for transmitting downlink data, terminal and base station | |
| CN114375063A (en) | Resource allocation method and device, user equipment, base station and readable storage medium | |
| EP3322242A1 (en) | Method and device for transmission instruction, transmission triggering and transmission implementation for multi-station | |
| CN110324123B (en) | Time domain resource allocation method and device of PUSCH, storage medium and terminal | |
| CN112383964B (en) | Single-core multi-task scheduling method and system of wireless network physical layer | |
| CN111901083A (en) | Quasi co-location information acquisition method, communication node and storage medium | |
| CN111163526B (en) | Downlink resource mapping method, device, computer equipment and storage medium | |
| US11438875B2 (en) | Signaling receiving method and related device | |
| CN106598727A (en) | Computation resource distribution method and system for communication system | |
| US11375502B2 (en) | Resource indication method and device, storage medium, and processor | |
| CN102186248B (en) | Scheduling method and device used for interference coordination | |
| CN111866902B (en) | Resource utilization rate evaluation method and device | |
| CN107124772B (en) | Resource scheduling method and device | |
| CN109586859B (en) | Resource multiplexing method and device, storage medium, terminal and base station | |
| CN107295660A (en) | A kind of scheduling of resource and data detection method, device, relevant device and system | |
| CN106572536B (en) | Method and system for scheduling multi-cluster resources in uplink shared channel | |
| US10511419B2 (en) | Multi-user grouping | |
| CN102692905B (en) | Method for dynamic and static combined dispatch of LTE (long term evolution) physical layer on multicore DSP (digital signal processor) | |
| US10797838B2 (en) | Apparatus and method for managing radio resources in mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |