Resource scheduling method and device based on high-precision clock deterministic delay
By obtaining the number of kernel resources and using a high-precision clock to determine the delay time, a resource scheduling method is constructed, which solves the problem of low resource utilization in traditional resource scheduling and realizes efficient and accurate kernel resource scheduling.
Patent Information
- Application Number
- CN202510717978.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-30
- Publication Date
- 2025-09-09
AI Technical Summary
Traditional resource scheduling methods fail to effectively utilize kernel resources, resulting in low resource utilization and low scheduling efficiency, and are unable to efficiently schedule the kernel resources required for tasks within the specified time.
By obtaining the number of kernel resources to be scheduled, using a high-precision clock to determine the delay time of resource scheduling, a resource scheduling method is constructed, and resource scheduling is performed according to the method, including adjusting the scheduling method to cope with the idleness and urgency of kernel resources.
It improves resource scheduling efficiency and resource utilization, ensures efficient scheduling of kernel resources within the specified time, and realizes efficient and accurate scheduling of kernel resources.
Smart Images
Figure CN120610796A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of resource scheduling, and in particular to a resource scheduling method and device based on high-precision clock deterministic delay. Background Art
[0002] Deterministic resource scheduling latency is a crucial factor in power sector operating systems. To ensure that each task is responded to and processed within the specified timeframe, effective management of deterministic resource scheduling latency is crucial, ensuring efficient scheduling of the kernel resources required to process each task within the specified timeframe. Traditional approaches typically schedule kernel resources sequentially, dispatching them one by one from the kernel. However, multiple idle resources within the kernel may not be effectively utilized, resulting in low resource utilization. Parallel scheduling is also not possible, leading to low resource scheduling efficiency.
[0003] In summary, the technical problems existing in the relevant technologies need to be improved. Summary of the Invention
[0004] The embodiments of the present invention provide a resource scheduling method and device based on high-precision clock deterministic delay, which effectively improves resource scheduling efficiency and resource utilization.
[0005] In one aspect, an embodiment of the present invention provides a resource scheduling method based on high-precision clock deterministic delay, comprising the following steps:
[0006] Get the number of kernel resources to be scheduled;
[0007] Determining the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled;
[0008] Constructing a first resource scheduling method according to the number of kernel resources to be scheduled and the delay time;
[0009] Resource scheduling is performed according to the first resource scheduling method.
[0010] In some embodiments, determining the resource scheduling delay time by a high-precision clock according to the number of kernel resources to be scheduled includes:
[0011] Measuring the current time by means of the high-precision clock;
[0012] Determining the time required to schedule the kernel resources according to the number of kernel resources to be scheduled;
[0013] The resource scheduling delay time is calculated according to the current time and the time required for scheduling the kernel resources.
[0014] In some embodiments, constructing a first resource scheduling method according to the number of kernel resources to be scheduled and the delay time includes:
[0015] Determine a time period for resource scheduling based on the current time and the delay time;
[0016] The first resource scheduling method is constructed according to the number of core resources to be scheduled, the number of idle resources of the cores in the time period, the total number of cores with idle resources in the time period, and the idle resource utilization rate.
[0017] In some embodiments, performing resource scheduling according to the first resource scheduling method includes:
[0018] According to the first resource scheduling mode, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a first resource scheduling result, and the target kernel has idle resources within the resource scheduling time period;
[0019] If the first resource scheduling result is a scheduling failure, a warning message indicating a lack of kernel resources is generated, and the first resource scheduling method is adjusted to obtain a second resource scheduling method;
[0020] According to the second resource scheduling mode, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a second resource scheduling result.
[0021] In some embodiments, adjusting the first resource scheduling mode to obtain a second resource scheduling mode includes:
[0022] The second resource scheduling mode is constructed according to the resource scheduling mode data before adjustment, the number of unscheduled core resources, the duration of the resource scheduling time period and the total number of cores with idle resources in the time period.
[0023] In some embodiments, determining the resource scheduling delay time using a high-precision clock based on the number of kernel resources to be scheduled further includes:
[0024] After calculating the resource scheduling delay time, the resource scheduling delay time is updated according to the urgency level of calling the number of kernel resources to be scheduled.
[0025] In some embodiments, the expression of the first resource scheduling mode is:
[0026]
[0027] Where Y is the number of core resources to be scheduled, N is the total number of cores with idle resources in the time period, and α n is the weight of the number of idle resources in the nth core, Y n is the amount of idle resources in the kernel during the time period, μ n is the idle resource utilization rate.
[0028] In some embodiments, the second resource scheduling mode is expressed as:
[0029]
[0030] Where Y ′ is the resource scheduling mode data after adjustment, Y0 is the resource scheduling mode data before adjustment, W is the number of unscheduled core resources, T is the duration of the resource scheduling time period, and N is the total number of cores with idle resources in the time period.
[0031] On the other hand, an embodiment of the present invention provides a resource scheduling device based on high-precision clock deterministic delay, including:
[0032] The acquisition module is used to obtain the number of kernel resources to be scheduled;
[0033] A delay time determination module, configured to determine the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled;
[0034] A resource scheduling mode construction module, configured to construct a first resource scheduling mode according to the number of kernel resources to be scheduled and the delay time;
[0035] The resource scheduling module is used to perform resource scheduling according to the first resource scheduling method.
[0036] In another aspect, an embodiment of the present invention provides a computer device, comprising:
[0037] at least one processor;
[0038] at least one memory for storing at least one program;
[0039] When the at least one program is executed by the at least one processor, the at least one processor implements the method.
[0040] On the other hand, an embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described above is implemented.
[0041] The beneficial effects of the present invention are as follows:
[0042] The embodiment of the present invention first obtains the number of kernel resources to be scheduled, and then determines the delay time of resource scheduling through a high-precision clock based on the number of kernel resources to be scheduled, and then constructs a first resource scheduling method based on the number of kernel resources to be scheduled and the delay time, and finally performs resource scheduling according to the first resource scheduling method, so that resource scheduling can be achieved through the delay time and resource scheduling method, thereby improving resource scheduling efficiency and resource utilization.
[0043] Other features and advantages of the present invention will be described in the following description, and in part will become apparent from the description, or will be understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained through the structures particularly pointed out in the description and the drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0044] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.
[0045] Figure 1 This is a flow chart of a resource scheduling method based on high-precision clock deterministic delay according to an embodiment of the present invention;
[0046] Figure 2 This is a structural diagram of a resource scheduling device based on high-precision clock deterministic delay according to an embodiment of the present invention;
[0047] Figure 3 The figure is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION
[0048] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of the present application. They are merely examples of devices and methods consistent with some aspects of the embodiments of the present application as detailed in the appended claims.
[0049] It will be understood that the terms "first", "second", etc. used in this application may be used herein to describe various concepts, but unless otherwise specified, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another. For example, without departing from the scope of the embodiments of the present application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the words "if" and "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".
[0050] The terms "at least one", "plurality", "each", "any", etc. used in this application include "at least one", "two" or more, "plurality" or "each", "any" or "any one", "each" or "any one" in the context of the present invention, and "at least one" or "at least one" includes one, two or more, "plurality" or "any one" includes two or more, "each" or "each one" in the context of the present invention, and "any" or "any one
[0051] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application pertains. The terms used herein are for the purpose of describing the embodiments of this application only and are not intended to limit this application.
[0052] Before explaining the embodiments of the present application in detail, some of the nouns and terms involved in the embodiments of the present application are first explained. The nouns and terms involved in the embodiments of the present application are subject to the following explanations.
[0053] High-precision clock: A clock device that can provide high-precision time measurement and timing functions, and can provide accurate time information.
[0054] In the related art, the deterministic delay of resource scheduling is an important factor that cannot be ignored in operating systems in the power sector. To ensure that each task can receive a corresponding response and processing within the specified time, it is necessary to effectively manage the deterministic delay of resource scheduling and efficiently schedule the core resources required to process each task within the specified time. In related existing technical solutions, the core resources required to process the tasks are usually scheduled sequentially. There is a lack of a specific resource scheduling method for the core resources required to process the tasks, resulting in a lack of consideration for scheduling based on the actual situation of the core resources. The scheduling efficiency of the required core resources is low, and it is often difficult to efficiently and accurately schedule the core resources required to process the tasks within the specified time. At the same time, sequential scheduling can only schedule the core resources from the core one by one, and will not schedule two or more core resources from the core at the same time. It is impossible to schedule the resources in the core according to the specific resource scheduling method, resulting in low resource scheduling efficiency. In addition, multiple idle resources may exist in the core, which cannot be effectively utilized, resulting in low resource utilization. An example of the actual situation of core resources can be: when there are two or more idle resources in the core, the two or more idle resources in the core can be scheduled simultaneously based on the time when the two or more idle resources exist in the core.
[0055] In view of this, an embodiment of the present invention obtains the number of kernel resources to be scheduled, determines the resource scheduling delay time using a high-precision clock, and constructs a first resource scheduling method based on the number of kernel resources to be scheduled and the delay time to perform resource scheduling. This embodiment of the present invention can implement resource scheduling through the delay time and resource scheduling method, thereby improving resource scheduling efficiency and resource utilization.
[0056] The resource scheduling method based on high-precision clock deterministic delay provided in the embodiment of the present application relates to the field of resource scheduling technology. The resource scheduling method based on high-precision clock deterministic delay provided in the embodiment of the present application can be applied to a terminal, can also be applied to a server, and can also be software running in a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, and a car terminal, etc., but is not limited to this; the server side can be configured as an independent physical server, or as a server cluster or distributed system composed of multiple physical servers, or as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. The server can also be a node server in a blockchain network; the software can be an application that implements a resource scheduling method based on high-precision clock deterministic delay, etc., but is not limited to the above forms.
[0057] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, and the like. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, and the like that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments in which tasks are performed by remote processing devices connected via a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media, including storage devices.
[0058] The following is a detailed explanation of the embodiments of the present application with reference to the accompanying drawings:
[0059] Figure 1 This is an optional flowchart of a resource scheduling method based on high-precision clock deterministic delay provided in an embodiment of the present application. Figure 1 The method may include but is not limited to steps S101 to S104.
[0060] Step S101: Obtain the number of kernel resources to be scheduled;
[0061] Step S102: Determine the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled;
[0062] Step S103: construct a first resource scheduling method according to the number of kernel resources to be scheduled and the delay time;
[0063] Step S104: Perform resource scheduling according to the first resource scheduling method.
[0064] Steps S101 to S104 shown in the embodiment of the present application implement resource scheduling and improve resource scheduling efficiency and resource utilization.
[0065] In step S101 of some embodiments, the number of kernel resources to be scheduled may be obtained through a resource scheduling request, or may be obtained through other methods, without limitation.
[0066] In some embodiments, in step S102, determining the resource scheduling delay time by using a high-precision clock according to the number of kernel resources to be scheduled may include but is not limited to the following steps:
[0067] Measure the current time via a high-precision clock;
[0068] Determine the time required to schedule kernel resources based on the number of kernel resources to be scheduled;
[0069] Calculate the resource scheduling delay based on the current time and the time required to schedule kernel resources.
[0070] In some embodiments, the current time can be measured using a high-precision clock. The time required to schedule the kernel resources is then determined based on the number of kernel resources to be scheduled. The resource scheduling delay is then calculated based on the current time and the time required to schedule the kernel resources. For example, the time required to schedule the kernel resources can be added to the current time to obtain the delay time after the current time.
[0071] In some embodiments, in step S102, determining the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled further includes:
[0072] After calculating the resource scheduling delay time, the resource scheduling delay time is updated according to the urgency level of the number of kernel resources to be scheduled.
[0073] In some embodiments, after calculating the delay time of resource scheduling, the delay time of resource scheduling can be updated according to the urgency level of the number of kernel resources to be scheduled. Exemplarily, the delay time of the time for scheduling the number of kernel resources to be scheduled can be determined and updated based on the urgency level of the number of kernel resources to be scheduled. It is understandable that the higher the urgency level of the number of kernel resources to be scheduled, the shorter the delay time of the kernel resources to be scheduled relative to the current time, which can ensure that the kernel resources to be scheduled urgently can be quickly scheduled, so that the instructions of the kernel resources to be scheduled urgently can be quickly processed and responded to. Furthermore, the time required for the emergency call corresponding to the urgency level can be confirmed based on the urgency level of the number of kernel resources to be scheduled. The time required for the emergency call can be superimposed on the current time to obtain the delay time of the resource scheduling delayed by the current time.
[0074] In some embodiments, in step S103, a first resource scheduling method is constructed based on the number of kernel resources to be scheduled and the delay time, which may include but is not limited to the following steps:
[0075] Determine the time period for resource scheduling based on the current time and delay time;
[0076] A first resource scheduling method is constructed according to the number of core resources to be scheduled, the number of idle resources of the cores in the time period, the total number of cores with idle resources in the time period, and the idle resource utilization rate.
[0077] In some embodiments, the time period for resource scheduling can be determined based on the current time and the delay time, that is, the time period between the current time and the delay time. In order to efficiently and quickly set the resource scheduling method and further improve the scheduling efficiency of kernel resources, a first resource scheduling method can be constructed based on the number of kernel resources to be scheduled, the number of idle resources of the kernel in the time period, the total number of kernels with idle resources in the time period, and the idle resource utilization rate. The expression of the first resource scheduling method is: Where Y is the number of core resources to be scheduled, N is the total number of cores with idle resources in the time period between the current time and the delay time, and α n is the weight of the number of idle resources in the nth core, α n ≠0, Y n is the number of idle resources of the nth core in the time period between the current time and the delay time, μ n is the idle resource utilization of the nth core, n represents the nth core with idle resources in the time period between the current time and the delay time, n is a positive integer, N is a positive integer, 1≤n≤N, lim{·} represents the limit, ∞ represents infinity, and sin(·) represents the sine function.
[0078] In some embodiments, in step S104, resource scheduling is performed according to the first resource scheduling method, which may include but is not limited to the following steps:
[0079] According to the first resource scheduling mode, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a first resource scheduling result, where the target kernel has idle resources within the resource scheduling time period;
[0080] If the first resource scheduling result is scheduling failure, a warning message indicating lack of kernel resources is generated, and the first resource scheduling method is adjusted to obtain a second resource scheduling method;
[0081] According to the second resource scheduling method, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a second resource scheduling result.
[0082] In some embodiments, a first resource scheduling method can be used to schedule the number of kernel resources to be scheduled from at least one target kernel before a delay time, thereby obtaining a first resource scheduling result, wherein the target kernel has idle resources within the resource scheduling time period. If the first resource scheduling result indicates a scheduling failure, meaning that the number of kernel resources to be scheduled cannot be scheduled from at least one kernel that has idle resources between the current time and the delay time before the delay time, a kernel resource shortage warning message can be generated to promptly determine whether the kernel resources to be scheduled can be scheduled within the time period between the current time and the delay time, so as to quickly handle the situation when idle resources in the kernel are insufficient and avoid unmanageable emergencies. Furthermore, a request to extend the delay time can be generated. The first resource scheduling method is then adjusted to obtain a second resource scheduling method. Exemplarily, in order to provide feedback on the number of core resources that have not been scheduled to be scheduled from at least one core with idle resources in the time period between the current time and the delay time before the delay time, so that the resource scheduling method can be adjusted in a timely manner and the efficiency of core resource scheduling in the time period between the current time and the delay time can be further improved, feedback information indicating the need to adjust the resource scheduling method can be issued, and the first resource scheduling method can be adjusted to obtain a second resource scheduling method. Then, based on the second resource scheduling method, the number of core resources to be scheduled is scheduled from at least one target core before the delay time, obtaining a second resource scheduling result to implement resource scheduling.
[0083] In some embodiments, adjusting the first resource scheduling mode to obtain the second resource scheduling mode includes:
[0084] A second resource scheduling method is constructed based on the resource scheduling method data before adjustment, the number of unscheduled core resources, the duration of the resource scheduling time period, and the total number of cores with idle resources in the time period.
[0085] In some embodiments, to achieve precise adjustment of the resource scheduling method, according to the first resource scheduling method, if the number of core resources to be scheduled is not scheduled from at least one core with idle resources in the time period between the current time and the delay time before the delay time, a second resource scheduling method can be constructed based on the resource scheduling method data before adjustment, the number of unscheduled core resources, the length of the resource scheduling time period, and the total number of cores with idle resources in the time period. The expression of the second resource scheduling method is: Where Y ′is the resource scheduling mode data after adjustment, Y0 is the resource scheduling mode data before adjustment, W is the number of unscheduled core resources, T is the length of the resource scheduling time period, that is, the length of the time period between the current time and the delay time, N is the total number of cores with idle resources in the time period, N≥1, and N is a positive integer.
[0086] The beneficial effects of implementing the embodiments of the present invention include: the embodiments of the present invention first obtain the number of kernel resources to be scheduled, then determine the resource scheduling delay time based on the number of kernel resources to be scheduled using a high-precision clock, then construct a first resource scheduling method based on the number of kernel resources to be scheduled and the delay time, and finally perform resource scheduling based on the first resource scheduling method, thereby enabling resource scheduling to be achieved through the delay time and resource scheduling method, thereby improving resource scheduling efficiency and resource utilization. At the same time, this embodiment sets the corresponding resource scheduling method based on the actual situation of idle resources in the kernel, can efficiently and accurately schedule kernel resources, and uses high-precision clock measurement to measure and display time, thereby effectively controlling the resource scheduling time and being able to efficiently and accurately schedule the kernel resources to be scheduled within the deterministic delay time period.
[0087] like Figure 2 As shown, an embodiment of the present invention further provides a resource scheduling device based on high-precision clock deterministic delay, comprising:
[0088] The acquisition module 801 is used to obtain the number of kernel resources to be scheduled;
[0089] The delay time determination module 802 is used to determine the resource scheduling delay time through a high-precision clock according to the number of kernel resources to be scheduled;
[0090] The resource scheduling mode construction module 803 is used to construct a first resource scheduling mode according to the number of kernel resources to be scheduled and the delay time;
[0091] The resource scheduling module 804 is configured to perform resource scheduling according to a first resource scheduling method.
[0092] The contents of the above method embodiments are all applicable to the present device embodiments. The functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0093] In some embodiments, a resource scheduling device based on high-precision clock deterministic delay provided by an embodiment of the present invention also includes: a delay time extension application module, which is used to generate a warning message of kernel resource shortage and issue a request to extend the delay time if the number of kernel resources to be scheduled cannot be scheduled from at least one kernel with idle resources in the time period between the current time and the delay time before the delay time.
[0094] In some embodiments, a resource scheduling device based on high-precision clock deterministic delay provided by an embodiment of the present invention also includes: a feedback module for generating feedback information that requires adjustment of the resource scheduling method if, according to the resource scheduling method, the number of core resources to be scheduled is not scheduled from at least one core with idle resources in the time period between the current time and the delay time before the delay time.
[0095] In some embodiments, a resource scheduling device based on high-precision clock deterministic delay provided by an embodiment of the present invention also includes: a determination module for determining the delay time of scheduling the number of kernel resources to be scheduled relative to the current time based on the urgency level of calling the number of kernel resources to be scheduled.
[0096] It should be noted that the device embodiments described above are merely schematic, wherein the modules described above as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed across multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment. In addition, in the drawings of the device embodiments provided in this application, the connection relationship between the modules indicates that there is a communication connection between them, which can be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art can understand and implement it without inventive work. The above schematic diagram is merely an example of a resource scheduling device based on high-precision clock deterministic delay, and does not constitute a limitation on a resource scheduling device based on high-precision clock deterministic delay. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components.
[0097] Based on the above method embodiment, Figure 3 As shown, an embodiment of the present invention further provides a computer device, including:
[0098] at least one processor 901;
[0099] At least one memory 902, configured to store at least one program;
[0100] When at least one program is executed by at least one processor, the at least one processor implements Figure 1 The method shown.
[0101] The contents of the above method embodiments are all applicable to the present device embodiments. The functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0102] For example, in this embodiment, the computer program may be divided into one or more modules, which are stored in the memory and executed by the processor to implement the present application. The one or more module elements may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the computer program in the device.
[0103] The computer device may be a desktop computer, notebook computer, PDA, cloud server, etc. The device may include, but is not limited to, a processor and memory.
[0104] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor. The processor is the control center of the device and connects the various parts of the device using various interfaces and lines.
[0105] The above-mentioned memory can be used to store the above-mentioned computer programs and / or modules. The above-mentioned processor realizes various functions of the above-mentioned device by running or executing the computer programs and / or modules stored in the above-mentioned memory, and calling the data stored in the memory. The above-mentioned memory can mainly include a program storage area and a data storage area, wherein the program storage area can store operating devices, at least one application required for a function, etc.; in addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.
[0106] Based on the above method embodiment, the embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, Figure 1 The method shown.
[0107] The contents of the above method embodiments are all applicable to the present storage medium embodiment. The functions specifically implemented by the present storage medium embodiment are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0108] In this embodiment, the storage medium is a computer-readable storage medium, and the computer program includes computer program code, which may be in source code form, object code form, an executable file, or some intermediate form. The computer-readable medium may include any entity or device capable of carrying the computer program code, a recording medium, a USB flash drive, a mobile hard drive, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM), a random access memory (RAM), an electrical carrier signal, a telecommunications signal, and a software distribution medium.
[0109] In the above-mentioned embodiment of the present application, the enterprise's intranet and intranet are integrated, so that internal staff participating in the enterprise's intranet project can obtain external network information related to the enterprise's intranet project by simply logging into the enterprise's intranet, and can obtain relevant information about the enterprise's intranet project very conveniently; by setting up external network information access accounts for internal staff participating in the enterprise's intranet project to access project-related external network information, and setting different external network information access permissions for different external network information access accounts, internal staff participating in the enterprise's intranet project can conveniently and accurately obtain relevant external network information of the enterprise's intranet project in which they participate.
[0110] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but are not intended to limit the scope of the present invention. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present invention should be within the scope of the present invention.
Claims
1. A resource scheduling method based on high-precision clock deterministic delay, characterized in that: The following steps are involved: Get the number of kernel resources to be scheduled; Determining the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled; Constructing a first resource scheduling method according to the number of kernel resources to be scheduled and the delay time; Resource scheduling is performed according to the first resource scheduling method.
2. The method according to claim 1, characterized in that The method of determining the resource scheduling delay time by using a high-precision clock according to the number of kernel resources to be scheduled includes: Measuring the current time by means of the high-precision clock; Determining the time required to schedule the kernel resources according to the number of kernel resources to be scheduled; The resource scheduling delay time is calculated according to the current time and the time required for scheduling the kernel resources.
3. The method according to claim 2, characterized in that The constructing a first resource scheduling method according to the number of kernel resources to be scheduled and the delay time includes: Determine a time period for resource scheduling based on the current time and the delay time; The first resource scheduling method is constructed according to the number of core resources to be scheduled, the number of idle resources of the cores in the time period, the total number of cores with idle resources in the time period, and the idle resource utilization rate.
4. The method according to claim 3, characterized in that The performing resource scheduling according to the first resource scheduling mode includes: According to the first resource scheduling mode, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a first resource scheduling result, and the target kernel has idle resources within the resource scheduling time period; If the first resource scheduling result is a scheduling failure, a warning message indicating a lack of kernel resources is generated, and the first resource scheduling method is adjusted to obtain a second resource scheduling method; According to the second resource scheduling mode, before the delay time, the number of kernel resources to be scheduled is scheduled from at least one target kernel to obtain a second resource scheduling result.
5. The method according to claim 4, characterized in that The adjusting the first resource scheduling mode to obtain a second resource scheduling mode includes: The second resource scheduling mode is constructed according to the resource scheduling mode data before adjustment, the number of unscheduled core resources, the duration of the resource scheduling time period and the total number of cores with idle resources in the time period.
6. The method according to claim 2, characterized in that The method further includes determining the resource scheduling delay time by using a high-precision clock according to the number of kernel resources to be scheduled: After calculating the resource scheduling delay time, the resource scheduling delay time is updated according to the urgency level of calling the number of kernel resources to be scheduled.
7. The method according to claim 3, characterized in that The expression of the first resource scheduling method is: Where Y is the number of core resources to be scheduled, N is the total number of cores with idle resources in the time period, and α n is the weight of the number of idle resources in the nth core, Y n is the amount of idle resources in the kernel during the time period, μ n is the idle resource utilization rate.
8. The method according to claim 5, characterized in that The expression of the second resource scheduling mode is: Where Y ′ is the resource scheduling mode data after adjustment, Y0 is the resource scheduling mode data before adjustment, W is the number of unscheduled core resources, T is the duration of the resource scheduling time period, and N is the total number of cores with idle resources in the time period.
9. A resource scheduling device based on high-precision clock deterministic delay, characterized in that: include: The acquisition module is used to obtain the number of kernel resources to be scheduled; A delay time determination module, configured to determine the resource scheduling delay time using a high-precision clock according to the number of kernel resources to be scheduled; A resource scheduling mode construction module, configured to construct a first resource scheduling mode according to the number of kernel resources to be scheduled and the delay time; The resource scheduling module is used to perform resource scheduling according to the first resource scheduling method.
10. A computer device, characterized in that: include: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 8.