WO2024160136A1

WO2024160136A1 - Task scheduling method and apparatus, and electronic device

Info

Publication number: WO2024160136A1
Application number: PCT/CN2024/074173
Authority: WO
Inventors: 柯锦玲
Original assignee: 维沃移动通信有限公司
Priority date: 2023-01-30
Filing date: 2024-01-26
Publication date: 2024-08-08
Also published as: CN115964180A

Abstract

Disclosed in the present application are a task scheduling method and apparatus, and an electronic device, which are applied in the technical field of communications. The method comprises: when a first task acquires a key lock, acquiring parameter information of the first task; and when the parameter information satisfies a preset condition, running the first task, wherein the parameter information satisfying the preset condition comprises: the parameter information comprising target identification information.

Description

Task scheduling method, device and electronic equipment

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the priority of the Chinese patent application filed with the China Patent Office on January 30, 2023, with application number 202310067875.2 and invention name “Task Scheduling Method, Device and Electronic Device”. The entire contents of the Chinese patent application are incorporated herein by reference.

Technical Field

The present application belongs to the field of communication technology, and more specifically, relates to a task scheduling method, device and electronic equipment.

Background Art

With the continuous development of science and technology, electronic devices have more and more functions, and more and more applications are resident in the background of electronic devices. Usually, when there are many programs running at the same time, the system can adjust resources according to the scheduling priority in the resource scheduling strategy. For example, when a user uses a mobile phone to browse WeChat Moments in the foreground, there are still many applications running in the background of the mobile phone, such as QQ receiving messages in the background, Thunder downloading movies in the background, etc. The current system's resource scheduling strategy will give priority to the operation of the foreground application, that is, the foreground application can obtain resources first, such as giving priority to running WeChat in the foreground on the large core of the CPU and increasing its scheduling priority, while the background application will limit the acquisition of resources, such as limiting the background QQ or Thunder to run on the small core of the CPU and lowering its scheduling priority.

However, adopting this resource scheduling strategy will greatly aggravate the occurrence of priority inversion problem, that is, extremely high priority tasks cannot run because they are blocked by low priority tasks. The low priority tasks need to be run first to release the system lock before high priority tasks can run, thus causing system lag problems.

Summary of the invention

The purpose of the embodiments of the present application is to provide a task scheduling method, device and electronic device, which can solve the problem of system freeze caused by priority inversion in the related art.

In a first aspect, an embodiment of the present application provides a task scheduling method, the method comprising: when a first task obtains a critical lock, obtaining parameter information of the first task; when the parameter information satisfies a preset condition, running the first task, wherein the parameter information satisfies the preset condition including: the parameter information includes target identification information.

In a second aspect, an embodiment of the present application provides a task scheduling device, comprising: an acquisition module, used to acquire parameter information of the first task when the first task acquires a key lock; a control module, used to run the first task when the parameter information meets a preset condition, wherein the parameter information meets the preset condition including: the parameter information includes target identification information.

In a third aspect, an embodiment of the present application provides an electronic device, which includes a processor and a memory, wherein the memory stores programs or instructions that can be run on the processor, and when the program or instructions are executed by the processor, the steps of the method described in the first aspect are implemented.

In a fourth aspect, an embodiment of the present application provides a readable storage medium, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the steps of the method described in the first aspect are implemented.

In a fifth aspect, an embodiment of the present application provides a chip, comprising a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run a program or instruction to implement the method described in the first aspect.

In a sixth aspect, an embodiment of the present application provides a computer program product, which is stored in a storage medium and is executed by at least one processor to implement the method described in the first aspect.

In the embodiment of the present application, by setting a key lock, it can be ensured that only one task obtains the key lock at the same time, so that when multiple tasks are running at the same time, the multiple tasks can be run in order of the time of obtaining the key lock, thereby avoiding the problem of system congestion. By obtaining the parameter information of the first task when the first task obtains the key lock, and when the parameter information meets the preset conditions, In this case, when the first task is run, the first task with the target identification information can be run first, thereby shortening the waiting time for the first task to run and avoiding the problem of system freeze caused by priority inversion in the related art.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG1 is a flow chart of a task scheduling method provided in an embodiment of the present application;

FIG2 is a schematic flow chart of an example of the present application;

FIG3 is a schematic flow chart of another example of the present application;

FIG4 is a schematic flow chart of another example of the present application;

FIG5 is a schematic diagram of a task scheduling device according to an embodiment of the present application;

FIG6 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application;

FIG. 7 is a schematic diagram of the hardware structure of an electronic device provided in another embodiment of the present application.

