Resource scheduling method and device and electronic equipment

By dynamically classifying data business categories at the MAC layer and scheduling resource processing data within appropriate time slots, the synchronization problem between the MAC layer and the PHY layer is solved, ensuring the timely processing of key data, system stability and resource utilization.

CN120343719APending Publication Date: 2025-07-18几维通信技术(深圳)股份有限公司
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202510537565.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-04-27
Publication Date
2025-07-18

AI Technical Summary

Technical Problem

In wireless communication, it is difficult for the MAC layer to ensure accurate synchronization with the PHY layer within a limited scheduling time, resulting in system performance bottlenecks and potential crashes. The existing technology cannot effectively distinguish the urgency and importance of data, resulting in delays in key data processing and synchronization abnormalities.

Method used

Through the MAC layer, dynamically classifies business categories according to data attributes, determines the target processing time slot, and schedules resource processing data within the corresponding time slot, including differentiated processing of emergency services, important services and non-slot-related services, ensuring that key services are completed within the appropriate time slot.

Benefits of technology

The MAC layer is implemented to prioritize the necessary data processing in each time slot, ensuring the precise synchronization between the MAC layer and the PHY layer, and improving the stability and resource utilization of the system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120343719A_ABST
    Figure CN120343719A_ABST
Patent Text Reader

Abstract

The invention discloses a resource scheduling method and device and electronic equipment, and the method comprises the steps: an MAC layer obtains to-be-processed data, determines the service type of the to-be-processed data according to the data attribute of the to-be-processed data, enables the service type to be matched with a response time demand, and carries out the scheduling of the to-be-processed data according to the service type, and determining a target processing time slot of the to-be-processed data, and scheduling resources to process the to-be-processed data in the target processing time slot. Compared with the prior art, the MAC layer carries out service classification (such as emergency services and important services) on the to-be-processed data according to the response time requirement for the data, further determines the target processing time slots of the data, and schedules resources in the corresponding time slots to complete data processing. In this way, it can be guaranteed that the MAC layer preferentially completes data processing which must be completed in the time slot in each time slot, and accurate synchronization of the MAC layer and the PHY layer is guaranteed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of communication technologies, and particularly to a resource scheduling method, device, and electronic device. Background Art

[0002] In the field of wireless communication, especially in low-latency scenarios, the requirement for time is very strict, and the time left for the MAC layer to perform single scheduling processing is very limited. If the MAC layer times out within a scheduling period, it will not be possible to ensure the precise synchronization between the MAC layer and the PHY layer, and in severe cases, it may lead to the collapse of the entire system. Therefore, how to complete the scheduling and processing of data within the limited scheduling time often becomes the bottleneck of the performance of the entire system.

[0003] In the prior art, when the MAC layer processes data, it sorts the data processing priorities according to the importance of the services corresponding to these data, and preferentially processes the most important service data, resulting in the MAC layer being unable to process some key data in a timely manner, and further causing abnormal synchronization between the MAC layer and the PHY layer.

[0004] Therefore, how to schedule the resources of the MAC layer to ensure the precise synchronization between the MAC layer and the PHY layer is a technical problem that needs to be solved urgently by those skilled in the art. Summary of the Invention

[0005] The main purpose of this application is to provide a resource scheduling method, device, and electronic device, aiming to schedule the resources of the MAC layer to ensure the precise synchronization between the MAC layer and the PHY layer.

[0006] To achieve the above purpose, the first aspect of this application provides a resource scheduling method, which includes:

[0007] The MAC layer obtains data to be processed;

[0008] According to the data attributes of the data to be processed, determine the service category of the data to be processed; the service category matches the response time requirement;

[0009] According to the service category, determine the target processing time slot of the data to be processed;

[0010] In the target processing time slot, schedule resources to process the data to be processed.

[0011] Optionally, the determining the service category of the data to be processed according to the data attributes of the data to be processed includes:

[0012] After obtaining the data to be processed, determine the data attributes of the data to be processed; the data attributes include slot correlation and data interactivity;

[0013] Determine the response time requirement of the data to be processed according to the data attributes of the data to be processed;

[0014] Determine the service category of the data to be processed according to the response time requirement of the data to be processed.

[0015] Optionally, the determining the response time requirement of the data to be processed according to the data attributes of the data to be processed includes:

[0016] When the data interactivity is to interact with the PHY layer, determine that the response time requirement of the data to be processed is to be processed in the current time slot;

[0017] When the data interactivity is not to interact with the PHY layer and the time slot correlation is time slot related, determine that the response time requirement of the data to be processed is multi-time slot processing;

[0018] When the time slot correlation is not time slot related, determine that the response time requirement of the data to be processed is non-real-time processing.

[0019] Optionally, the determining the service category of the data to be processed according to the response time requirement of the data to be processed includes:

[0020] When the response time requirement is to be processed in the current time slot, determine that the service type of the data to be processed is an emergency service;

[0021] When the response time requirement is multi-time slot processing, determine that the service type of the data to be processed is an important service;

[0022] When the response time requirement is non-real-time processing, determine that the service type of the data to be processed is a non-time slot related service.

[0023] Optionally, the determining the target processing time slot of the data to be processed according to the service category includes:

[0024] When the service category is an emergency service, determine that the target processing time slot is the current time slot;

[0025] When the service category is an important service, determine that the target processing time slot is multi-time slot linkage;

[0026] When the service category is a non-time slot related service, determine that the target processing time slot is an idle time slot.

[0027] Optionally, the scheduling resources to process the data to be processed in the target processing time slot includes:

[0028] Obtain the remaining duration of the target processing time slot;

[0029] If the remaining duration is greater than the duration threshold, schedule resources to process the data to be processed.

[0030] Optionally, the foregoing resource scheduling method further includes:

[0031] Display a reminder message for reminding whether to start multi-slot linkage to process the data to be processed.

[0032] Optionally, scheduling resources to process the data to be processed in the target processing time slot includes:

[0033] Determine the target processing thread of the data to be processed according to the service category;

[0034] Schedule resources to process the data to be processed in the target processing time slot through the target processing thread.

[0035] A second aspect of the present application provides a resource scheduling device, which includes:

[0036] An acquisition module, configured to acquire data to be processed;

[0037] An identification module, configured to determine the service category of the data to be processed according to the data attribute of the data to be processed; the service category matches the response time requirement;

[0038] A determination module, configured to determine the target processing time slot of the data to be processed according to the service category;

[0039] A scheduling module, configured to schedule resources to process the data to be processed in the target processing time slot.

[0040] A third aspect of the present application provides an electronic device. The foregoing electronic device includes a memory, a processor, and a resource scheduling program stored on the foregoing memory and executable on the foregoing processor. When the foregoing resource scheduling program is executed by the foregoing processor, the steps of any one of the foregoing resource scheduling methods are implemented.

[0041] A fourth aspect of the present application provides a computer-readable storage medium. A resource scheduling program is stored on the foregoing computer-readable storage medium. When the foregoing resource scheduling program is executed by a processor, the steps of any one of the foregoing resource scheduling methods are implemented.

[0042] As can be seen from the above, the present application provides a resource scheduling method, apparatus, and electronic device. The method includes: the MAC layer obtains data to be processed, determines the service category of the data to be processed according to the data attributes of the data to be processed, the service category matches the response time requirement, and then determines the target processing time slot of the data to be processed according to the service category, and schedules resources to process the data to be processed in the target processing time slot. Compared with the prior art, in the present application, the MAC layer classifies the data to be processed according to the response time requirement of the data as needed (for example, divided into emergency services and important services, etc.), and then determines the target processing time slots of these data, and schedules resources to complete data processing within the corresponding time slots, so as to ensure that the MAC layer preferentially completes the data processing that must be completed in each time slot, ensuring the precise synchronization between the MAC layer and the PHY layer. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0044] Figure 1 is a schematic flowchart of a resource scheduling method provided by an embodiment of the present application;

