Method, device, and program product for managing multiple computing tasks based on batch

US12204934B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12204934-B2
Application numberUS-202117388644-A
CountryUS
Kind codeB2
Filing dateJul 29, 2021
Priority dateJun 24, 2021
Publication dateJan 21, 2025
Grant dateJan 21, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

The present disclosure relates to a method, a device, and a program product for managing multiple computing tasks on a batch basis. A method includes: identifying a task type of the multiple computing tasks in response to receiving a request to use a computing unit in a computing system to perform the multiple computing tasks; acquiring a scheduling time overhead incurred for scheduling the multiple computing tasks for execution by the computing unit; determining, based on the task type and the scheduling time overhead, a batch size for dividing the multiple computing tasks; and dividing the multiple computing tasks into at least one batch based on the batch size. A corresponding device and a corresponding computer program product are provided. With the example implementations of the present disclosure, the batch size for dividing multiple computing tasks can be dynamically determined, so that the performance of the computing system can meet user demands.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method, including: receiving a request to perform, using a computing system, a set of computing tasks; identifying a task type associated with the set of computing tasks; determining a scheduling time overhead associated with scheduling the set of computing tasks for execution, based at least in part on a difference between: a length of time between committing a computing task of the set of computing tasks and obtaining a processing result for the computing task; and a length of time during which the computing task is performed by the computing system; determining, based on the task type and the scheduling time overhead, a batch size for the set of computing tasks; dividing the set of computing tasks into at least one batch based on the batch size; and as a result of dividing the set of computing tasks into at least one batch, executing the set of computing tasks. 2. The method according to claim 1 , wherein identifying the task type is based on at least one of: throughput requirements or response latency requirements for the set of computing tasks. 3. The method according to claim 1 , wherein determining the batch size includes: acquiring a mapping model corresponding to the task type, the mapping model describing an association relationship between the task type, the scheduling time overhead of the computing system, and the batch size of the set of computing tasks; and determining the batch size based on the task type, the scheduling time overhead, and the mapping model. 4. The method according to claim 1 , wherein the scheduling time overhead is based at least in part on an operating state of the computing system. 5. The method according to claim 1 , wherein dividing the set of computing tasks into the at least one batch includes: adding a first computing task of the set of computing tasks to the at least one batch; and in response to determining that a sum of data volumes of computing tasks in the batch is not greater than the batch size, adding a second computing task of the set of computing tasks to the at least one batch. 6. The method according to claim 5 , further including: receiving a second request to use the computing system to perform a third computing task of the set of computing tasks; and adding the third computing task to the at least one batch. 7. The method according to claim 5 , further including: in response to determining that the sum of the data volumes of computing tasks in the at least one batch is greater than the batch size, committing the at least one batch to the computing system to cause the computing system to perform the set of computing tasks in the at least one batch. 8. The method according to claim 1 , further including: in response to determining that the set of computing tasks comprises a plurality of task types, creating a second batch, the second batch having a second batch size and associated with a second task type, the second task type different than that of the at least one batch; and dividing the set of computing tasks into the at least one batch and the second batch based at least in part on the plurality of task types. 9. The method according to claim 1 , wherein the method is performed based on at least one of: a change in a workload of the computing system; or a predetermined timer. 10. The method according to claim 1 , wherein the computing system includes at least one of a Quick Assist Technology accelerator and a central processing unit, the computing system includes a data protection system, and the set of computing tasks in the data protection system includes at least one of: a compression task, a decompression task, an encryption task, a decryption task, a hash task, a backup task, or a replication task. 11. An electronic device, including: at least one processor; and a memory coupled to the at least one processor, wherein the memory has instructions stored therein that, when executed by the at least one processor, cause the at least one processor to perform a method, the method including: receiving a request to perform, using a computing system, a set of computing tasks; identifying a task type associated with the set of computing tasks; determining a scheduling time overhead associated with scheduling the set of computing tasks for execution, based at least in part on a difference between: a length of time between committing a computing task of the set of computing tasks and obtaining a processing result for the computing task; and a length of time during which the computing task is performed by the computing system; determining, based on the task type and the scheduling time overhead, a batch size for the set of computing tasks; dividing the set of computing tasks into at least one batch based on the batch size; and as a result of dividing the set of computing tasks into at least one batch, executing the set of computing tasks. 12. The device according to claim 11 , wherein identifying the task type is based on at least one of: throughput requirements or response latency requirements for the set of tasks. 13. The device according to claim 11 , wherein determining the batch size includes: acquiring a mapping model corresponding to the task type, the mapping model describing an association relationship between the task type, the scheduling time overhead of the computing system, and the batch size of the set of computing tasks; and determining the batch size based on the task type, the scheduling time overhead, and the mapping model. 14. The device according to claim 11 , wherein the scheduling time overhead is based at least in part on an operating state of the computing system. 15. The device according to claim 11 , wherein dividing the set of computing tasks into the at least one batch includes: adding a first computing task of the set of computing tasks to the at least one batch; and in response to determining that a sum of data volumes of computing tasks in the batch is not greater than the batch size, adding a second computing task of the set of computing tasks to the at least one batch. 16. The device according to claim 15 , wherein the method further includes: receiving a second request to use the computing system to perform a third computing task of the set of computing tasks; and adding the third computing task to the at least one batch. 17. The device according to claim 15 , wherein the method further includes: in response to determining that the sum of the data volumes of computing tasks in the at least one batch is greater than the batch size, committing the at least one batch to the computing system to cause the computing system to perform the set of computing tasks in the at least one batch. 18. The device according to claim 11 , further including: in response to determining that the set of computing tasks comprises a plurality of task types, a second batch, the second batch having a second batch size and associated with a second task type, the second task type different than that of the at least one batch; and dividing the set of computing tasks into the at least one batch and the second batch based at least in part on the plurality of task types. 19. The device according to claim 11 , wherein: the device is started based on at least one of: a change in a workload of the computing system; or a predetermined timer; and the computing system includes at least one of a Quick Assist Technology accelerator and a central processing unit, the computing system includes a data protection

Assignees

Inventors

Classifications

  • Transaction processing · CPC title

  • the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title

  • G06F9/4881Primary

    Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

  • G06F9/4843Primary

    by program, e.g. task dispatcher, supervisor, operating system · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12204934B2 cover?
The present disclosure relates to a method, a device, and a program product for managing multiple computing tasks on a batch basis. A method includes: identifying a task type of the multiple computing tasks in response to receiving a request to use a computing unit in a computing system to perform the multiple computing tasks; acquiring a scheduling time overhead incurred for scheduling the mul…
Who is the assignee on this patent?
Emc Ip Holding Co Llc
What technology area does this patent fall under?
Primary CPC classification G06F9/4881. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 21 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).