DETAILED DESCRIPTION

The following will be combined with the drawings in the embodiments of the present application to clearly describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field belong to the scope of protection of this application.

The terms "first", "second", etc. in the specification and claims of this application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than those illustrated or described here, and the objects distinguished by "first", "second", etc. are generally of one type, and the number of objects is not limited. For example, the first object can be one or more. In addition, "and/or" in the specification and claims represents at least one of the connected objects, and the character "/" generally indicates that the objects associated with each other are in an "or" relationship.

The task scheduling method provided in the embodiment of the present application is described in detail below through specific embodiments and their application scenarios in conjunction with the accompanying drawings.

As shown in FIG. 1 , a task scheduling method is provided in an embodiment of the present application. The method includes the following steps 101 to 102 , which are described in detail below.

Step 101: When a first task obtains a key lock, obtain parameter information of the first task.

Step 102: When the parameter information meets a preset condition, execute the first task.

In this embodiment, in the system of the electronic device, there are often situations where multiple tasks are running at the same time. For example, in the process of playing games with a mobile phone, the game application is running in the foreground, and at the same time, there may also be "settings" applications, "music" applications, "file management" and other applications running in the background. However, due to the limitations of some hardware resources of the electronic device, for example, there is only one UFS memory for storing data in the mobile phone, resulting in that when multiple tasks call system resources, only one task can call at the same time. Among them, the key lock can be set at the entrance of the call data to ensure that only one task reads the system resources at the same time. In other words, there is only one task that obtains the key lock at the same time.

After the key lock is set at the entrance of the call data, when multiple tasks need to obtain system resources, since only one task obtains the key lock at the same time, the multiple tasks are sequentially obtained in chronological order. Moreover, after any of the multiple tasks obtains the key lock, it indicates that the task enters the critical area of waiting to run or running, and the system resources corresponding to the task are occupied. Usually, the task that obtains the key lock earlier will run before the task that obtains the key lock later, so that the multiple tasks can run in the order of the time of obtaining the key lock.

If it is necessary to run a task among the multiple tasks in priority, when the task obtains the key lock, the task can be marked by the target identification information, and the target identification information is used as one of the parameter information of the task. Among them, the target identification information can be used to indicate that the corresponding task is a special task. For example, the target identification information can be a special character, and the special task that needs to be run in priority is marked by the special character. Those skilled in the art should understand that the target identification information is not specifically limited here.

When the first task obtains the key lock, parameter information of the first task is obtained. If the target identification information is included in the parameter information, it is determined that the first task is a special task that meets the preset condition. If the target identification information is not included in the parameter information, it is determined that the first task does not meet the preset condition. The first task is any one of the multiple tasks.

When it is determined that the first task is a special task that meets the preset condition, the first task is executed on the CPU, and other high-priority tasks are prohibited from executing.

For example, if Task 1 and Task 2 obtain the key lock in chronological order, and if neither Task 1 nor Task 2 is marked with identification information, Task 1 and Task 2 will be run in the order of the time of obtaining the key lock. If Task 2 is a special task marked with special characters, when Task 2 obtains the key lock with identification information, Task 2 will be run before Task 1.

According to the embodiment of the present application, by setting a key lock, it can be ensured that only one task obtains the key lock at the same time, so that when multiple tasks are running at the same time, the multiple tasks can be run in order of the time of obtaining the key lock, thereby avoiding the problem of system congestion. By obtaining the parameter information of the first task when the first task obtains the key lock, and running the first task when the parameter information meets the preset conditions, the first task with the target identification information can be run first, thereby shortening the waiting time for the first task to run, and avoiding the problem of system jams caused by priority inversion in the related art.

In one embodiment, in order to avoid the problem that a special task runs for a long time and causes other tasks to fail to run normally, thereby reducing the user experience, the embodiment of the present application also provides a method for controlling task scheduling based on the identification duration of target identification information. That is, when the parameter information includes the target identification information, the parameter information also satisfies the preset condition that: the identification duration of the target identification information is less than or equal to the preset duration.

In this embodiment, when multiple tasks acquire a key lock, a special task among them can be marked with target identification information, and the identification time of the special task marked with the target identification information can be recorded. In addition, the identification time can be associated with the corresponding target identification information.

When the first task obtains the key lock, the parameter information of the first task is obtained, and it is first determined whether the parameter information of the first task includes the target identification information. If the parameter information of the task includes target identification information, it is determined whether the identification duration of the target identification information is less than or equal to the preset duration. If the identification duration of the target identification information is less than or equal to the preset duration, it is determined that the parameter information meets the preset condition, and other high-priority tasks are prohibited from running, and the first task is run.