[0045] Figure 2 is a schematic diagram of pseudocode of a resource scheduling method provided by an embodiment of the present application;

[0046] Figure 3 is another schematic flowchart of a resource scheduling method provided by an embodiment of the present application;

[0047] Figure 4 is a schematic diagram of the component modules of a resource scheduling apparatus provided by an embodiment of the present application;

[0048] Figure 5 is a schematic block diagram of the internal structure principle of an electronic device provided by an embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0049] In the following description, specific details such as specific system structures and technologies are presented for the purpose of illustration rather than limitation, so as to thoroughly understand the embodiments of the present application. However, those skilled in the art should clearly understand that the present application can also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to avoid unnecessary details from interfering with the description of the present application.

[0050] It should be understood that, as used in this specification and the appended claims, the term "comprising" indicates the presence of the described features, integers, steps, operations, elements, and / or components, but does not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0051] It should also be understood that the terminology used in the specification of this application is for the purpose of describing particular embodiments only and is not intended to limit this application. As used in the specification of this application and the appended claims, unless the context clearly dictates otherwise, the singular forms "a", "an", and "the" are intended to include the plural forms.

[0052] It should be further understood that the term "and / or" as used in the specification of this application and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0053] As used in this specification and the appended claims, the term "if" may be construed, depending on the context, as "when" or "once" or "in response to determining" or "in response to classifying to". Similarly, the phrase "if determined" or "if classified to [the described condition or event]" may be construed, depending on the context, as meaning "once determined" or "in response to determining" or "once classified to [the described condition or event]" or "in response to classifying to [the described condition or event]".

[0054] The following describes the technical solutions in the embodiments of this application clearly and completely with reference to the accompanying drawings of the embodiments of this application. Obviously, the described embodiments are only a part of the embodiments of this application, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in this application without creative efforts shall fall within the scope of protection of this application.

[0055] Many specific details are set forth in the following description in order to provide a thorough understanding of this application, but this application may also be implemented in other ways different from those described herein. Those skilled in the art may make similar extensions without departing from the connotation of this application, so this application is not limited by the specific embodiments disclosed below.

[0056] In traditional existing wireless communication systems, the MAC layer needs to complete strict synchronization with the PHY layer within a fixed time slot length. During its single scheduling cycle, it needs to process multiple types of tasks, including uplink data reception, downlink data distribution, air interface status maintenance, and signaling interaction. Since there are hard constraints on the response time for different services, when the MAC layer does not establish a time slot allocation mechanism based on data attributes, there is no dynamic adaptation between the processing requirements of critical services and the remaining available time slot resources, resulting in the processing delay of high-priority services exceeding the physical layer synchronization tolerance. This scheduling defect directly causes the accumulation of time slot alignment errors on the base station side, resulting in misalignment of the air interface transmission timing sequence, and then triggering the retransmission mechanism of the radio link control protocol layer, ultimately leading to the end-to-end delay exceeding the URLLC service threshold specified by the 3GPP protocol.

[0057] For example, in the baseband processing unit of a 5G NR base station, the MAC layer needs to process the generation of uplink scheduling grants for 32 UEs, the update of hybrid automatic repeat request status, and the parsing of channel quality indicators every 1ms time slot. When the UE emergency scheduling request reported by the PHY layer and the upper-layer RLC data cached inside the MAC arrive simultaneously, the traditional polling scheduling algorithm does not distinguish the data interaction characteristics, resulting in the delay in processing the PHY layer power control instructions that need to be fed back in this time slot. At this time, the remaining processing time of the MAC layer is only 15 μs, but it needs to complete cross-layer signaling encapsulation and transport block construction, directly causing the timestamp synchronization deviation with the PHY layer to reach 0.8 μs, exceeding the tolerance range of 0.5 μs specified by the protocol. This deviation triggers a timer timeout after 3 consecutive time slots, forcing the PHY layer to start an abnormal recovery process, resulting in a 12% reduction in the effective data transmission window.

[0058] If the above problems are not solved, the timing asynchronization between the PHY layer and the MAC layer will cause the misalignment of the time slot format indicator in the downlink control information, causing the UE to monitor the physical downlink control channel in the wrong time slot. After this error is passed to the radio resource control layer, it will trigger unnecessary radio link failure detection and initiate the RRC connection reconstruction process. In the multi-cell carrier aggregation scenario, this chain reaction will cause the abnormal release of the secondary cell group, reducing the throughput of the terminal device to the single-carrier level. More seriously, in a TDD system, the time slot ratio imbalance may lead to uplink and downlink time slot conflicts, generating cross-interference between base stations, increasing the network-side bit error rate to the order of 10^-3, and completely destroying the service guarantee ability of ultra-reliable low-latency communication.

[0059] In the face of the above problems, the present application first analyzes the inherent defects of the traditional MAC layer scheduling mechanism when processing multiple types of services. When the PHY layer emergency scheduling request and the RLC layer data arrive at the same time, the existing polling mechanism cannot distinguish the urgency of the data interaction, resulting in cross-layer signaling processing delays. In this regard, the present application explores optimizing scheduling priorities by establishing a dynamic mapping relationship between service attributes and time slot resources. Possible solutions include introducing dynamic priority queue management, but this solution is difficult to cope with the impact of sudden high-priority tasks on the queue structure; another idea is to build a time slot resource pre-allocation model, but its static characteristics cannot adapt to the rapid changes in the state of the wireless channel. After weighing, the present application finally adopts a collaborative mechanism of service classification and time slot linkage, dynamically divides the processing window according to data interactivity and time slot correlation, and maximizes resource utilization while ensuring the real-time performance of key services.

[0060] In this regard, Figure 1 As shown, the present application proposes a resource scheduling method, comprising the following steps:

[0061] S101: The MAC layer obtains data to be processed.

[0062] Among them, the MAC layer obtains the data to be processed, which means receiving the data packets or signals to be processed from the upper layer protocol or physical layer. Specifically, the communication protocol parsing can be implemented through the data interface module to provide a data input basis for solving resource scheduling.

[0063] S102: Determine the service category of the data to be processed according to the data attribute of the data to be processed, and match the service category with the response time requirement.

[0064] Among them, data attributes refer to a set of parameters that reflect the characteristics of data services, including time slot relevance, interactivity, and delay sensitivity, which are used to identify the dependence of services on processing time and provide a basis for classification. Among them, service categories refer to priority labels based on data attributes. Specifically, a preset classification algorithm can be used to match response time requirements and solve conflicts in scheduling orders of different services.

[0065] S103: Determine a target processing time slot for the data to be processed according to the service category.

[0066] The target processing time slot refers to the execution time period allocated to the data to be processed, which can be determined by a dynamic time slot allocation algorithm to ensure that the data is processed within a window that meets the time constraints.

[0067] S104: In the target processing time slot, scheduling resources to process the data to be processed.

[0068] Among them, scheduling resource processing refers to allocating computing, storage, and communication resources to data tasks within the target time slot. Specifically, the resource allocation module is used to map physical resources to logical tasks, improving resource utilization.

[0069] The core innovation of this application lies in dynamically allocating the data to be processed at the MAC layer to different processing time slots according to service categories. Through the matching mechanism between service categories and time slot resources, emergency services are preferentially processed within a limited scheduling period, while non-real-time services are elastically allocated, avoiding the synchronization failure problem caused by timeout in a single time slot.

[0070] The working process and principle of this application are as follows: The MAC layer first obtains the data to be processed, and then determines the service category according to the data attributes of the data to be processed. The service category matches the response time requirement. Specifically, the MAC layer analyzes attributes such as the time slot correlation and data interactivity of the data to be processed, and accordingly judges the response time requirement of the data, and then determines the service category to which it belongs. Next, according to the determined service category, a target processing time slot is allocated to the data to be processed. For example, emergency services are allocated to the current time slot for processing, important services may be allocated to the next few time slots for processing, and non-time slot related services are arranged to be processed in idle time slots. Finally, within the determined target processing time slot, the MAC layer schedules the corresponding processing resources to process the data. This classification processing mechanism based on data attributes enables the MAC layer to reasonably allocate time slot resources according to the urgency of services, ensuring the real-time performance of critical services and improving the overall resource utilization.

