CN116974711A

CN116974711A - Task allocation method and device

Info

Publication number: CN116974711A
Application number: CN202210426009.3A
Authority: CN
Inventors: 傅喆
Original assignee: Shanghai Bilibili Technology Co Ltd
Current assignee: Shanghai Bilibili Technology Co Ltd
Priority date: 2022-04-21
Filing date: 2022-04-21
Publication date: 2023-10-31

Abstract

The application provides a task allocation method, which comprises the following steps: acquiring a task, and putting the task into a task pool of a corresponding type according to the type of the task; assigning a predetermined number of tasks to a processor according to a task pool selected by the processor, and removing the tasks assigned to the processor from the task pool; after a predetermined number of the tasks are assigned to the handler for a predetermined period of time, incomplete ones of the predetermined number of the tasks assigned to the handler are returned to the task pool for reassignment. The technical method provided by the application can establish different task pools for tasks according to types, is convenient to distribute, can count the processing conditions of various types of tasks, and avoids the situation that the same task is acquired by different processing staff and causes manpower waste because the distributed tasks are removed from the task pools.

Description

Task allocation method and device

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a task allocation method, a task allocation device, a computer device, and a computer readable storage medium.

Background

With the development of technology, more and more intelligent technology goes into various aspects, and various types of tasks can be distributed and processed by using the intelligent technology. However, how to reasonably distribute tasks in the process of processing tasks by using an intelligent technology, so as to improve the overall processing efficiency, becomes a problem to be solved.

Taking an audit service as an example, the current common allocation method for the audit service is that different auditors in the same batch acquire audit tasks in the same data table to be audited, and the audit states are respectively modified after the respective audits are completed. However, for the auditing task in the data table to be audited, the auditing task is kept in the data table to be audited until the auditing task is not modified into the auditing completion state, so that the same auditing task can be acquired by different auditors for multiple audits, invalid repeated audits occur, manpower resources are wasted, the overall auditing efficiency is reduced, and the performance of each auditor cannot be reasonably counted.

Disclosure of Invention

The application aims to provide a task allocation method, a task allocation device, computer equipment and a computer readable storage medium, which are used for solving the following technical problems: the current task allocation mode results in lower overall task processing efficiency and waste of human resources.

One aspect of the embodiment of the application provides a task allocation method, which comprises the following steps:

acquiring a task, and putting the task into a task pool of a corresponding type according to the type of the task;

assigning a predetermined number of tasks to a processor according to a task pool selected by the processor, and removing the tasks assigned to the processor from the task pool;

after a predetermined number of the tasks are assigned to the handler for a predetermined period of time, incomplete ones of the predetermined number of the tasks assigned to the handler are returned to the task pool for reassignment.

Optionally, the assigning a predetermined number of the tasks to the processor according to the task pool selected by the processor includes:

assigning a predetermined number of the tasks to the handler when the number of the tasks in the task pool is greater than the predetermined number;

and when the number of the tasks in the task pool is smaller than or equal to the preset number, distributing all the tasks in the task pool to the processing personnel.

and distributing the task to the processor according to the time of the processor requesting the task.

when the task is allocated to the processor, the task which is not allocated before in the task pool is returned to be allocated preferentially.

after the processor completes a predetermined number of the tasks, a new predetermined number of tasks are assigned to the processor.

and when no task exists in the task pool, a prompt is sent to the processor.

Optionally, the method comprises:

after the task is processed by the processing personnel, changing the state of the task to processed.

Optionally, the method further comprises:

the number of tasks completed by the processor is recorded.

Optionally, the method further comprises:

and counting and displaying at least one of the number of tasks in each task pool, the number of tasks in process in a certain time period, the number of processed tasks in a certain time period and the number of processing personnel.

An aspect of an embodiment of the present application further provides a task allocation device, including:

the task acquisition module is used for acquiring a task and putting the task into a task pool of a corresponding type according to the type of the task;

the task allocation module is used for allocating a preset number of tasks to the processing personnel according to the task pool selected by the processing personnel and removing the tasks allocated to the processing personnel from the task pool;

and the task monitoring module is used for returning the tasks which are not completed in the preset number of the tasks allocated to the processing personnel to the task pool for reallocation after the preset number of the tasks are allocated to the processing personnel for a preset time period.

An aspect of an embodiment of the present application further provides a computer device including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the task allocation method as described above when executing the computer program.