According to an embodiment of the present application, by including target identification information in the parameter information, the parameter information satisfies the preset condition and also includes: the identification duration of the target identification information is less than or equal to the preset duration, thereby avoiding the impact of long-term running of a special task on the running of other tasks, thereby affecting the running speed of the system and reducing the user experience.

In one embodiment, after obtaining the parameter information of the first task, the method further includes:

Step 201: if the parameter information does not satisfy the preset condition and there is a second task with a higher priority than the first task, run the second task; wherein the parameter information not satisfying the preset condition includes one of the following: the parameter information does not include the target identification information, the parameter information includes the target identification information but the identification duration of the target identification information is greater than the preset duration;

Step 202: After the second task exits execution, the first task is executed.

In this embodiment, when the target identification information is not included in the parameter information of the first task, or when the target identification information is included in the parameter information but the identification duration of the target identification information is greater than the preset duration, it is determined that the parameter information of the first task does not meet the preset conditions.

When the parameter information of the first task does not meet the preset condition and there is a second task with a higher priority than the first task, the second task is run. When the second task is run, the first task is in a waiting state. After the second task exits the run, the first task is run.

For example, the time when task 2 acquires the key lock is earlier than the time when task 1 acquires the key lock, that is, the priority of task 2 is higher than the priority of task 1. In addition, the parameter information of task 1 does not include the target identification information, or the parameter information of task 1 includes the target identification information but the target identification information is not specified. The duration of the task is longer than the preset duration. In this case, the parameter information of task 1 does not meet the set conditions. According to the priority order, task 2 is run first, and task 1 is run after task 2 is completed and exits.

According to an embodiment of the present application, when the parameter information of the first task does not meet the set conditions and there is a second task with a higher priority than the first task, the second task is run, and after the second task exits, the first task is run, which can avoid the problem of system freeze caused by multi-task running conflicts.

In one embodiment, in order to improve the operating speed of the system and reduce the power consumption of the system, the embodiment of the present application also sets a condition for triggering the acquisition of the parameter information of the first task. That is, when the first task acquires the key lock, the parameter information of the first task is acquired, including:

Step 301: When the first task obtains a key lock and the first task occupies system resources, obtain parameter information of the first task;

Step 302: When the first task obtains the critical lock and the third task occupies the system resources, wait for the first task to be awakened, and when the first task is awakened, obtain parameter information of the first task; wherein the first task is awakened when the third task releases the system resources.

In this embodiment, two conditions are set to trigger the acquisition of parameter information of the first task:

Condition 1: When the first task obtains the critical lock and the first task occupies system resources, parameter information of the first task is obtained.

When the first task obtains the critical lock and the first task does not occupy system resources, it indicates that the first task may be blocked. At this time, whether the parameter information of the first task meets the preset conditions is not detected.

When the first task obtains the critical lock and occupies system resources, it is necessary to determine whether the first task is a special task that meets the preset conditions, and then determine the priority order of the first task and other tasks that need to be run. That is, the parameter information of the first task is obtained to detect whether the parameter information of the first task meets the preset conditions.

Condition 2: The first task acquires the critical lock and the third task occupies the system resources In the case where the first task is awakened, wait for the first task to be awakened, and when the first task is awakened, obtain parameter information of the first task; wherein the first task is awakened when the third task releases the system resources.

The second condition is for the case where the first task obtains the critical lock and the third task occupies system resources. In this case, the operation of the first task may be blocked. For example, the first task is a lock nested structure. Before running the first task, it is necessary not only to obtain the critical lock as an outer lock, but also to obtain the inner lock used to lock the system resources it allocates. After the first task obtains the critical lock, the inner lock is occupied by the third task and cannot be obtained. In this case, the operation of the first task is blocked.

In the case where the running of the first task is blocked, other tasks are run first according to the priority order, and the first task is in a sleep state waiting to be awakened. Among them, the other tasks include the third task. After the third task is completed and exits the running, the internal lock is released. At this time, the first task is awakened, and the first task can obtain the internal lock, and then occupy the system resources. In the case where the first task occupies the system resources, the parameter information of the first task is obtained to detect whether the parameter information of the first task meets the preset condition.

According to the embodiment of the present application, by further setting the conditions for triggering the acquisition of the parameter information of the first task, the system operation speed can be improved and the system power consumption can be reduced. In addition, when the first task is blocked, other tasks are run first, and when the third task releases the system resources, the first task is awakened to obtain the parameter information of the first task, which can also avoid the problem that other low-priority tasks cannot be run due to the blocking of high-priority tasks, thereby improving the system operation speed.