[0071] As a preferred embodiment, the solution of this application is specifically implemented as follows: The MAC layer receives a batch of data to be processed reported by the PHY layer. The MAC layer first analyzes the attributes of this batch of data and finds that it includes synchronization signal data that needs to interact with the PHY layer, scheduling request data related to time slots, and non-time slot related log data. According to data interactivity, the MAC layer determines that the synchronization signal data is an emergency service that needs to be processed in this time slot. According to time slot correlation, the scheduling request data is determined to be an important service that can be processed in multiple time slots. The non-time slot related log data is determined to be a non-emergency service that can be processed in an idle time slot. Then, the MAC layer allocates target processing time slots to these three types of data respectively: the synchronization signal data is allocated to the current time slot, the scheduling request data is allocated to be processed in the next 2-3 time slots, and the log data is arranged to be processed in a future idle time slot. Finally, the MAC layer preferentially schedules resources in the current time slot to process the synchronization signal data to ensure synchronization with the PHY layer. If there is still remaining time in the current time slot, then part of the scheduling request data is processed. The log data is left to be processed in a subsequent idle time slot.

[0072] Through the above solutions, the present application realizes differential scheduling of MAC layer data processing. Emergency services are processed in a timely manner, ensuring the precise synchronization between the MAC layer and the PHY layer. Important services are smoothly processed through multi-slot linkage, avoiding excessive processing pressure within a single slot. Non-emergency services are arranged to be processed in idle slots, improving the overall resource utilization rate. This intelligent scheduling mechanism based on data attributes effectively solves the problem that it is difficult for the MAC layer to complete all data processing within the limited scheduling time, and improves the robustness and reliability of the system.

[0073] In some of the above solutions of the present application, it is proposed to determine the target processing slot by matching the response time requirement with the service category. However, in the process of determining the service category, there is a lack of a direct association mechanism between the data attributes and the response time requirement, resulting in insufficient accuracy of service category division and affecting the effectiveness of subsequent slot scheduling.

[0074] The present application further proposes that after obtaining the data to be processed, determine the data attributes of the data to be processed. The data attributes include slot correlation and data interactivity. Determine the response time requirement according to the data attributes of the data to be processed, and then determine the service category according to the response time requirement.

[0075] Among them, slot correlation is used to judge whether the data to be processed is bound to a specific slot, and data interactivity is used to judge whether the data to be processed involves cross-layer interaction operations. Slot correlation is divided into slot-related or non-slot-related, and data interactivity is divided into the need to interact with the PHY layer or not need to interact with the PHY layer. For example, the data that needs to interact with the PHY layer includes the transceiver of slot synchronization signals or cross-layer data transmission. At this time, the response time requirement is locked to be processed in this slot; the data that is slot-related but does not require cross-layer interaction is allowed to be processed within multiple slots, and the non-slot-related data can be delayed to be processed in the idle slot.

[0076] Specifically, when the MAC layer obtains the data to be processed, first analyze the slot correlation and data interactivity in its data attributes. If the data interactivity is marked as the need to interact with the PHY layer, directly trigger the processing flow of this slot to ensure the real-time nature of cross-layer operations; if the data does not require cross-layer interaction but the slot correlation is marked as slot-related, generate a multi-slot linkage scheduling instruction; if the slot correlation is marked as non-slot-related, classify the data into the non-real-time processing queue. By hierarchically analyzing the data attributes, accurately match the response time requirement with the service category. For example, the data that needs to interact with the PHY layer is classified as an emergency service, the slot-related data is classified as an important service, and the non-slot-related data is classified as a non-real-time service. This process avoids scheduling timeouts or resource waste caused by misjudgment of service categories through the step-by-step mapping of attributes and requirements, and ensures that high-priority services are processed within strict time limits.

[0077] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0078] After the MAC layer obtains the data to be processed, it first determines the data attributes of the data to be processed. The data attributes include slot correlation and data interactivity. Slot correlation refers to whether the data is associated with a specific slot, and data interactivity refers to whether the data needs to interact with the PHY layer.

[0079] For example, for uplink control information, since it needs to be processed within a specific slot and interact with the PHY layer, it has slot correlation and data interactivity. For some statistical data, it may not depend on a specific slot and does not need to interact with the PHY layer, so it does not have slot correlation and data interactivity.

[0080] Furthermore, the MAC layer determines the response time requirement of the data to be processed according to the data attributes of the data to be processed. Specifically, if the data needs to interact with the PHY layer, the response time requirement is to be processed in this slot; if the data does not need to interact with the PHY layer but has slot correlation, the response time requirement is multi-slot processing; if the data neither needs to interact with the PHY layer nor has slot correlation, the response time requirement is non-real-time processing.

[0081] Finally, the MAC layer determines the service category of the data to be processed according to the response time requirement of the data to be processed. Among them, the data with the response time requirement of being processed in this slot is determined to be an emergency service, the data with the response time requirement of multi-slot processing is determined to be an important service, and the data with the response time requirement of non-real-time processing is determined to be a non-slot-related service.

[0082] Through the above technical solution, the present application can accurately judge the response time requirement according to the data attributes of the data to be processed, and then reasonably determine the service category. This classification method takes into account the slot correlation and interactivity of the data, enabling the MAC layer to more accurately identify the processing priorities of different data. Thus, the MAC layer can give priority to processing emergency services to ensure timely interaction with the PHY layer; for important services, the processing time can be flexibly arranged within multiple slots; for non-slot-related services, they can be processed when the system resources are sufficient. This differential processing strategy effectively improves the resource utilization efficiency of the MAC layer, while ensuring the timely response of critical services, thereby enhancing the stability and reliability of the entire communication system.

[0083] In some of the above solutions of the present application, when determining the response time requirement according to the data attributes, there is a problem that different processing priorities cannot be effectively distinguished, resulting in the resource scheduling may not meet the strict time synchronization requirements, thus affecting the system stability.

[0084] When the data interactivity requires interaction with the PHY layer, the response time requirement is determined as the current time slot processing; when the data interactivity does not require interaction with the PHY layer and the time slot correlation is time slot related, the response time requirement is determined as multi-time slot processing; when the time slot correlation is non-time slot related, the response time requirement is determined as non-real-time processing.

[0085] Among them, whether the data interactivity involves interaction with the PHY layer directly determines the processing timeliness. If the data interactivity requires interaction with the PHY layer, such as the synchronization signal reported by the PHY or the time slot data to be sent, the processing must be completed within the current time slot. If the data interactivity does not require interaction with the PHY layer, but the time slot correlation is time slot related, such as the air interface link state update or cross-time slot scheduling data, multi-time slot linkage processing is allowed. If the time slot correlation is non-time slot related, such as logs or statistical information, it is classified as non-real-time processing. The time slot correlation is divided according to the degree of dependence of the data on time synchronization. For example, data that needs to be aligned with the radio frame structure is defined as time slot related, otherwise it is non-time slot related.

[0086] Specifically, when the MAC layer receives the data to be processed, it first parses the interactivity and time slot correlation in its data attributes. For example, if the data needs to interact with the PHY layer, such as sending a synchronization signal or receiving UE data reported by the PHY, the current time slot resources are immediately allocated for processing to avoid synchronization deviation. If the data does not require PHY interaction but is related to time slot scheduling, such as generating scheduling information for subsequent time slots, multi-time slot staged processing is allowed. For example, the generated data is cached according to the time slot index and gradually processed in subsequent time slots. If the data is non-time slot related, such as log records, it is only processed when there is sufficient remaining time in the time slot. By distinguishing different response time requirements, critical services can be preferentially processed within limited time slots, and at the same time, the processing pressure of a single time slot can be alleviated through multi-time slot linkage to ensure strict synchronization with the PHY. For example, when the remaining duration is less than 50 microseconds, only the essential services of the current time slot are processed, and the rest are postponed, thus avoiding the risk of timeout.