An aspect of an embodiment of the present application further provides a computer readable storage medium including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the task allocation method as described above when executing the computer program.

The task allocation method, the device, the computer equipment and the computer readable storage medium provided by the embodiment of the application have the following advantages:

different task pools can be established according to the types of tasks, so that the tasks are convenient to distribute, the processing conditions of various types of tasks can be counted, and the distributed tasks are removed from the task pools, so that the situation that the same task is acquired by different processing personnel and manpower is wasted is avoided.

Drawings

FIG. 1 schematically illustrates a schematic diagram of an application environment of the task allocation method of the present application;

FIG. 2 schematically illustrates a flow chart of a task allocation method according to a first embodiment of the application;

FIG. 3 schematically illustrates an example of a task processing station according to a first embodiment of the application;

FIG. 4 is a flow chart of the substeps of step S202 in FIG. 2;

FIG. 5 is a flow chart schematically showing the steps of a task allocation method according to a first embodiment of the present application;

FIG. 6 is a flow chart schematically showing the steps of a task allocation method according to a first embodiment of the present application;

FIG. 7 schematically shows a block diagram of a task assigning device according to a second embodiment of the present application;

fig. 8 schematically shows a hardware architecture diagram of a computer device adapted to implement a task allocation method according to a third embodiment of the present application.

Detailed Description

The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.

It should be noted that the descriptions of "first," "second," etc. in the embodiments of the present application are for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In addition, the technical solutions of the embodiments may be combined with each other, but it is necessary to base that the technical solutions can be realized by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not within the scope of protection claimed in the present application.

In the description of the present application, it should be understood that the numerical references before the steps do not identify the order in which the steps are performed, but are merely used to facilitate description of the present application and to distinguish between each step, and thus should not be construed as limiting the present application.

Fig. 1 schematically shows a schematic view of an application environment of the task allocation method of the present application.

Referring to fig. 1, a server 10 is communicatively connected to a task generating end 20, such as a computer or a mobile device, and a task processing end 30, such as a computer, for example. The task generated by the task generating end 10 is sent to the task processing end 30 for processing via the server 10. The task may be directly generated by the task generating end 20 or may be generated by the server 10 based on data of the task generating end 10.

Fig. 1 shows, by way of example, two task generating ends 20 and two task processing ends 30, one task generating end 20 being a computer device and one task generating end 20 being a mobile device.

As one example, the server 10 is a live server, and the task generating end 20 is various live devices that generate various tasks, such as auditing tasks, based on live content. The task processing end 30 is a terminal for performing an audit task. The server 10 receives the task from the task generating end 20 and then transmits the task to the task processing end 30 for processing.

In order to improve the overall processing efficiency of the task, different task pools are established according to the types of the task, and the task pools are used for carrying out statistical distribution on various types of tasks, so that the overall processing efficiency is improved. The following table shows one example of a task pool of an embodiment of the present application.

As shown in the table above, tasks are placed in different task pools by type, for example, a primary A-type task is placed in a primary A-type task pool, a secondary A-type task is placed in a secondary A-type task pool, and a primary B-type task is placed in a primary B-type task pool. In the task pool, the current task number, the task number for starting processing, the processed task number and the number of processing persons of each type of task can be counted, the various data can be intuitively acquired through the task pool counting plate, a manager can allocate human resources according to the processing conditions of each type of task, for example, more processing persons are allocated to the task pool with more current task numbers, or whether surplus processing persons exist in the task pool so as to allocate to processing other types of tasks, or the processing efficiency of each task pool can be checked.

Further, as shown in the above table, a processor may enter a corresponding type of task pool through a start processing control shown in the table, thereby starting processing the type of task. After the processor enters the task pool, the task is distributed to the processor according to the time sequence of the task requested by the processor, and the task distributed to the processor is removed from the task pool, so that the same task is prevented from being acquired by different processors, and the manpower waste is avoided.

Further, in the application, rights can be allocated or set for the processing personnel, so as to limit the task types that each processing personnel can process. For example, the type a processing authority can be set for the processor, and the processor can only enter the type a task pool to acquire the task for processing. For example, the first-level B type task processing authority can be set for the processor, and the processor can only enter the first-level B type task pool to acquire the task for processing.