In one embodiment, after executing the first task, the method further includes:

After the first task releases the critical lock, the parameter information of the first task is cleared.

In this embodiment, after the first task is executed, the first task releases the key lock and clears the parameter information of the first task. Wherein, in the case where the parameter information includes target identification information, clearing the parameter information of the first task is clearing the target identification information in the parameter information of the first task. In the case of the identification information and the identification duration of the target identification information, the clearing of the parameter information of the first task is to clear the target identification information and the identification duration of the target identification information in the parameter information of the first task.

According to an embodiment of the present application, after the first task releases the critical lock, the parameter information of the first task is cleared, thereby preventing the target identification information from affecting the normal operation of other tasks after the task with the target identification information is run.

Step 401: When a setting event occurs and the parameter information of the first task includes the target identification information, obtain the identification duration of the target identification information.

In this embodiment, the setting event may be an event that occurs periodically. For example, the setting event may be a Tick interrupt event. It is understandable that the Tick interrupt is a periodic clock interrupt. In a mobile phone system, the Tick interrupt is generally 4 milliseconds each time. The Tick interrupt can periodically update the time information of the task running in the system, and then determine whether the currently running task needs to be scheduled based on the time information of the task running.

During the operation of the system, when a set event occurs, a timeout judgment can be made on the identification duration of a special task in the system including target identification information.

Step 402: When the identification duration of the target identification information is greater than the preset duration, clear the target identification information in the parameter information of the first task.

In this embodiment, when the identification time of the target identification information is greater than the preset time, that is, the time for running the first task is too long, the running of the first task is abnormal, and it may fall into an infinite loop. In this case, the target identification information in the parameter information of the first task is cleared, and the first task is reordered according to the time when it obtains the key lock to avoid it running all the time.

According to an embodiment of the present application, when a setting event occurs and the parameter information of the first task includes the target identification information, the identification time of the target identification information is obtained; when the identification time of the target identification information is greater than the preset time, the first task is cleared. The target identification information in the parameter information of the task can avoid the problem that other tasks cannot be run due to abnormal task operation, thereby improving the speed of system operation.

FIG. 2 is a schematic diagram of a task scheduling method according to an example of the present invention, in which a special task that cannot be preempted exists among the tasks and the special task is executed.

As shown in FIG. 2 , in this example, the specific steps of the task scheduling method may include:

Step 21: Before the first task obtains system resources, a key lock is obtained. When obtaining the key lock, the target identification information is marked for the first task, and the identification time of the first task being marked with the target identification information is recorded, and then the target identification information and the identification time of the target identification information are used as one of the parameter information of the first task.

Step 22: When the first task obtains the critical lock and the first task occupies system resources, obtain parameter information of the first task.

In this embodiment, the first task obtains the key lock, which indicates that the first task enters the critical section of the waiting or running state, and the first task occupies the CPU. If there is a high-priority second task that needs to be run, since the first task preempts the CPU, step 23 is executed to determine the order in which the first task and the second task are run.

Step 23: Determine whether the parameter information of the first task includes target identification information, and whether the identification duration of the target identification information of the first task exceeds a preset duration t.

Step 24: If it is detected that the parameter information of the first task includes target identification information, and the identification duration of the target identification information is less than or equal to the preset duration t, the CPU is prohibited from switching to the second task, and the CPU runs the first task.

Step 25: If it is detected that the parameter information of the first task does not include the target identification information, or the parameter information of the first task includes the target identification information but the identification duration has exceeded the preset duration t, the second task with a higher priority is executed first.

Step 26: When the second task is completed, the CPU switches back to running the first task.

Step 27: The first task releases the key lock.

In this embodiment, the first task releasing the critical lock indicates that the first task exits the critical section.

Step 28: Clear the target identification information in the parameter information of the first task.

In this embodiment, in step 24, if it is detected that the parameter information of the first task includes target identification information, and the identification duration of the target identification information is less than or equal to the preset duration t, the CPU is prohibited from switching to the second task, and the CPU runs the first task, which can shorten the critical section time of the first task. In steps 25 and 26, if it is detected that the parameter information of the first task does not include the target identification information, or the parameter information of the first task includes the target identification information but the identification duration has exceeded the preset duration t, the high-priority second task will be run first, and when the second task is completed, the CPU will switch back to run the first task, which can avoid the problem of system freeze caused by priority inversion.

FIG3 is a schematic diagram of a task scheduling method according to another example of the present invention, in which the first task is blocked, actively gives up the CPU, and then quickly switches back to run on the CPU.