[0087] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0088] When determining the response time requirement of the data to be processed, first judge the data interactivity. If the data needs to interact with the PHY layer, determine that the response time requirement of the data is the current time slot processing. For example, for the synchronization signal data that needs to be immediately sent to the PHY layer, set its response time requirement as the current time slot processing.

[0089] If the data does not need to interact with the PHY layer, further judge its time slot correlation. For time slot related data, such as MAC CE data that needs to be processed in the next few time slots, determine its response time requirement as multi-time slot processing.

[0090] For non-slot-related data, such as log records or performance statistics data, its response time requirement is determined as non-real-time processing. Such data can be processed when the system resources are idle.

[0091] Through this classification method, the processing order and timing can be reasonably arranged according to the characteristics of the data.

[0092] Through the above technical solution, the present application can effectively distinguish the processing urgency of different types of data, give priority to processing time-sensitive data, and at the same time reasonably arrange the processing timing of other data. This classification processing method can improve the scheduling efficiency of the MAC layer, reduce the processing delay of critical data caused by processing non-urgent data, and thus improve the real-time performance and stability of the entire system.

[0093] In some of the above solutions of the present application, it is proposed to determine the service category according to the response time requirement of the data to be processed for resource scheduling. However, after determining the response time requirement, how to map different response time requirements to specific service categories to adapt to the subsequent resource scheduling strategy is not clear.

[0094] The present application further proposes that when the response time requirement is for processing in this time slot, the service type of the data to be processed is determined as an emergency service; when the response time requirement is for multi-time slot processing, the service type is determined as an important service; when the response time requirement is for non-real-time processing, the service type is determined as a non-slot-related service.

[0095] Among them, the response time requirement is determined based on the slot correlation and data interactivity in the data attributes. For example, when the data interactivity is to interact with the PHY layer, the response time requirement is set as processing in this time slot; when the data interactivity is not to interact with the PHY layer and the slot correlation is slot-related, the response time requirement is set as multi-time slot processing; when the slot correlation is non-slot-related, the response time requirement is set as non-real-time processing. The service type and the response time requirement form a one-to-one mapping relationship, where the emergency service corresponds to the processing requirement in this time slot, the important service corresponds to the multi-time slot processing requirement, and the non-slot-related service corresponds to the non-real-time processing requirement. This mapping relationship is implemented through a preset judgment logic, such as using a conditional branch structure to match the response time requirement.

[0096] Specifically, after determining the response time requirement of the data to be processed at the MAC layer, the response time requirement is divided into three types: this-slot processing, multi-slot processing, and non-real-time processing, corresponding to emergency services, important services, and non-slot-related services respectively. When the response time requirement is this-slot processing, the service type is marked as an emergency service, triggering immediate scheduling and processing; when the response time requirement is multi-slot processing, the service type is marked as an important service, triggering cross-slot collaborative scheduling; when the response time requirement is non-real-time processing, the service type is marked as a non-slot-related service, triggering idle-slot scheduling. This classification method enables different service types to be assigned to different processing threads. For example, emergency services are assigned to high-priority threads, important services are assigned to medium-priority threads, and non-slot-related services are assigned to low-priority threads. By binding the service type to the processing thread, when the processing resources are limited, the system can prioritize ensuring that emergency services are completed within this slot, avoiding synchronization failures caused by processing timeouts.

[0097] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0098] After determining the response time requirement of the data to be processed, further determine the service category of the data to be processed according to the response time requirement. Specifically, when the response time requirement is this-slot processing, determine that the service type of the data to be processed is an emergency service. When the response time requirement is multi-slot processing, determine that the service type of the data to be processed is an important service. When the response time requirement is non-real-time processing, determine that the service type of the data to be processed is a non-slot-related service.

[0099] For example, in practical applications, the MAC layer can set up a service type mapping table to map different response time requirements to corresponding service categories. For data that needs to be processed within this slot, such as data interacting with the PHY layer, mark it as an emergency service. For data that can be processed within multiple slots, such as MAC CE processing and upper-layer data forwarding, mark it as an important service. For non-real-time processed data, such as log and performance statistics processing, mark it as a non-slot-related service.

[0100] In this way, the MAC layer can quickly determine the service category of the data according to the response time requirement of the data, providing a basis for subsequent resource scheduling.

[0101] Through the above technical solutions, the present application achieves accurate classification of the data to be processed. Thus, the MAC layer can adopt different processing strategies according to the service category of the data, give priority to processing emergency services, reasonably arrange the processing time of important services, and process non-slot-related services when the system resources permit. This classification method helps to improve the processing efficiency of the MAC layer, ensures that time-sensitive services are processed in a timely manner, and also reserves processing space for non-real-time services, thereby improving the performance and reliability of the entire system.

[0102] In some of the above solutions of the present application, when determining the target processing time slot of the data to be processed according to the service category, if the processing time slots of different service categories are not clearly divided, it may lead to the failure to schedule and process emergency services in a timely manner, or non-slot-related services occupying key time slot resources, resulting in uneven distribution of processing time, and further affecting the time slot synchronization between the MAC layer and the PHY layer.

[0103] The present application further proposes to determine the target processing time slot of the data to be processed according to the service category, including: when the service category is an emergency service, determining the target processing time slot as the current time slot; when the service category is an important service, determining the target processing time slot as multi-time slot linkage; when the service category is a non-slot-related service, determining the target processing time slot as an idle time slot.

[0104] Among them, the service categories are divided into emergency services, important services and non-slot-related services, corresponding to the current time slot, multi-time slot linkage and idle time slot respectively. Emergency services need to be immediately scheduled to the current time slot for processing. Multi-time slot linkage allows cross-time slot resource allocation to process important services. Idle time slots are used to process non-real-time data. The division of the processing time slot is associated with the remaining duration threshold, and resource scheduling is triggered when the remaining duration is greater than the threshold. Multi-time slot linkage processing smooths the time fluctuations of a single time slot by decomposing the service into multiple time slot tasks.

[0105] Specifically, when the MAC layer obtains the data to be processed and determines its service category, if the service category is an emergency service, directly allocate the current time slot resources for processing to ensure that the interactive data with the PHY layer is completed within the synchronization window. For important services, adopt the multi-time slot linkage strategy, split the processing task into multiple time slots and execute them step by step to avoid single time slot timeout. Non-slot-related services are only processed in idle time slots, and the judgment basis for idle time slots includes whether the remaining duration exceeds the threshold. For example, when the remaining duration is greater than 50 microseconds, schedule resources to process the emergency service of the current time slot; if the remaining duration is insufficient, skip unnecessary processing. Through the hierarchical scheduling mechanism, give priority to ensuring the processing of emergency services, allocate multi-time slot resources flexibly, and avoid key time slot resources being occupied by non-real-time services, thereby maintaining the time slot synchronization stability between the MAC layer and the PHY layer.

[0106] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0107] Determine the target processing time slot for the data to be processed according to the service category. When the service category is an emergency service, determine that the target processing time slot is the current time slot. When the service category is an important service, determine that the target processing time slot is multi-time slot linkage. When the service category is a non-time slot related service, determine that the target processing time slot is an idle time slot.

[0108] Specifically, the MAC layer first obtains the service category information of the data to be processed. Further, the MAC layer maintains a mapping table between service categories and processing time slots. For example, an emergency service is mapped to be processed in the current time slot, an important service is mapped to be processed by multi-time slot linkage, and a non-time slot related service is mapped to be processed in an idle time slot. Thus, the MAC layer can query this mapping table according to the service category of the data to be processed to determine the corresponding target processing time slot.

