# US 2018/0321972 A1 · Task management methods and system, and computer storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0321972 A1
- Document ID: US20180321972A1
- Status: Published application
- Kind: A1
- Application number: 15/773,984
- Filed: 2016-08-16
- Published: 2018-11-08
- Earliest claimed: 2015-11-09
- Assignees: Oneplus Technology (Shenzhen) Co., Ltd.
- Applicants: Oneplus Technology (Shenzhen) Co., Ltd.
- Inventors: Kengyu Lin; Wenyen Chang
- Web page: https://patentgrep.com/patent/US20180321972A1

## CPC

- G06F 9/4887: {involving deadlines, e.g. rate based, periodic}
- G06F 1/329: by task scheduling
- G06F 9/48: Program initiating; Program switching, e.g. by interrupt
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/5038: {considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups)}
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- Y02D 30/50: in wire-line communication networks, e.g. low power modes or reduced link rate
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

A task management method and system, and a computer storage medium include: monitoring the operation of background tasks; determining the allowed operation time of a specific background task in a unit time, the sum of the operation times allowed for all the specific background tasks within the unit time being less than or equal to a preset time threshold; and the respective specific background tasks are brought into a waiting state when the specific background tasks are outside of the corresponding operation period within the unit time.

## Claims

### Claim 1

A task management method, comprising:
monitoring running of background tasks;
determining an allowed running time period of a specific background task within a unit time, a sum of the allowed running time periods of all the specific background tasks within the unit time being less than or equal to a preset time threshold; and
putting each specific background task into a waiting state during a time period outside a running time period corresponding to the specific background task within the unit time.

### Claim 2 (depends on 1)

The task management method according to claim 1, further comprising:
after the step of monitoring the running of the background tasks,
establishing a background task group, and setting a resource utilization time limit of the background task group to be the preset time threshold; and
adding the specific background task into the background task group according to a predetermined rule.

### Claim 3 (depends on 2)

The task management method according to claim 2, further comprising:
acquiring priorities of a foreground task under execution and the background tasks in the background task group; and
in the case that the priority of the foreground task is the same as that of the background tasks in the background task group, determining that the allowed running time period of each background task in the background task group within the unit time is obtained by dividing the time threshold by a sum of a total number of the foreground task and a total number of the background tasks in the background task group.

### Claim 4 (depends on 3)

The task management method according to claim 3, further comprising:
after acquiring the priorities of the foreground task under execution and the background tasks in the background task group,
in the case that the priority of the foreground task is different from that of the background tasks in the background task group, determining, according to a predetermined algorithm, the allowed running time period of each background task in the background task group within the unit time on the basis of the priorities of the foreground task and the background tasks in the background task group.

### Claim 5 (depends on 4)

The task management method according to claim 4, further comprising:
after putting each specific background task into the waiting state during the time period outside the running time period corresponding to the specific background task within the unit time,
deciding whether there is a foreground task being executed when each specific background task enters the waiting state;
in the case that there is a foreground task being executed, determining that the foreground task obtains all resource utilization time; and
in the case that there is no foreground task being executed, entering a sleep state.

### Claim 6

A task management system, comprising a processor and a memory for storing a set of instructions executable by the processor, wherein when the instructions are executed by the processor, the processor is configured to:
monitor running of background tasks;
determine an allowed running time period of a specific background task within a unit time, a sum of the allowed running time periods of all the specific background tasks within the unit time being less than or equal to a preset time threshold; and
put each specific background task into a waiting state during a time period outside a running time period corresponding to the specific background task within the unit time.

### Claim 7 (depends on 6)

The task management system according to claim 6, wherein the processor is further configured to:
establish a background task group, and set a resource utilization time limit of the background task group to be the preset time threshold; and
add the specific background task into the background task group according to a predetermined rule.

### Claim 8 (depends on 7)

The task management system according to claim 7, wherein the processor is further configured to:
acquire priorities of a foreground task under execution and the background tasks in the background task group,
in the case that the priority of the foreground task is the same as that of the background tasks in the background task group, determine that the allowed running time period of each background task in the background task group within the unit time is obtained by dividing the time threshold by a sum of a total number of the foreground task and a total number of the background tasks in the background task group.

### Claim 9 (depends on 8)

The task management system according to claim 8, wherein the processor is further configured to, in the case that the priority of the foreground task is different from that of the background tasks in the background task group, determine, according to a predetermined algorithm, the allowed running time period of each background task in the background task group within the unit time on the basis of the priorities of the foreground task and the background tasks in the background task group.

### Claim 10 (depends on 9)

The task management system according to claim 9, wherein the processor is further configured to:
decide whether there is a foreground task being executed when each specific background task enters the waiting state,
in the case that it is decided that there is a foreground task being executed when each specific background task enters the waiting state, determine that the foreground task obtains all resource utilization time; and
in the case that it is decided that there is no foreground task being executed when each specific background task enters the waiting state, enter a sleep state.

### Claim 11

A non-transitory computer storage medium, in which computer-executable instructions are stored, which, when executed by a processor, cause the processor to execute a task management method, wherein the method comprises:
monitoring running of background tasks;
determining an allowed running time period of a specific background task within a unit time, a sum of the allowed running time periods of all the specific background tasks within the unit time being less than or equal to a preset time threshold; and
putting each specific background task into a waiting state during a time period outside a running time period corresponding to the specific background task within the unit time.

### Claim 12 (depends on 11)

The non-transitory computer storage medium according to claim 11, wherein the method further comprises:
after the step of monitoring the running of the background tasks,
establishing a background task group, and setting a resource utilization time limit of the background task group to be the preset time threshold; and
adding the specific background task into the background task group according to a predetermined rule.

### Claim 13 (depends on 12)

The non-transitory computer storage medium according to claim 12, wherein the method further comprises:
acquiring priorities of a foreground task under execution and the background tasks in the background task group; and
in the case that the priority of the foreground task is the same as that of the background tasks in the background task group, determining that the allowed running time period of each background task in the background task group within the unit time is obtained by dividing the time threshold by a sum of a total number of the foreground task and a total number of the background tasks in the background task group.

### Claim 14 (depends on 13)

The non-transitory computer storage medium according to claim 13, wherein the method further comprises:
after acquiring the priorities of the foreground task under execution and the background tasks in the background task group,
in the case that the priority of the foreground task is different from that of the background tasks in the background task group, determining, according to a predetermined algorithm, the allowed running time period of each background task in the background task group within the unit time on the basis of the priorities of the foreground task and the background tasks in the background task group.

### Claim 15 (depends on 14)

The non-transitory computer storage medium according to claim 14, wherein the method further comprises:
after putting each specific background task into the waiting state during the time period outside the running time period corresponding to the specific background task within the unit time,
deciding whether there is a foreground task being executed when each specific background task enters the waiting state;
in the case that there is a foreground task being executed, determining that the foreground task obtains all resource utilization time; and
in the case that there is no foreground task being executed, entering a sleep state.