As shown in FIG3 , in this example, the specific steps of the task scheduling method may include:

Step 31: Before the first task obtains system resources, a key lock is obtained. When obtaining the key lock, target identification information is marked for the first task, and the identification time of the first task being marked with the target identification information is recorded, and the target identification information and the identification time of the target identification information are used as one of the parameter information of the first task.

Step 32: When the first task acquires the critical lock and the third task occupies the system resources, wait for the first task to be awakened.

In this embodiment, the first task acquires the critical lock, which indicates that the first task enters the critical section. At this time, the third task occupies the system resources that the first task needs to allocate, and the first task is blocked. At this time, the first task is in a state of waiting to be awakened. The CPU will run other tasks, including the third task.

Step 33: When the first task is awakened, obtain parameter information of the first task; wherein the first task is awakened when the third task releases the system resources.

In this embodiment, when the third task exits and releases the system resources, the first task is awakened. When the first task is awakened, parameter information of the first task is obtained to determine whether the parameter information of the first task meets a preset condition.

Step 34: Determine whether the parameter information of the first task includes target identification information, and whether the identification duration of the target identification information of the first task exceeds the preset duration t?

Step 35: If the parameter information of the first task includes the target identification information and there is no timeout, the CPU is immediately switched back to the first task.

Step 36: If the parameter information of the first task does not include the target identification information, or the parameter information of the first task includes the target identification information but the identification duration has timed out, determine whether to switch to other tasks based on whether there are other high-priority tasks that need to be run.

Step 37: After other high-priority tasks exit execution, the CPU switches back to the first task.

Step 38: The first task releases the critical lock, indicating that the first task exits the critical section.

Step 39: Clear the target identification information of the first task.

In this embodiment, when the first task is blocked, the CPU is actively released, and the current CPU will run the third task. When the third task exits, the first task is awakened. When the first task is awakened, it is determined whether the parameter information of the first task meets the preset conditions. If the parameter information of the first task includes the target identification information and there is no timeout, the current CPU is immediately switched back to run the first task, thereby avoiding the problem that other tasks cannot be run due to the blocking of high-priority tasks, and the system operation speed can also be improved.

FIG. 4 is a schematic diagram of a task scheduling method according to another example of the present invention, in which the example is aimed at periodic timeout detection of the system to determine whether there is an abnormality in the operation of the task.

As shown in FIG4 , in this example, the specific steps of the task scheduling method may include:

Step 41: Tick interrupt occurs.

Step 42: When the Tick is interrupted, check whether the first task is a special task including target identification information, and whether the identification duration of the target identification information exceeds a preset duration t.

Step 43: If the first task is a special task including target identification information, and its identification duration exceeds the preset duration t, then the target identification information of the first task is cleared, that is, the CPU is allowed to run other tasks.

Step 44: If the first task is not a special task, or the first task includes a target identification signal If the special task of the message exceeds the preset time t, the Tick timeout judgment is exited.

In this embodiment, the Tick interrupt can be used to perform timeout detection on the task with target identification information in the system. If it is detected that the identification duration of the target identification information exceeds the preset duration, it means that the task has occupied the CPU for a long time, and there may be an operation abnormality, and it has fallen into an infinite loop. In this case, the target identification information of the task is cleared to allow the task to be queued again. Because the priority of the task after requeuing is lower, it will be ranked later, and the system can run other tasks. In this way, the problem of other tasks being unable to run due to abnormal task operation can be avoided, and the speed of system operation is improved.

The task scheduling method provided in the embodiment of the present application can be performed by a task scheduling device. In the embodiment of the present application, the task scheduling device provided in the embodiment of the present application is described by taking the method for performing task scheduling by the task scheduling device as an example.

As shown in FIG5 , a task scheduling device 500 is provided in an embodiment of the present application. The device 500 includes:

An acquisition module 501 is used to acquire parameter information of the first task when the first task acquires the key lock;

The control module 502 is used to execute the first task when the parameter information meets a preset condition, wherein the parameter information meets the preset condition includes: the parameter information includes target identification information.

In an embodiment, when the parameter information includes target identification information, the parameter information satisfying the preset condition further includes: the identification duration of the target identification information is less than or equal to the preset duration.

In one embodiment, the control module 502 is further configured to run the second task if the parameter information does not meet the preset condition and there is a second task with a higher priority than the first task; wherein the parameter information does not meet the preset condition includes one of the following: the parameter information does not include the target identification information, the parameter information includes the target identification information but the identification duration of the target identification information is greater than the preset duration;

After the second task exits execution, the first task is executed.

In one embodiment, the device further includes: a clearing module 503,