[0109] For an emergency service, since it needs to be processed within the current time slot, the MAC layer will immediately allocate processing resources. For an important service, the MAC layer will process it collaboratively in multiple consecutive time slots, and allocate partial processing resources in each time slot. For a non-time slot related service, the MAC layer will put it into a low-priority queue and process it only when there is an idle time slot.

[0110] Through the above technical solution, the present application can flexibly allocate processing time slots according to the service category, improving the flexibility and efficiency of resource scheduling in the MAC layer. Emergency services are processed in a timely manner, ensuring the latency requirements. Important services are smoothly processed through multi-time slot linkage, avoiding excessive processing pressure in a single time slot. Non-time slot related services are processed using idle time slots, improving resource utilization. Overall, a reasonable allocation and scheduling of MAC layer processing resources are achieved.

[0111] In some of the above solutions of the present application, the target processing time slot of the data to be processed is determined and resources are scheduled in this time slot to process the data. However, in the actual scheduling process, if the remaining available time is insufficient, forced processing may cause timeouts, which may further affect the synchronization with the physical layer and even cause system failures.

[0112] The present application further proposes to schedule resources in the target processing time slot to process the data to be processed, including obtaining the remaining duration of the target processing time slot; if the remaining duration is greater than the duration threshold, then schedule resources to process the data to be processed.

[0113] Among them, the remaining duration is obtained by real-time monitoring of the remaining time of the current time slot, and the duration threshold is set to a fixed value according to the system processing capacity. For example, the duration threshold can be set to 50 microseconds to ensure that the scheduling operation is completed within the remaining time. The comparison between the remaining duration and the duration threshold is implemented by a hardware timer. When the timer reading exceeds the threshold, an interrupt mechanism is triggered to terminate the current processing flow.

[0114] Specifically, within the target processing time slot, the system first starts a timer to record the remaining time. When the remaining duration is greater than 50 microseconds, the scheduler allocates computing resources to execute data processing; if the remaining duration is insufficient, the current processing task is skipped. This mechanism monitors the time margin in real time through a hardware timer to avoid physical layer synchronization failures caused by timeouts. For example, during the processing of emergency services, the system immediately releases resources when the remaining time is insufficient to ensure the transmission priority of the physical layer synchronization signal. At the same time, the threshold setting matches the longest processing time of a single scheduling operation of the system. For example, when the upper limit of the processing time per single processing is 40 microseconds, setting a threshold of 50 microseconds can provide a safety margin of 10 microseconds.

[0115] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0116] After the MAC layer obtains the data to be processed, it determines the service category according to the data attributes of the data to be processed, and determines the target processing time slot according to the service category. In the target processing time slot, the MAC layer first obtains the remaining duration. For example, by calling the system clock function to obtain the current time and subtracting it from the end time of the time slot, the remaining duration is obtained.

[0117] Furthermore, the MAC layer compares the remaining duration with a preset duration threshold. The duration threshold can be set according to the actual system performance and service requirements, for example, set to 50 microseconds. If the remaining duration is greater than the duration threshold, the MAC layer schedules resources to process the data to be processed. Specifically, the MAC layer can start the corresponding processing thread, allocate the necessary computing resources and memory space, and start executing the data processing task.

[0118] Thus, by judging whether the remaining duration is sufficient, it is possible to avoid starting a new processing task when the time slot is about to end, thereby ensuring that each task can be processed within the allocated time slot.

[0119] Through the above technical solutions, the present application can effectively avoid the problem of processing timeouts caused by the MAC layer starting a new processing task before the end of the time slot. By reasonably utilizing the remaining time of each time slot, the processing efficiency of the MAC layer and the system stability are improved. At the same time, this solution can flexibly adapt to different service scenarios and hardware conditions, and balance the processing efficiency and system load by adjusting the duration threshold.

[0120] In some of the above solutions of the present application, although the mechanism for service category division and determination of the target processing time slot can achieve data classification scheduling, there is still a problem of insufficient resource allocation efficiency in an actual multi-core system. Specifically, in the single-threaded processing mode, the multi-core computing resources cannot be fully utilized, resulting in limited processing efficiency of high-priority services.

[0121] The present application further proposes to determine a target processing thread for the data to be processed according to the service category, and use the target processing thread to schedule resources to process the data to be processed in the target processing time slot.

[0122] Among them, the determination of the target processing thread is based on the priority division of the service category. Emergency services are assigned to high-priority threads, important services are assigned to medium-priority threads, and non-time-slot-related services are assigned to low-priority threads. The priority of the thread is associated with the remaining duration threshold of the processing time slot. When the remaining duration is less than 50 microseconds, only high-priority threads are allowed to execute operations. A mutex mechanism is adopted among multiple threads to ensure the atomicity of resource scheduling, and the processing results of different threads within the same time slot are interacted through a shared memory list.

[0123] Specifically, when the service category is identified as an emergency service, the system will create an independent thread to process the physical layer interaction data within this time slot, and this thread monopolizes the CPU core resources to ensure real-time performance. For important services, the system starts a multi-time-slot linkage thread, which uses a time slice rotation mechanism to allocate computing tasks among multiple cores and processes the scheduling data of one time slot each time. The non-real-time service processing thread is only activated when it detects that the remaining time of the time slot exceeds 50 microseconds, and its execution process allows to be interrupted by high-priority threads. In a specific implementation, the size of the thread pool is dynamically adjusted according to the number of hardware cores, each thread is bound to a dedicated buffer area to avoid data competition, and the processed service data is synchronized to the physical layer interface through a memory barrier mechanism. This multi-threaded concurrent processing architecture enables different types of services to execute in parallel, and under the premise of ensuring time slot synchronization, the system throughput is increased to 2.3 times that of the single-threaded mode.

[0124] As a preferred embodiment, the solution of the present application is specifically implemented as follows: The MAC layer creates three independent threads, namely a high-priority thread, a medium-priority thread, and a low-priority thread. When the data to be processed is classified as an emergency service, the high-priority thread is triggered to execute. This thread directly accesses the physical layer interface buffer area, extracts the synchronization signal and the uplink data of the user equipment, and completes the verification and forwarding operations within the current time slot; if the service category belongs to an important service, the medium-priority thread starts a multi-time-slot task scheduler, traverses the buffer data stored in the memory list for the first two time slots, sequentially performs radio interface quality assessment and scheduling decision generation, and writes the processing results into the queue corresponding to the pre-allocated time slot index; for non-time-slot-related services, the low-priority thread extracts log records and performance statistics information from the circular buffer within the remaining time of the time slot, performs data compression and then writes it into the non-volatile storage medium. The thread scheduler realizes resource allocation through an event trigger mechanism. When the high-priority thread is in the running state, the medium- and low-priority threads enter the suspended queue to wait for a semaphore notification.

[0125] Through the above technical solutions, the present application achieves physical isolation and parallel execution of processing flows for different service categories, ensuring that the emergency service processing thread exclusively occupies computing resources and avoiding the problem of loss of key time slot synchronization signals caused by multi-time slot linked processing occupying core resources. Through the thread priority scheduling mechanism, while maintaining the synchronization accuracy of the physical layer, the computing power of the multi-core processor is effectively utilized, avoiding the phenomenon of idle or overloaded processing capabilities, and ensuring the real-time response capability and processing stability of the MAC layer in complex service scenarios.

[0126] In some of the above solutions of the present application, multi-time slot linked processing may cause some delays to the quality status of the wireless air interface link. At this time, in some embodiments of the present application, Figure 1 the method shown further includes: displaying a reminder message for reminding whether to start multi-time slot linked processing of the data to be processed, so as to remind the base station management personnel to actively control whether to start the multi-time slot linked scheduling processing interface.

[0127] The present invention will now be described in conjunction with specific application scenarios.

[0128] Scenario 1

[0129] In some solutions, when the MAC layer processes services within a single scheduling time slot, there are problems such as the remaining time not being fully utilized or the processing thread allocation being unreasonable, resulting in limited scheduling efficiency for time-sensitive services and non-real-time services, and affecting the overall system performance.