Further, in the present application, a processor may select a plurality of task pools, for example, three task pools of type a from one to three, from which tasks are then obtained for processing. In this case, tasks may be assigned to a processor according to task priorities or task generation times, and for example, tasks having a high task level (e.g., first-order task priority processing) may be assigned preferentially, and tasks that have been generated first (i.e., old task priority) may be assigned preferentially. In such a case, the task of the type selected by the handler is assigned preferentially subsequently in the processing of the task of the current batch by the handler.

By the task allocation of the task pool, different tasks can be supported to be respectively distributed to different processing staff, task processing is not repeated, and the processing staff cannot be distributed to new tasks before processing the tasks distributed to the processing staff. Meanwhile, the task pool data billboard can be provided through the task pool, so that decision-making processing staff can be helped to manually distribute and display related data of human resources.

Various embodiments are provided below, which may be used to implement the above-described schemes for task allocation. For ease of understanding, an exemplary description will be made below with the computer device/server as the execution subject.

Example 1

The present embodiment provides a task allocation method, and the following may refer to specific technical details and effects.

Fig. 2 schematically shows a flow chart of a task allocation method according to a first embodiment of the application.

As shown in fig. 2, the task allocation method according to the first embodiment of the present application may include:

step S200, acquiring a task, and putting the task into a task pool of a corresponding type according to the type of the task;

step S202, distributing a preset number of tasks to a processor according to a task pool selected by the processor, and removing the tasks distributed to the processor from the task pool;

step S204, after the preset number of tasks are allocated to the processing personnel for a preset time period, returning the tasks which are not completed in the preset number of tasks allocated to the processing personnel to the task pool for reallocation.

In the step S200, after the task is acquired, the task is put into the task pool of the corresponding type according to the task type. Referring to the foregoing task pool example, a primary A-type task is placed in a primary A-type task pool and a secondary A-type task is placed in a secondary A-type task pool.

In the step S202, when the processor selects and enters the task pool, a predetermined number of tasks are selected from the task pool and allocated to the processor for processing, and the allocated tasks are removed from the task pool, so that the allocated tasks cannot be allocated to other processors any more, and the situation that the same task is repeatedly processed by different processors is avoided.

Taking the task pool as an example, assuming that the task pool selected by the processing personnel is an A-type task secondary task pool and the start processing control is clicked, a predetermined number of secondary A-type tasks are selected from the A-type task secondary task pool and distributed to the processing personnel for processing.

The predetermined number is a predetermined task number, which may be, for example, 10 to 100. It should be appreciated that the predetermined number may be modified according to task requirements.

As an example, in the present application, when a processor clicks a start processing control, the processor enters a processing platform for a task of the type, and the task allocated to the processor is displayed on the processing platform, and the processor can process the task on the processing platform and submit the task after the processing is completed, so as to inform the background that the corresponding task has been processed.

Referring to fig. 3, an example of a task processing station is shown. As shown in fig. 3, the task to be processed assigned to the processing personnel is displayed on the task processing table, and the processing personnel can perform the task by clicking on the processing interface of each task. Taking an audit task as an example, clicking each audit task then enters an audit page of the corresponding task, detailed information and operation information of the task can be displayed on the audit page, and audit personnel can execute audit operations, such as pass, reject and the like, on the audit page.

For example, in the embodiment of the present application, after completing a part of or all of the tasks, the processing personnel may click a batch submit button to submit the processing results, where the state of the currently pending task is changed according to the submitted results, for example, the state of the task is changed to processed, that is, after the task is processed by the processing personnel, the state of the task is changed to processed. And simultaneously, recording the number of the completed processing tasks to the names of corresponding processing personnel according to the submitted time.

In the step S204, in order to improve the overall processing efficiency, it is monitored whether the task allocated to the processing personnel is completed within a preset period, if so, a new processing task is reallocated, and if there is an incomplete task, the incomplete task is returned to the task pool for reallocation, so that it is possible to avoid that the overall processing progress and efficiency of the task are affected due to the inefficiency of the individual processing personnel.

In the embodiment of the application, if a processor fails to complete all tasks distributed to the name of the processor at one time, only the tasks which cannot be completed are reserved on the task list of the processing platform, the processor can process all the rest tasks and submit the processing results, if the task distribution duration exceeds the preset duration, the task processing page can report overtime, all the tasks which do not submit the processing results are put back to the task pool, and the tasks which return to the task pool can be distributed in the next batch acquisition preferentially. In other words, when the task is assigned to the processor, the task that is not completed and is assigned before being returned to the task pool is preferentially assigned.