The clearing module 503 is used to clear the parameter information of the first task after the first task releases the critical lock.

In one embodiment, the acquisition module 501 is specifically used to acquire parameter information of the first task when the first task acquires a critical lock and the first task occupies system resources;

Alternatively, the acquisition module 501 is specifically used to wait for the first task to be awakened when the first task acquires the critical lock and the third task occupies the system resources, and to obtain parameter information of the first task when the first task is awakened; wherein the first task is awakened when the third task releases the system resources.

According to the embodiment of the present application, by setting the conditions for triggering the acquisition of the parameter information of the first task, the system operation speed can be improved and the system power consumption can be reduced. In addition, when the first task is blocked, other tasks are run first, and when the third task releases the system resources, the first task is awakened to obtain the parameter information of the first task, which can also avoid the problem that other low-priority tasks cannot be run due to the blocking of high-priority tasks, thereby improving the system operation speed.

In one embodiment, the acquisition module 501 is used to acquire the identification duration of the target identification information when a setting event occurs and the parameter information of the first task includes the target identification information;

The clearing module 503 is used to clear the target identification information in the parameter information of the first task when the identification duration of the target identification information is greater than the preset duration.

According to an embodiment of the present application, when a set event occurs and the parameter information of the first task includes the target identification information, the identification duration of the target identification information is obtained; when the identification duration of the target identification information is greater than the preset duration, the target identification information in the parameter information of the first task is cleared, thereby avoiding the problem of other tasks being unable to run due to abnormal task operation, thereby improving the speed of system operation.

The task scheduling device in the embodiment of the present application can be an electronic device or a component in the electronic device, such as an integrated circuit or a chip. The electronic device can be a terminal or other devices other than a terminal. Exemplarily, the electronic device can be a mobile phone, a tablet computer, a laptop computer, a PDA, a vehicle-mounted electronic device, a mobile Internet device (Mobile Internet Device, MID), an augmented reality (augmented reality, AR)/virtual reality (virtual reality, VR) device, a robot, a wearable device, an ultra-mobile personal computer (ultra-mobile personal computer, UMPC), a netbook or a personal digital assistant (personal digital assistant, PDA), etc. It can also be a server, a network attached storage (Network Attached Storage, NAS), a personal computer (personal computer, PC), a television (television, TV), a teller machine or a self-service machine, etc., and the embodiment of the present application is not specifically limited.

The task scheduling device in the embodiment of the present application may be a device having an operating system. The operating system may be an Android operating system, an iOS operating system, or other operating systems. The operating system capable of the present invention is not specifically limited in the embodiments of the present application.

The task scheduling device provided in the embodiment of the present application can implement each process implemented by the method embodiments of Figures 1 to 4. To avoid repetition, they will not be described here.

Optionally, as shown in Figure 6, an embodiment of the present application also provides an electronic device 600, including a processor 601 and a memory 602, and the memory 602 stores a program or instruction that can be executed on the processor 601. When the program or instruction is executed by the processor 601, the various steps of the above-mentioned task scheduling method embodiment are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

It should be noted that the electronic devices in the embodiments of the present application include the mobile electronic devices and non-mobile electronic devices mentioned above.

FIG. 7 is a schematic diagram of the hardware structure of an electronic device implementing an embodiment of the present application.

The electronic device 1000 includes but is not limited to: a radio frequency unit 1001, a network module 1002, an audio output unit 1003, an input unit 1004, a sensor 1005, a display unit 1006, a user input unit 1007, an interface unit 1008, a memory 1009, and a processor 1010 and other components.

Those skilled in the art can understand that the electronic device 1000 can also include a power source (such as a battery) for supplying power to each component, and the power source can be logically connected to the processor 1010 through a power management system, so that the power management system can manage charging, discharging, and power consumption. The electronic device structure shown in FIG7 does not constitute a limitation on the electronic device, and the electronic device can include more or fewer components than shown in the figure, or combine certain components, or arrange components differently, which will not be described in detail here.

Among them, the processor 1010 is used to obtain parameter information of the first task when the first task obtains the key lock; and run the first task when the parameter information meets the preset conditions, wherein the parameter information meets the preset conditions including: the parameter information includes target identification information.

According to the embodiment of the present application, by setting a key lock, it can be ensured that only one task obtains the key lock at the same time, so that when multiple tasks are running at the same time, the multiple tasks can be run in order of the time of obtaining the key lock, thereby avoiding the problem of system congestion. By obtaining the parameter information of the first task when the first task obtains the key lock, and running the first task when the parameter information meets the preset conditions, the first task with the target identification information can be run first, thereby avoiding the problem of system congestion. This shortens the waiting time for the first task to run and avoids the problem of system freeze caused by priority inversion in related technologies.