[0130] As Figure 2 shown in the pseudo code, the present application further proposes a resource scheduling method, and the scheduling method includes the following steps:

[0131] The MAC layer completes its own initialization; the MAC layer completes the parameter configuration of the PHY; the MAC layer processes the services that must be processed within the current time slot; caches the data reported by the PHY into the memory list; sends the prepared data to the physical layer, which must include the time slot synchronization signal; the MAC layer processes the services that can be processed in cooperation with multiple time slots; reads and processes the cached data reported by the PHY from the memory list; there is not much time left, directly jump out and do not process this data; processes the data of a certain time slot reported by the PHY; generates the data for the next scheduling time slot; each time processes the scheduling of one time slot, and in actual available cases, can process the scheduling data of multiple time slots; when there is still remaining available time in the time slot, the MAC processes other non-real-time services, such as logs and performance statistics.

[0132] Among them, the MAC layer initialization includes establishing communication channels with the RLC layer upward and the PHY layer downward to ensure the basic communication capabilities of the data link. The parameter configuration for the PHY layer needs to meet the time slot synchronization requirements, such as configuring the time slot length and the synchronization signal format. When processing the services that must be processed in the current time slot, the synchronization signal and UE data are preferentially sent to avoid synchronization deviation with the PHY layer. When caching the data reported by the PHY layer, it is stored in a memory list to support reading on demand in subsequent time slots. When processing multi-time slot collaborative services, if the remaining time is less than 50 microseconds, this processing is skipped to avoid timeout; when generating data for the next time slot, it is saved in an index cache mode for subsequent time slot calls. When processing non-real-time services during the remaining time, the log records are written asynchronously, and only the key metrics are updated for performance statistics.

[0133] Specifically, after the MAC layer establishes the communication channel in the initialization stage, it realizes the basis of time slot synchronization by configuring PHY parameters. When processing the services that must be processed in the current time slot, the sending of the synchronization signal is preferentially ensured to avoid the risk of link out-of-step. After caching the data reported by the PHY layer, it dynamically decides whether to process multi-time slot collaborative services according to the remaining time. For example, when the remaining time is greater than 50 microseconds, the data for subsequent time slots is gradually generated and cached; if the remaining time is insufficient, the processing is skipped to reserve time for the services that must be processed. When processing non-real-time services, it is only executed when there is sufficient time. For example, only the key events are retained for logging, and only the throughput or bit error rate is updated for performance statistics. By processing different services with different priorities, it is ensured that time-sensitive tasks are completed strictly on time, and at the same time, the overall processing efficiency is improved by using idle resources. This process optimizes the dynamic allocation of threads and resources, realizes the reasonable scheduling of service processing within limited time slots, and improves the system stability.

[0134] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0135] In a wireless communication base station system, the MAC layer first completes the initialization operation with the physical layer, specifically including establishing a two-way downlink communication channel and configuring a set of physical layer parameters, where the set of physical layer parameters includes subcarrier spacing configuration, time slot format indication, and hybrid automatic repeat request parameters. After the initialization is completed, the MAC layer enters the periodic time slot scheduling state, receives the synchronization signal and the user equipment measurement report uploaded by the physical layer at the beginning of each time slot, and stores the received user equipment data into the pre-allocated circular buffer according to the time slot index.

[0136] When a synchronization signal that requires immediate processing by the physical layer arrives, the MAC layer preferentially generates a corresponding time-slot synchronization response frame and transmits it to the physical layer via a pre-established physical layer interface before the end of the time slot. For scheduling data that requires multi-time-slot collaborative processing, the MAC layer extracts the user equipment channel quality indication cached in the previous time slot from the circular buffer, generates downlink control information for the next two time slots based on historical scheduling information, and stores it in the scheduling queue buffer in timestamp order.

[0137] After processing immediate services, the MAC layer detects the remaining available time in the current time slot. If the remaining time exceeds a preset threshold of 50 microseconds, it starts the non-real-time task processing module. This module extracts the raw performance statistics data to be processed from the log buffer, performs data aggregation operations and then writes it to the persistent storage device, and at the same time clears the historical log files that exceed the retention period.

[0138] Through the above technical solutions, this application effectively solves the technical problem that the MAC layer cannot balance real-time services and non-real-time tasks under strict time-slot constraints. By establishing a multi-level processing priority mechanism, on the basis of ensuring timely response to physical layer synchronization signals, it uses the idle time window between time slots to complete non-critical task processing, thereby improving resource utilization without affecting the system timing accuracy. Further, by separating the pre-generation of multi-time-slot scheduling data from the processing of immediate services, it reduces the peak processing load within a single time slot and enhances the stability of the system in coping with sudden traffic.

[0139] Scenario 2

[0140] In some of the above solutions of this application, a scheduling method for optimizing resource allocation is proposed by distinguishing service categories and determining the target processing time slots. However, in the specific implementation process, the existing steps lack clear definitions of the initialization process, time judgment thresholds, and multi-time-slot linkage processing logic, resulting in difficulties in precisely coordinating the timing relationship between physical layer synchronization and data processing tasks in actual operations, and there are risks of insufficient utilization of remaining time and incoherent connection of cross-time-slot tasks.

[0141] As Figure 3 shown, this application further proposes a resource scheduling method, including the following steps:

[0142] Step 1: According to the industry standard process, the MAC completes the initial configuration of the PHY. After synchronizing with the PHY, it enters the slot scheduling process;

[0143] Step 2: The MAC layer initializes, establishes communication channels with the RLC upwards and the PHY downwards, and the MAC enters the working state;

[0144] Step 3, Processing Procedure 1: Each time slot PHY sends a synchronization signal and UE data to the MAC. The MAC caches the received UE data and sends the synchronization signal and UE data to the PHY;

[0145] Step 4, Determine that the remaining available time of the current time slot is less than 50 microseconds; if so, execute Step 5, if not, execute Step 11;

[0146] Step 5, Processing Procedure 2: Read the UE data in the cache. Update the air interface status and upload the data that needs to be processed by the upper layer to the RLC;

[0147] Step 6, Determine whether there is still UE data in the cache; if so, execute Step 5, if not, execute Step 7;

[0148] Step 7, Determine that the remaining available time of the current time slot is less than 50 microseconds; if so, end, if not, execute Step 11;

[0149] Step 8, Processing Procedure 3: Multi-time slot (for example, 2 time slots) linkage, gradually generate the data that needs to be sent to the UE for each time slot. The generated data is cached locally with the time slot as the index for Step 3 / Step 5 to send to the PHY at the appropriate time slot;

[0150] Step 9, Determine whether there is data to be sent and the time slot does not exceed 2; if so, execute Step 8, if not, execute Step 10;

[0151] Step 10, Determine that the remaining available time of the current time slot is less than 50 microseconds; if so, end, if not, execute Step 11;

[0152] Step 11, Processing Procedure 4: Process non-time-sensitive service data such as logs and performance statistics.

[0153] The process ends.

[0154] Among them, the physical layer synchronization signal processing and the user equipment data transceiver are basic operations that must be executed and are preferentially completed in the initial stage of the time slot. The remaining time judgment uses 50 microseconds as the demarcation threshold for executing elastic tasks, and this value corresponds to the time slot cycle length of a typical wireless communication system. The two-time slot linkage processing ensures the consistency of cross-time slot data through the index caching mechanism. The data generated each time is stored in units of time slots for subsequent scheduling cycles to call. The log and statistical tasks are only triggered when there is sufficient time to avoid affecting the core communication functions.