The task allocation method of the embodiment of the application has the following advantages:

Some alternative embodiments are provided below.

In an exemplary embodiment, the processor is assigned processing tasks according to the time the processor requested the tasks. The time for the processor to request the task can be determined based on the time when the processor clicks the task pool to start processing the control, can be determined based on the time when the processor finishes all tasks to click the refreshing control or request the task control, and can be further determined based on the time when the task is continuously and automatically distributed by the task complete system. When the task is allocated to the processor, the task allocation is performed according to the sequence of the time of the task request of the processor, namely, the task is allocated to the processor with the previous time of the task request, and then the task is allocated to the processor with the subsequent time of the task request. In an exemplary embodiment, the default order in which the processor obtains tasks is to request that the sequential time for task processing be from old to new, i.e., the old task is processed first.

In an exemplary embodiment, after the processor completes a predetermined number of the tasks, a new predetermined number of tasks are assigned to the processor. The tasks are distributed to the processors by batches according to the preset quantity, and the tasks of one batch are redistributed to the other batch after the completion of the tasks, so that the distribution of the proper quantity of the tasks in each batch is ensured, the single batch processing time is relatively reasonable, and the overall processing efficiency of the tasks is correspondingly improved.

In an exemplary embodiment, a prompt is issued to the handler when there are no tasks in the task pool. In other words, when the task to be processed in the task pool is 0, a prompt is sent to the processor to inform that the task of the type does not have any task to be processed currently, and the processor can process other types of tasks. In an exemplary embodiment, a prompt is issued to the handler when there are no tasks in the task pool, while proxy tasks in other task pools are automatically assigned to the handler. In an exemplary embodiment, a prompt is issued to the processor when there are no tasks in the task pool, while determining whether there are assigned but unprocessed tasks for that type, if so, the processor may be prompted to wait for the unprocessed tasks to be re-released to the task pool.

In an exemplary embodiment, tasks may be allocated to the processor according to the number of tasks in the task pool, as shown in fig. 4, step S202 may include: step S400 of distributing a predetermined number of tasks to the processing personnel when the number of tasks in the task pool is greater than the predetermined number; and step S402, when the number of the tasks in the task pool is smaller than or equal to the preset number, distributing all the tasks in the task pool to the processing personnel.

The predetermined number may be set according to the task processing situation, and may be 10 to 100, for example. Through reasonably setting the numerical value of the preset number, the proper number of tasks of the processing personnel can be distributed each time, the processing personnel can process the tasks conveniently, and the problem that the tasks are not processed due to too many tasks of the processing personnel can be avoided, so that the overall processing efficiency of the tasks is affected.

In an exemplary embodiment, in step S402, when the number of tasks in the task pool is less than or equal to the predetermined number, the processing personnel may also be assigned tasks to be processed in other task pools.

In an exemplary embodiment, the task completion amount of the processing personnel may also be recorded, as shown in fig. 5, and the method further includes:

step S500, recording the number of tasks completed by the processor.

In the step S500, each time the processor submits a task to complete, the number of tasks or task information of the task to complete is accumulated and recorded in the task completion information of the processor, so that the automatic recording of the number of tasks completed by the processor is realized, and the effectiveness of each task processor is conveniently counted.

In an exemplary embodiment, the information of the corresponding task and personnel in the task pool may also be counted and displayed, as shown in fig. 6, and the method further includes:

step S600, counting and displaying at least one of the number of tasks in each task pool, the number of tasks in process within a certain period of time, the number of processed tasks within a certain period of time, and the number of processing personnel.

In the embodiment of the present application, the number of tasks in each task pool, the number of tasks in process in a certain period of time, the number of tasks processed in a certain period of time, and the number of processing personnel, and various page data are requested to be updated when the processing personnel enter the task pool page, and the processing personnel can acquire the page data again by clicking a refresh control of the task pool page or manually refreshing the page to acquire the page data again, and can also acquire the minimum page data by periodically and automatically refreshing the task page.

In the step S600, each time a new task is acquired, the task is put into a task pool of a corresponding type, the newly added task number is accumulated in the current task number of the task pool, and each time a task is allocated, the allocated task number is subtracted from the current task number of the task pool of the type, so that the real-time statistical display of the current task number of the task pool can be realized. In the embodiment of the application, the number of tasks in the task pool can be expressed as the number of tasks to be processed in the task pool. In the present application, the number of tasks to be processed of the task pool refers to the number of all unprocessed tasks, including the number of tasks that have been assigned to a specified processor but have not been processed and the number of tasks that have not been assigned to a specified processor. The number of tasks to be processed in the task pool is reduced after the tasks are processed and submitted.