Optionally, in a case where the parameter information includes target identification information, the parameter information satisfying a preset condition further includes: an identification duration of the target identification information being less than or equal to a preset duration.

According to an embodiment of the present application, by including target identification information in the parameter information, the parameter information satisfies the preset condition and also includes: the identification duration of the target identification information is less than or equal to the preset duration, which can avoid the long-term running of a special task affecting the running of other tasks, thereby affecting the running speed of the system and reducing the user experience.

Optionally, the processor 1010 is also used to run the second task if the parameter information does not meet the preset condition and there is a second task with a higher priority than the first task; wherein the parameter information does not meet the preset condition includes one of the following: the parameter information does not include the target identification information, the parameter information includes the target identification information but the identification duration of the target identification information is greater than the preset duration; after the second task exits running, the first task is run.

Optionally, the processor 1010 is configured to clear the parameter information of the first task after the first task releases the critical lock.

Optionally, the processor 1010 is configured to, when the first task acquires the critical lock and the first task occupies system resources, acquire parameter information of the first task; or, when the first task acquires the critical lock and the third task occupies the system resources, wait for the first task to be awakened, and when the first task is awakened, acquire parameter information of the first task. wherein, the first task is awakened when the third task releases the system resources.

Optionally, the processor 1010 is used to obtain the identification duration of the target identification information when a set event occurs and the parameter information of the first task includes the target identification information; and to clear the target identification information in the parameter information of the first task when the identification duration of the target identification information is greater than the preset duration.

It should be understood that in the embodiment of the present application, the input unit 1004 may include a graphics processing unit (GPU) 10041 and a microphone 10042, and the graphics processor 10041 processes the image data of the static picture or video obtained by the image capture device (such as a camera) in the video capture mode or the image capture mode. The display unit 1006 may include a display panel 10061, and the display panel 10061 may be configured in the form of a liquid crystal display, an organic light emitting diode, etc. The user input unit 1007 includes a touch panel 10071 and at least one of other input devices 10072. The touch panel 10071 is also called a touch screen. The touch panel 10071 may include two parts: a touch detection device and a touch controller. Other input devices 10072 may include, but are not limited to, a physical keyboard, function keys (such as a volume control key, a switch key, etc.), a trackball, a mouse, and a joystick, which will not be repeated here.

The memory 1009 can be used to store software programs and various data. The memory 1009 can mainly include The memory 1009 includes a first storage area for storing programs or instructions and a second storage area for storing data, wherein the first storage area may store an operating system, an application program or instructions required for at least one function (such as a sound playback function, an image playback function, etc.), etc. In addition, the memory 1009 may include a volatile memory or a non-volatile memory, or the memory 1009 may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), a static random access memory (SRAM), a dynamic random access memory (DRAM), a synchronous dynamic random access memory (SDRAM), a double data rate synchronous dynamic random access memory (DDRSDRAM), an enhanced synchronous dynamic random access memory (ESDRAM), a synchronous link dynamic random access memory (SLDRAM) and a direct memory bus random access memory (DRRAM). The memory 1009 in the embodiment of the present application includes but is not limited to these and any other suitable types of memory.

The processor 1010 may include one or more processing units; optionally, the processor 1010 integrates an application processor and a modem processor, wherein the application processor mainly processes operations related to an operating system, a user interface, and application programs, and the modem processor mainly processes wireless communication signals, such as a baseband processor. It is understandable that the modem processor may not be integrated into the processor 1010.

An embodiment of the present application also provides a readable storage medium, on which a program or instruction is stored. When the program or instruction is executed by a processor, the various processes of the above-mentioned task scheduling method embodiment are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

The processor is the processor in the electronic device described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory ROM, a random access memory RAM, a magnetic disk or an optical disk.

The present application embodiment further provides a chip, the chip comprising a processor and a communication interface. The communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the various processes of the above-mentioned task scheduling method embodiment, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

An embodiment of the present application provides a computer program product, which is stored in a storage medium. The program product is executed by at least one processor to implement the various processes of the above-mentioned task scheduling method embodiment and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