[0155] Specifically, the method first completes physical layer synchronization and channel establishment to ensure that the basic communication link is available. At the beginning of the time slot, the physical layer interaction data is forcibly processed, including receiving synchronization signals, caching user equipment data and returning the physical layer. This design directly guarantees the accuracy of inter-layer timing synchronization, and thus completes the processing of the corresponding data of the key business mentioned above. The remaining time judgment module monitors the scheduling process in real time. When it is detected that the remaining time is less than 50 microseconds, it immediately terminates non-essential operations to prevent system desynchronization caused by timeout. For tasks that need to be processed across time slots, the two-time slot linkage mechanism is used to generate preliminary data, and the task status is persistently stored through the local cache to ensure that the subsequent time slots can accurately obtain the processing context, thus completing the data processing of important services. When the log and statistical tasks are triggered, the system only calls the idle computing resources for execution, which does not affect the resource allocation of the core communication thread. This step-by-step processing architecture uses a clear timing control logic to pre-execute operations with strict timing requirements and post-process flexible tasks. While ensuring the system synchronization accuracy, it realizes the dynamic utilization of the remaining computing resources, thus completing the data processing of non-time-related services.

[0156] As a preferred embodiment, the solution of the present application is specifically implemented as follows:

[0157] The MAC layer first completes the establishment of communication channels with the RLC layer (Radio Link Control Layer) and the PHY layer, completes the initialization configuration, and achieves time slot synchronization with the PHY layer. After the PHY layer sends the synchronization signal and user equipment data to the MAC layer, the MAC layer stores the received user equipment data in the memory list and immediately feeds back the synchronization signal and pre-generated user equipment data to the PHY layer.

[0158] During the processing, the MAC layer monitors the remaining available time of the current time slot in real time. When the remaining time is less than 50 microseconds, key business processing is performed first: the cached user equipment data is read from the memory list to update the air interface status, and the data to be uploaded to the RLC layer is forwarded. If there is still unprocessed data in the memory list, the processing is executed cyclically until the data is cleared or the remaining time is insufficient.

[0159] When the remaining time is greater than 50 microseconds, the multi-time slot linkage processing mechanism is started. With two time slots as the linkage cycle, the scheduling data to be sent to the user equipment in each time slot is gradually generated and cached locally according to the time slot index. During the generation process, if it is detected that the time slot index does not exceed the linkage range and there is data to be sent, the linkage processing is continuously executed.

[0160] After completing key business and multi-time slot linkage processing, if there is still time left in the current time slot, non-real-time business processing such as logging and performance statistics will be performed. After all business processing is completed, the MAC layer enters the next time slot scheduling process.

[0161] Through the above technical solutions, the present application realizes the dynamic hierarchical processing of emergency services, multi-slot collaborative services, and non-real-time services by the MAC layer within limited scheduling time slots. Through the time threshold judgment mechanism, it preferentially guarantees the processing of key services related to PHY layer synchronization, avoiding the risk of system out-of-step caused by timeout; through the multi-slot linkage mechanism, the tasks that can be postponed are split into subsequent time slots, effectively alleviating the processing pressure of a single time slot; the processing of non-real-time services within the remaining time further improves the system resource utilization rate. While ensuring the time slot synchronization accuracy, this solution enhances the adaptability of the MAC layer to time fluctuation scenarios, and solves the system stability problem caused by single time slot processing timeout in the prior art.

[0162] Scenario 3

[0163] The MAC (Medium Access Control Layer) needs to process multiple service types within a single scheduling cycle, but the single-thread processing method cannot fully utilize the parallel capabilities of a multi-core system, resulting in the remaining time not being effectively utilized and affecting the overall system processing efficiency.

[0164] The present application further proposes to classify services according to time requirements. One category is the services that must be processed in this slot (time slot), another category is the services that can be processed flexibly, and there are also other non-real-time data to be processed. The interaction with the PHY (Physical Layer) interface part must be processed immediately, which includes receiving and saving the reported data in this time slot to the local cache; and sending the synchronization signal to the PHY, as well as the data sent by the PHY to the UE in the next time slot. Other MAC internal processing data has a certain degree of flexibility in time and can be completed within subsequent multiple time slots according to the remaining available time of the MAC. This part of the data includes MAC ce processing, upper layer data forwarding, and data preparation for the UE in subsequent time slots. Flexible data selectively processes some data according to the length of the remaining available processing time of the MAC. When multiple consecutive time slots are busy, the scheduling of UE service data can also be reduced to ensure that the MAC layer maintains strict time slot synchronization with the PHY. Based on the service category division, the MAC subsystem can be split into multi-threaded concurrent processing. Emergency services are services related to the PHY interface and can be treated as a single thread. In addition, time slot-related services are important services and can be processed in another thread. Other non-time slot-related services can start another process, thus better leveraging the advantages of the current multi-core system. After the MAC finishes the scheduling processing of multiple time slots, if there is still remaining time, it can process other non-time-related processing, such as log and performance statistics processing. The multi-slot linkage processing will have some delays on the quality of the radio air interface link, reminding the base station management personnel to actively control whether to start the multi-slot linkage scheduling processing interface.

[0165] Among them, the service classification is divided into three categories according to time sensitivity: emergency services, important services, and non-time-slot-related services. The emergency service thread runs independently with the highest priority; the important service thread processes multi-time-slot data generation and caching operations; the non-time-slot-related service thread starts in the remaining time to process log or statistical tasks. When the remaining time is greater than 50 microseconds, the elastic data processing logic is triggered to select and process some non-critical tasks; if the remaining time is insufficient, the current processing cycle is directly skipped. The multi-time-slot linkage processing supports pre-generating scheduling data for the next two time slots and allocating them to the corresponding time slots for transmission according to the index through the local cache queue.

[0166] Specifically, after the MAC layer processes the emergency services in the current time slot, it checks whether the remaining time meets the threshold condition. If the remaining time is sufficient, the important service thread is started to generate UE transmission data for the next two time slots, and the data is stored in the cache list according to the index. At the same time, the non-time-slot-related service thread periodically scans the remaining time resources and performs logging or performance statistics operations when the conditions are met. When the processing pressure increases continuously in multiple time slots, the system dynamically reduces the generation frequency of UE service data to ensure the time synchronization between the emergency service thread and the PHY layer. The base station management personnel can manually enable or disable the multi-time-slot linkage processing function through the interface to balance the link quality and processing efficiency. This solution ensures that high-priority services strictly meet the time constraints through thread isolation and dynamic resource allocation, while using idle resources to improve the overall throughput.

[0167] As a preferred embodiment, the solution of this application is specifically implemented as follows:

[0168] The services are divided into three categories according to time requirements: the first category is the services that must be processed in this time slot, the second category is the services that can be elastically processed, and the third category is other non-real-time data to be processed. The services interacting with the physical layer interface part must be processed immediately, including receiving and saving the data reported in this time slot to the local cache, sending a synchronization signal to the physical layer, and preparing the data to be sent to the user equipment in the next time slot by the physical layer. Other MAC internal processing data has a certain time elasticity and can be processed within multiple subsequent time slots according to the remaining available time of the MAC. This part of the data includes MAC CE processing, upper-layer data forwarding, and preparing the data to be sent to the user equipment in the subsequent time slots.

[0169] The elastic data selectively processes some data according to the length of the remaining available processing time of the MAC. When multiple time slots are busy continuously, the scheduling of the user equipment service data is reduced to ensure that the MAC layer and the physical layer maintain strict time slot synchronization.

[0170] Based on the business category division, the MAC subsystem is split into multi-threaded concurrent processing. Emergency services, which are related to the physical layer interface, are handled as a separate thread. Time slot-related services, as important services, are processed in another thread. Other non-time slot-related services are processed in another process to fully utilize the advantages of the current multi-core system.

[0171] After MAC finishes scheduling multiple time slots, if there is still remaining time, it processes other non-time-related tasks, such as log and performance statistics processing.

[0172] Multi-time slot linked processing will cause delays to the quality status of the radio air interface link, reminding the base station management personnel to actively control whether to start the multi-time slot linked scheduling processing interface.