In the above step S600, the number of tasks allocated in the task pool within a certain period of time may also be counted and displayed, for example, the number of tasks allocated within one hour before the current time is counted and displayed, or the number of tasks in process. For example, statistics show the number of tasks in a one hour process in the primary class A task pool.

In the above step S600, the number of processed tasks in the task pool within a certain period of time may also be counted and displayed, for example, the number of processed tasks within one hour before the current time may be counted and displayed. For example, statistics show the number of tasks that have been processed in one hour in the primary class A task pool.

In the above step S600, the number of current processing persons in each task pool may also be counted and displayed.

A statistical display example of the number of tasks in each of the task pools, the number of tasks in process within a certain period of time, the number of tasks processed within a certain period of time, and the number of processing personnel is referred to in the foregoing task pool example. The method can help to examine and examine the manpower distribution and display the related data of the manpower resources by counting and displaying the number of the tasks in each task pool, the number of the tasks in processing within a certain time period, the number of the processed tasks within a certain time period and the number of the processing staff, and the management staff can distribute the manpower resources according to the processing conditions of the tasks of each type.

Example two

Fig. 7 schematically shows a block diagram of a task allocation device according to a third embodiment of the present application, which may be divided into one or more program modules, which are stored in a storage medium and executed by one or more processors, to complete the embodiment of the present application. Program modules in accordance with the embodiments of the present application are directed to a series of computer program instruction segments capable of performing the specified functions, and the following description describes each program module in detail.

As shown in fig. 7, the task assigning apparatus 700 may include a task acquisition module 710, a task assigning module 720, and a task monitoring module 730.

The task acquisition module 710 is configured to acquire a task, and put the task into a task pool of a corresponding type according to the type of the task;

a task allocation module 720, configured to allocate a predetermined number of tasks to a processor according to a task pool selected by the processor, and remove the tasks allocated to the processor from the task pool;

and a task monitoring module 730, configured to return, after a predetermined number of tasks are allocated to the processing personnel for a predetermined period of time, incomplete tasks among the predetermined number of tasks allocated to the processing personnel to the task pool for reassignment.

In an exemplary embodiment, the task allocation module 720 is configured to allocate a predetermined number of the tasks to the processor when the number of the tasks in the task pool is greater than the predetermined number; and when the number of the tasks in the task pool is smaller than or equal to the preset number, distributing all the tasks in the task pool to the processing personnel.

In an exemplary embodiment, the task allocation module 720 is configured to allocate processing tasks to the processor according to the time when the processor requests the tasks.

In an exemplary embodiment, task allocation module 720 is configured to prioritize allocation of the tasks that are not completed back to a previous allocation in the task pool when allocating the tasks to the processors.

In an exemplary embodiment, the task allocation module 720 is configured to allocate a new predetermined number of tasks to the processor after the processor completes a predetermined number of the tasks.

In an exemplary embodiment, the task allocation module 720 is configured to issue a prompt to the processor when there are no tasks in the task pool.

In an exemplary embodiment, the task allocation device 700 further includes a state change module (not shown) for changing the state of the task to processed after the task is processed by the processing personnel.

In the exemplary embodiment, task allocation device 700 also includes a task recording change module (not shown) that records the number of tasks that the processor has completed.

In an exemplary embodiment, the task allocation device 700 further includes a statistics module (not shown) for counting and displaying at least one of the number of tasks of each of the task pools, the number of tasks in process for a certain period of time, the number of processed tasks for a certain period of time, and the number of processing personnel.

Example III

Fig. 8 schematically shows a hardware architecture diagram of a computer device 10000 adapted to a task allocation method according to a fifth embodiment of the present application. The computer device 10000 may be a live server, or a live terminal, or a part of a live server or a live terminal. The computer device 10000 may be a device capable of automatically performing numerical calculation and/or data processing according to an instruction set or stored in advance. For example, it may be a rack server, a blade server, a tower server, or a rack server (including an independent server or a server cluster composed of a plurality of servers), a gateway, or the like. As shown in fig. 8, computer device 10000 includes at least, but is not limited to: the memory 10010, processor 10020, network interface 10030 may be communicatively linked to each other via a system bus. Wherein:

memory 10010 includes at least one type of computer-readable storage medium including flash memory, hard disk, multimedia card, card memory (e.g., SD or DX memory, etc.), random Access Memory (RAM), static Random Access Memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, memory 10010 may be an internal storage module of computer device 10000, such as a hard disk or memory of computer device 10000. In other embodiments, the memory 10010 may also be an external storage device of the computer device 10000, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card) or the like. Of course, the memory 10010 may also include both an internal memory module of the computer device 10000 and an external memory device thereof. In this embodiment, the memory 10010 is typically used for storing an operating system installed on the computer device 10000 and various application software, such as program codes of a task allocation method. In addition, the memory 10010 may be used to temporarily store various types of data that have been output or are to be output.

The processor 10020 may be a central processing unit (Central Processing Unit, simply CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 10020 is typically configured to control overall operation of the computer device 10000, such as performing control and processing related to data interaction or communication with the computer device 10000. In this embodiment, the processor 10020 is configured to execute program codes or process data stored in the memory 10010.

The network interface 10030 may comprise a wireless network interface or a wired network interface, which network interface 10030 is typically used to establish a communication link between the computer device 10000 and other computer devices. For example, the network interface 10030 is used to connect the computer device 10000 to an external terminal through a network, establish a data transmission channel and a communication link between the computer device 10000 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a global system for mobile communications (Global System of Mobile communication, abbreviated GSM), wideband code division multiple access (Wideband Code Division Multiple Access, abbreviated WCDMA), a 4G network, a 5G network, bluetooth (Bluetooth), wi-Fi, etc.

It should be noted that fig. 8 only shows a computer device having components 10010-10030, but it should be understood that not all of the illustrated components are required to be implemented, and more or fewer components may be implemented instead.

In this embodiment, the task allocation method stored in the memory 10010 may be further divided into one or more program modules and executed by one or more processors (the processor 10020 in this embodiment) to complete the embodiment of the present application.

Example IV

The embodiment of the application also provides a computer readable storage medium, and the computer readable storage medium stores a computer program thereon, and the computer program when executed by a processor realizes the steps of the task allocation method in the embodiment.

In this embodiment, the computer-readable storage medium includes a flash memory, a hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of a computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may also be an external storage device of a computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card), etc. that are provided on the computer device. Of course, the computer-readable storage medium may also include both internal storage units of a computer device and external storage devices. In this embodiment, the computer readable storage medium is typically used to store an operating system and various types of application software installed on a computer device, such as program codes of the task allocation method in the embodiment, and the like. Furthermore, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.

It will be apparent to those skilled in the art that the modules or steps of the embodiments of the application described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a storage device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than what is shown or described, or they may be separately fabricated into individual integrated circuit modules, or a plurality of modules or steps in them may be fabricated into a single integrated circuit module. Thus, embodiments of the application are not limited to any specific combination of hardware and software.

The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the application, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.

Claims

1. A method of task allocation, the method comprising:

2. The task allocation method according to claim 1, wherein said allocating a predetermined number of said tasks to a processor according to a task pool selected by the processor comprises:

3. The task allocation method according to claim 1, wherein said allocating a predetermined number of said tasks to a processor according to a task pool selected by the processor comprises:

4. The task allocation method according to claim 1, wherein said allocating a predetermined number of said tasks to a processor according to a task pool selected by the processor comprises:

5. The task allocation method according to claim 1, wherein said allocating a predetermined number of said tasks to a processor according to a task pool selected by the processor comprises:

6. The task allocation method according to claim 1, wherein said allocating a predetermined number of said tasks to a processor according to a task pool selected by the processor comprises:

and when no task exists in the task pool, a prompt is sent to the processor.

7. The task allocation method according to any one of claims 1 to 6, characterized in that the method comprises:

8. The task allocation method according to any one of claims 1 to 6, characterized in that the method further comprises:

the number of tasks completed by the processor is recorded.

9. The task allocation method according to any one of claims 1 to 8, characterized in that the method further comprises:

10. A task assigning apparatus, comprising:

11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor is adapted to implement the steps of the task allocation method of any one of claims 1 to 9 when the computer program is executed.

12. A computer-readable storage medium, having stored thereon a computer program executable by at least one processor to cause the at least one processor to perform the steps of the task allocation method of any of claims 1 to 9.