It should be noted that, in this article, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises one..." does not exclude the presence of other identical elements in the process, method, article or device including the element. In addition, it should be noted that the scope of the method and device in the embodiment of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in reverse order according to the functions involved, for example, the described method may be performed in an order different from that described, and various steps may also be added, omitted, or combined. In addition, the features described with reference to certain examples may be combined in other examples.

Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a computer software product, which is stored in a storage medium (such as ROM/RAM, a disk, or an optical disk), and includes a number of instructions for enabling a terminal (which can be a mobile phone, a computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the present application.

The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above specific implementations, which are merely illustrative and not restrictive. Under the enlightenment of this application, ordinary technicians in this field can make many forms without departing from the purpose of this application and the scope of protection of the claims, all of which are within the protection of this application.

Claims

A task scheduling method, wherein the method comprises:

When the first task obtains the key lock, obtaining parameter information of the first task;

In a case where the parameter information meets a preset condition, the first task is executed, wherein the parameter information meeting the preset condition includes: the parameter information includes target identification information.
According to the method according to claim 1, wherein, in the case where the parameter information includes target identification information, the parameter information satisfies the preset condition and further comprises: the identification duration of the target identification information is less than or equal to the preset duration.
The method according to claim 2, wherein after obtaining the parameter information of the first task, the method further comprises:

If the parameter information does not satisfy the preset condition and there is a second task with a higher priority than the first task, run the second task; wherein the parameter information does not satisfy the preset condition includes one of the following: the parameter information does not include the target identification information, the parameter information includes the target identification information but the identification duration of the target identification information is greater than the preset duration;

After the second task exits execution, the first task is executed.
The method according to any one of claims 1 to 3, wherein after executing the first task, the method further comprises:

After the first task releases the critical lock, the parameter information of the first task is cleared.
The method according to any one of claims 1 to 3, wherein, when the first task obtains the critical lock, obtaining parameter information of the first task comprises:

When the first task acquires the critical lock and the first task occupies system resources, Obtaining parameter information of the first task;

Alternatively, when the first task obtains the critical lock and the third task occupies the system resources, wait for the first task to be awakened, and when the first task is awakened, obtain parameter information of the first task; wherein the first task is awakened when the third task releases the system resources.
The method according to claim 1, wherein after obtaining the parameter information of the first task, the method further comprises:

When a setting event occurs and the parameter information of the first task includes the target identification information, obtaining the identification duration of the target identification information;

When the identification duration of the target identification information is greater than the preset duration, the target identification information in the parameter information of the first task is cleared.
A task scheduling device, wherein the device comprises:

An acquisition module, configured to acquire parameter information of the first task when the first task acquires the key lock;

A control module is used to run the first task when the parameter information meets a preset condition, wherein the parameter information meets the preset condition includes: the parameter information includes target identification information.
The device according to claim 7, wherein, in a case where the parameter information includes target identification information, the parameter information satisfying the preset condition further comprises: an identification duration of the target identification information is less than or equal to a preset duration.
The device according to claim 8, wherein the control module is further configured to run the second task if the parameter information does not meet the preset condition and there is a second task with a higher priority than the first task; wherein the parameter information does not meet the preset condition includes: One of the following: the parameter information does not include the target identification information, the parameter information includes the target identification information but the identification duration of the target identification information is greater than the preset duration;

After the second task exits execution, the first task is executed.
The device according to any one of claims 7 to 9, wherein the device further comprises: a clearing module,

The clearing module is used to clear the parameter information of the first task after the first task releases the critical lock.
The device according to any one of claims 7 to 9, wherein the acquisition module is specifically configured to acquire parameter information of the first task when the first task acquires a critical lock and the first task occupies system resources;

Alternatively, the acquisition module is specifically used to wait for the first task to be awakened when the first task acquires the critical lock and the third task occupies the system resources, and to obtain parameter information of the first task when the first task is awakened; wherein the first task is awakened when the third task releases the system resources.
The device according to claim 7, wherein the acquisition module is used to acquire the identification duration of the target identification information when a set event occurs and the parameter information of the first task includes the target identification information;

The device further includes: a clearing module, configured to clear the target identification information in the parameter information of the first task when the identification duration of the target identification information is greater than the preset duration.
An electronic device, comprising a processor and a memory, wherein the memory stores programs or instructions that can be run on the processor, and when the program or instructions are executed by the processor, the steps of the task scheduling method according to any one of claims 1 to 6 are implemented.
A readable storage medium, wherein the readable storage medium stores a program or instruction, and when the program or instruction is executed by a processor, the steps of the task scheduling method according to any one of claims 1 to 6 are implemented.
A chip, wherein the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is used to run a program or instruction to implement the steps of the task scheduling method according to any one of claims 1 to 6.
A computer program product, wherein the computer program product is stored in a storage medium, and the computer program product is executed by at least one processor to implement the steps of the task scheduling method according to any one of claims 1 to 6.