[0173] Through the above technical solutions, this application realizes the classification processing and multi-threaded concurrent processing of MAC layer services, improving the processing efficiency of the MAC layer and the utilization rate of system resources. Through the elastic processing mechanism, the processing load between different time slots is balanced, enhancing the stability of the system. The multi-time slot linked processing mechanism enables the MAC layer to more flexibly respond to complex network environments, improving the adaptability of the system. At the same time, by reminding the base station management personnel to control the multi-time slot linked scheduling, the excessive impact on the link quality is avoided, ensuring the controllability of the system performance.

[0174] As Figure 4 shown in

[0175] An acquisition module 410, configured to acquire data to be processed;

[0176] An identification module 420, configured to determine the service category of the data to be processed according to the data attribute of the data to be processed; the service category matches the response time requirement;

[0177] A determination module 430, configured to determine the target processing time slot of the data to be processed according to the service category;

[0178] A scheduling module 440, configured to schedule resources to process the data to be processed in the target processing time slot.

[0179] In this way, in the resource scheduling device provided by this application, the MAC layer classifies the data to be processed according to the response time requirement of the data as needed (for example, divided into emergency services and important services, etc.), and then determines the target processing time slots of these data, and schedules resources within the corresponding time slots to complete data processing, which can ensure that the MAC layer preferentially completes the data processing that must be completed in each time slot, ensuring the precise synchronization between the MAC layer and the PHY layer.

[0180] It should be noted that the specific structures and implementation manners of the above resource scheduling device and its various modules or units can refer to the corresponding descriptions in the above method embodiments, and will not be elaborated here.

[0181] It should be noted that the division manner of each module of the above resource scheduling device is not unique, and will not be specifically limited here either.

[0182] Based on the above embodiments, the present application further provides an electronic device, such as a base station, etc., and its principle block diagram can be as Figure 5 shown. The above electronic device includes a processor, a memory, a network interface, and a display screen connected through a system bus. Among them, the processor of the electronic device is used to provide computing and control capabilities. The memory of the electronic device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a resource scheduling program. The internal memory provides an environment for the operation of the operating system and the resource scheduling program in the non-volatile storage medium. The network interface of the electronic device is used to communicate with an external terminal through a network connection. When the resource scheduling program is executed by the processor, it implements the steps of any of the above resource scheduling methods. The display screen of the electronic device can be a liquid crystal display screen or an electronic ink display screen.

[0183] Those skilled in the art can understand that Figure 5 the principle block diagram shown in

[0184] merely shows the block diagram of some structures related to the solution of the present application, and does not constitute a limitation on the electronic device to which the solution of the present application is applied. The specific electronic device may include more or fewer components than those shown in the figure, or combine some components, or have different component arrangements.

[0185] In an embodiment, an electronic device is provided. The above electronic device includes a memory, a processor, and a resource scheduling program stored on the above memory and executable on the above processor. When the above resource scheduling program is executed by the above processor, it implements the steps of any of the resource scheduling methods provided in the embodiments of the present application.

[0186] It should be understood that the sequence numbers of the above steps do not mean the order of execution. The execution order of each process should be determined according to its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0187] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above-mentioned division of each functional unit and module is used as an example. In actual applications, the above-mentioned functions can be allocated to different functional units and modules according to needs, that is, the internal structure of the above-mentioned device is divided into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiments can be integrated into a processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of a software functional unit. In addition, the specific names of each functional unit and module are only for the convenience of mutual distinction and do not limit the protection scope of this application. The specific working processes of the units and modules in the above-mentioned device can refer to the corresponding processes in the foregoing method embodiments and will not be elaborated herein.

[0188] In the above embodiments, the descriptions of the various embodiments have their own emphases. For the parts not detailed or recorded in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0189] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or by a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of this application.

[0190] In the embodiments provided in this application, it should be understood that the disclosed system / terminal device and method can be implemented in other ways. For example, the above-described system / terminal device embodiments are merely illustrative. For example, the above-mentioned division of modules or units is only a logical functional division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.

[0191] If the above integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, to implement all or part of the processes in the above method embodiments of this application, it can also be completed by a computer program instructing relevant hardware. The above computer program can be stored in a computer-readable storage medium. When the computer program is executed by a processor, the steps of the above method embodiments can be implemented. Among them, the above computer program includes computer program code, and the above computer program code can be in the form of source code, object code, executable file or some intermediate form, etc. The above computer-readable medium can include: any entity or device capable of carrying the above computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disc, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signal, electrical signal, and software distribution medium, etc. It should be noted that the content included in the above computer-readable storage medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction.

[0192] The above embodiments are only used to illustrate the technical solutions of this application, rather than to limit them; although this application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not deviate from the spirit and scope of the technical solutions of the various embodiments of this application, and should all be included in the protection scope of this application.

Claims

1. A resource scheduling method, characterized in that, The method includes: The MAC layer obtains the data to be processed; According to the data attributes of the data to be processed, determine the service category of the data to be processed; the service category matches the response time requirement; According to the service category, determine the target processing time slot of the data to be processed; At the target processing time slot, schedule resources to process the data to be processed.

2. The resource scheduling method according to claim 1, wherein The determining the service category of the data to be processed according to the data attributes of the data to be processed includes: After obtaining the data to be processed, determine the data attributes of the data to be processed; the data attributes include time slot correlation and data interactivity; According to the data attributes of the data to be processed, determine the response time requirement of the data to be processed; According to the response time requirement of the data to be processed, determine the service category of the data to be processed.

3. The resource scheduling method according to claim 2, wherein The determining the response time requirement of the data to be processed according to the data attributes of the data to be processed includes: When the data interactivity is to interact with the PHY layer, determine that the response time requirement of the data to be processed is to be processed in this time slot; When the data interactivity is not to interact with the PHY layer and the time slot correlation is time slot related, determine that the response time requirement of the data to be processed is multi-time slot processing; When the time slot correlation is non-time slot related, determine that the response time requirement of the data to be processed is non-real-time processing.

4. The resource scheduling method according to claim 3, wherein The determining the service category of the data to be processed according to the response time requirement of the data to be processed includes: When the response time requirement is to be processed in this time slot, determine that the service type of the data to be processed is an emergency service; When the response time requirement is multi-time slot processing, determine that the service type of the data to be processed is an important service; When the response time requirement is non-real-time processing, determine that the service type of the data to be processed is a non-time slot related service.

5. The resource scheduling method according to claim 1, wherein The determining the target processing time slot of the data to be processed according to the service category includes: When the service category is an emergency service, determine that the target processing time slot is this time slot; When the service category is an important service, determine that the target processing time slot is multi-time slot linkage; When the service category is a non-time slot related service, determine that the target processing time slot is an idle time slot.

6. The resource scheduling method according to claim 1, wherein The scheduling resources to process the data to be processed at the target processing time slot includes: Obtain the remaining duration of the target processing time slot; If the remaining duration is greater than the duration threshold, schedule resources to process the data to be processed.

7. The resource scheduling method according to claim 1, wherein It further includes: Display a reminder message, which is used to remind whether to start multi-time slot linkage to process the data to be processed.

8. The resource scheduling method according to any one of claims 1 to 7, characterized in that The scheduling resources to process the data to be processed at the target processing time slot includes: According to the service category, determine the target processing thread of the data to be processed; Through the target processing thread, schedule resources to process the data to be processed at the target processing time slot.

9. A resource scheduling device, characterized in that, The device includes: An acquisition module, which is used to acquire the data to be processed; An identification module, which is used to determine the service category of the data to be processed according to the data attributes of the data to be processed; the service category matches the response time requirement; A determination module, configured to determine a target processing time slot of the data to be processed according to the service category; A scheduling module, configured to schedule resources to process the data to be processed at the target processing time slot.

10. An electronic device, characterized in that, The electronic device includes a memory, a processor, and a resource scheduling program stored on the memory and executable on the processor. When the resource scheduling program is executed by the processor, the steps of the resource scheduling method according to any one of claims 1 to 8 are implemented.