WO2017166643A1 - Procédé et dispositif pour quantifier des ressources de tâche - Google Patents

Procédé et dispositif pour quantifier des ressources de tâche Download PDF

Info

Publication number
WO2017166643A1
WO2017166643A1 PCT/CN2016/096967 CN2016096967W WO2017166643A1 WO 2017166643 A1 WO2017166643 A1 WO 2017166643A1 CN 2016096967 W CN2016096967 W CN 2016096967W WO 2017166643 A1 WO2017166643 A1 WO 2017166643A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
processing device
resources
device group
task processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2016/096967
Other languages
English (en)
Chinese (zh)
Inventor
刘永华
王孝庆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Le Holdings Beijing Co Ltd
LeCloud Computing Co Ltd
Original Assignee
Le Holdings Beijing Co Ltd
LeCloud Computing Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Le Holdings Beijing Co Ltd, LeCloud Computing Co Ltd filed Critical Le Holdings Beijing Co Ltd
Publication of WO2017166643A1 publication Critical patent/WO2017166643A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083—Techniques for rebalancing the load in a distributed system
    • G06F9/5088—Techniques for rebalancing the load in a distributed system involving task migration
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/503—Resource availability

Definitions

  • the present disclosure relates to the field of data processing, for example, to a method and apparatus for quantifying task resources.
  • the performance of data processing equipment (hereinafter referred to as the device) has also been greatly improved.
  • the device can perform more and more tasks, and the number of executable tasks increases the device resources.
  • the utilization situation has attracted much attention.
  • a resource allocation scheme of the related art is to allocate a fixed number of tasks to the device, for example, allocating 12 tasks to the device.
  • Such resource allocation may cause the following two problems.
  • the 12 tasks may occupy a total of If there are few resources on the device, the remaining resources available in the device cannot be utilized, resulting in waste of resources.
  • the 12 tasks may occupy a lot of resources, and the available resources in the entire device are all 12 When the task is full, it will cause the device to run at high load, which will affect the performance of the device.
  • Embodiments of the present disclosure provide a method and apparatus for quantifying task resources, which are used to resolve existing resource points.
  • Embodiments of the present disclosure provide a method for quantifying task resources, including:
  • the task processing device group runs the assigned task, and records the evaluation parameter indicator processed by the task;
  • the theoretical quantity of resources occupied by each task is adjusted according to the preset amplitude, and the task is assigned to the task processing device group; the loop is stopped until the preset condition is met;
  • an optimal quantity of resources occupied by each task is determined; the optimal quantity is used for actual task distribution.
  • An embodiment of the present disclosure provides a device for quantifying task resources, including:
  • a task allocation unit configured to allocate a task according to a task flow sequence according to a task processing device group composed of the at least one task processing device according to a theoretical quantity of resources occupied by each task and a total resource amount of the single task processing device;
  • a recording unit configured to record an evaluation parameter indicator processed by the task when the task processing device group runs the assigned task
  • the adjusting unit is configured to adjust the theoretical quantity of resources occupied by each task according to the preset amplitude, and return to the task allocation unit; until the preset condition is met, the loop is stopped;
  • the determining unit is configured to determine an optimal amount of resources occupied by each task based on the optimal evaluation parameter indicator; the optimal amount is used for actual task distribution.
  • Embodiments of the present disclosure provide a non-transitory computer readable storage medium storing computer executable instructions that, when executed by an electronic device, cause the electronic device to perform the quantization method of the task resource described above.
  • Embodiments of the present disclosure provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer And causing the computer to perform the above-described quantification method of the task resource.
  • An embodiment of the present disclosure provides an electronic device including at least one processor and a memory communicatively coupled to the at least one processor, the memory for storing instructions executable by the at least one processor, the instructions being The at least one processor, when executed, causes the at least one processor to perform the quantization method of the task resource described above.
  • the method and device for quantifying task resources can continuously adjust the theoretical quantity of resources occupied by tasks, and distribute tasks according to the continuously adjusted theoretical quantity value to the task processing device group, and the task processing device group Run the distributed tasks and record the corresponding evaluation reference indicators to determine the optimal value of the resource value of each task corresponding to the optimal evaluation parameter indicator, so that the resources occupied by the task can be quantified.
  • the plurality of tasks that are distributed occupy the total amount of resources of the task processing device group, so that the waste of resources can be reduced, and the resources of the task processing device can be reasonably utilized; It can prevent the task from occupying all the resources of the task processing device, causing the device to run at a high load and ensuring the performance of the device.
  • Embodiment 1 is a flow chart of the steps of Embodiment 1 of a method for quantifying task resources according to the present disclosure
  • FIG. 2 is a schematic diagram of a broken line corresponding to an evaluation parameter indicator in an application example of an embodiment of the present disclosure
  • FIG. 3 is a flow chart of steps of a second embodiment of a method for quantifying task resources according to the present disclosure
  • Embodiment 4 is a schematic structural diagram of Embodiment 1 of a device for quantifying task resources according to the present disclosure
  • FIG. 5 is a schematic diagram of a hardware structure of an electronic device for quantifying task resources according to the present disclosure.
  • a flow chart of a first embodiment of a method for quantifying a task resource according to the present disclosure may be performed, and may include:
  • Step 101 According to a theoretical quantity of resources occupied by each task and a total resource quantity of a single task processing device, assign a task to the task processing device group composed of the at least one task processing device according to the task flow sequence;
  • the task type may include: transcoding, uploading, downloading, storing, etc.
  • the quantification method of the task resource may be used to quantify a type of task, and the one type of task may include multiple tasks. That is, the embodiments of the present disclosure may be applied to tasks such as transcoding, uploading, downloading, and storing of video and/or audio.
  • the embodiments of the present disclosure are mainly described by using transcoding as an example, and other task types may be cross-referenced. .
  • the foregoing resource type may include one or more of a memory, a CPU (Central Processing Unit), an I/O port (Input/Output), and a bandwidth.
  • a memory a central processing Unit
  • I/O port Input/Output
  • a bandwidth a bandwidth that is used by the resource type.
  • the embodiment mainly uses memory as an example, and other resource types can be referred to each other.
  • the theoretical quantity of resources occupied by each task can be occupied by each task.
  • the parameters such as the code rate and the number of CPU cores are calculated.
  • the process of calculating the theoretical value of the occupied memory by the code rate may include: Scencecut*Width*Height*3, where the above Width*Height refers to the resolution, and each pixel occupies the word.
  • the theoretical quantity value of each task occupying resources calculated by using the parameters such as the code rate and the number of CPU cores occupied by each task is only an example of a method for determining the theoretical quantity of the resource occupied by the task in the embodiment of the present disclosure. It is not understood as a limitation on the method for determining the theoretical quantity of the resource occupied by the task in the embodiment of the present disclosure. In fact, the embodiment of the present disclosure may also determine the optimal among the multiple running result data in the actual collection.
  • the resource size occupied by each task corresponding to the running result data is the theoretical quantity of the resource occupied by the task; the method of determining the theoretical quantity of the resource occupied by the task is not limited herein.
  • the task processing device group composed of the at least one task processing device may be assigned according to the task flow sequence.
  • the task is assigned to a single task processing device in the task processing device group according to the task flow sequence.
  • the total resource amount of all tasks assigned to the current task processing device is greater than or equal to the total resource amount of the current task processing device,
  • the percentage is preset, stop assigning tasks to the current task processing device and start assigning tasks to the next task processing device.
  • the occupied resources are memory
  • the theoretical quantities of the above five transcoding tasks occupy memory.
  • the values are A1 G, A2 G, A3 G, A4 G, and A5 G.
  • the current task processing device group consists of three task processing devices.
  • the total memory of each task processing device is X G, according to each transcoding.
  • the theoretical quantity of the resource occupied by the task and the total resource quantity of the single task processing device are the task processing device group composed of the at least one task processing device, and the process of assigning the task according to the task flow sequence is:
  • the task processing device 1 allocates A1 G memory for T1 and A3 G memory for T3.
  • T2 allocates the memory of A2G, and assumes that the ratio of the sum of the current A1, A3, and A2 to X is greater than or equal to the preset percentage W, then stops assigning tasks to the task processing device 1; continues to allocate A4G to the T4 in the task processing device 2.
  • Memory allocate A5 G memory for T5, allocate A2 G memory for T2, allocate A1 G memory for T1, assuming that the ratio of the current A4, A5, A2, A1 and X to the preset percentage W is stopped.
  • the task processing device 2 is assigned a task; in the task processing device 3, A4 G memory is allocated for T4, A3 G memory is allocated for T3, and A5 G memory is allocated for T5.
  • Step 102 The task processing device group runs the assigned task, and records the evaluation parameter indicator of the task processing.
  • the evaluation parameter indicator of the task processing may be used to evaluate the performance of the current task processing device group during operation, that is, when the evaluation parameter index is large, the performance of the current task processing device group is better.
  • the evaluation parameter indicator of the task processing may include: a throughput of the task processing device group, and/or a processing speed of the task processing device group,
  • the evaluation parameter index is taken as an example for example, and the parameter parameter is the cross-reference of the processing speed;
  • the task type is the evaluation parameter index of the task processing when uploading, downloading, and storing.
  • the method may include: an evaluation parameter indicator corresponding to the upload task type: an upload speed (file size/upload time); an evaluation parameter indicator corresponding to the download task type: download speed (file size/download time); upload (finished product storage) task type Corresponding evaluation parameter indicator: upload speed (finished product size / upload time).
  • Step 103 Adjust the theoretical quantity of resources occupied by each task according to the preset amplitude, and return to assign tasks to the task processing device group; stop the loop until the preset condition is met;
  • adjusting the theoretical quantity of resources occupied by each task according to the preset amplitude may include: increasing or decreasing the theoretical quantity of resources occupied by each task by a preset amplitude; occupying resources for each task
  • the process returns to step 101, that is, according to the adjusted theoretical quantity value, the task processing device group assigns tasks according to the task flow order.
  • the theoretical quantities of occupied resources are A1 and A2 respectively.
  • the preset amplitude is t
  • the theoretical quantities of resources occupied by tasks T and T2 are adjusted according to the preset amplitude.
  • the theoretical value of T occupied resources as A1 + t
  • adjust the theoretical value of T2 occupied resources as A2+t (or adjust the theoretical value of T occupied resources to A1-t, adjust the theoretical value of T2 occupied resources) A2-t)
  • the theoretical quantity of resources occupied by tasks T and T2 (A1+t, A2+t or A1-t, A2-t) and the total resource amount of a single task processing device, for the at least one task Processing a task processing device group composed of devices, and assigning tasks according to task flow order;
  • the task processing device group After the task processing device group runs the assigned task, after recording the evaluation parameter indicators processed by the task, the theoretical value of the resource occupied by the task T and T2 is continuously adjusted according to the preset amplitude, which may be: adjusting the theoretical value of the occupied resource of T A1+2 ⁇ t, the theoretical value of adjusting the resource occupied by T2 is A2+2 ⁇ t (or the theoretical value of adjusting the resource occupied by T is A1-2 ⁇ t, and the theoretical value of adjusting the resource occupied by T2 is A2-2 ⁇ t), according to the theoretical quantity of resources occupied by tasks T and T2 (A1+2 ⁇ t, A2+2 ⁇ t or A1-2 ⁇ t, A2-2 ⁇ t) and the total resources of a single task processing device,
  • the task processing device group composed of the at least one task processing device allocates tasks according to the task flow order; stops the loop until the preset condition is met, that is, stops adjusting the theoretical quantity of the resource occupied by the task when the preset condition is met.
  • the foregoing preset conditions may include:
  • the task processing device group running time meets a preset running time
  • the number of adjustments to the theoretical magnitude of the resources occupied by each task satisfies the preset number of adjustments.
  • the preset running time is three months
  • the theoretical quantity of the resource occupied by the task may be stopped; or, the preset running times are assumed.
  • the theoretical value of the resource occupied by the task can be stopped; or, if the preset adjustment number is 30 times, then When the number of adjustments of the theoretical amount of resources occupied by the task reaches 30 times, the theoretical value of the resource occupied by the task can be stopped.
  • the preset running time is three months, the preset running times are 100 times, and the preset adjustment times are 30 times, which are only used as the preset running time, the preset running times, and the preset adjustment times in the embodiment of the present disclosure.
  • An example is not to be construed as limiting the preset running time, the preset running times, and the preset adjustment times in the embodiment of the present disclosure.
  • the preset running time, the preset running times, and the preset adjustment times may be The technical personnel in the field determine the self-determination according to the business requirements.
  • the preset operating time, the preset running times, and the preset adjustment times are not limited herein.
  • Step 104 Determine an optimal quantity of resources occupied by each task based on an optimal evaluation parameter indicator; the optimal quantity is used for actual task distribution.
  • each time the task processing device group runs the evaluation parameter indicator of the task processing is recorded until the theoretical quantity of the task occupation resource is stopped, and the evaluation parameter indicator of the task processing recorded at this time includes multiple Data, from the plurality of data, selecting an optimal evaluation parameter indicator, and determining a theoretical quantity of resources occupied by each task corresponding to the evaluation parameter indicator as an optimal quantity of resources occupied by each task;
  • the task is a transcoding task for the video.
  • tasks T1, T2, and T3 exist, and the theoretical values of the corresponding task memory are 1G, 2G, and 2G, respectively, according to tasks T1, T2, and T3.
  • the theoretical amount of memory usage 1G, 2G, and 2G and the total memory of a single task processing device are task processing device groups, tasks are assigned according to task flow order, task processing device group runs assigned tasks, and task evaluation parameters are recorded.
  • A1 (in this example, the parameter is evaluated as throughput) is 1000 hours;
  • the theoretical values of the occupied memory of tasks T1, T2 and T3 are adjusted. Assuming the preset amplitude is 0.2G, the theoretical values of the occupied memory of the adjusted tasks T1, T2 and T3 are 1.2G, 2.2G and respectively. 2.2G, according to the theoretical values of the memory occupied by tasks T1, T2 and T3, 1.2G, 2.2G and 2.2G and the total memory of a single task processing device, for the task processing device group, assign tasks according to the task flow sequence, task processing device group Run the assigned task, record the throughput of the task processing a2 is 1300 hours;
  • T1 The theoretical values of the occupied memory of tasks T1, T2 and T3 are adjusted, and the theoretical values of the occupied memories of the adjusted tasks T1, T2 and T3 are respectively 1.4G, 2.4G and 2.4G, according to tasks T1 and T2.
  • T3 occupy the theoretical value of memory 1.4G, 2.4G and 2.4G and the total memory of a single task processing device, for the task processing device group, assign tasks according to the task flow sequence, task processing device group runs the assigned tasks, record tasks The throughput a3 of processing is 1800 hours;
  • the theoretical values of the occupied memory of tasks T1, T2 and T3 are adjusted, and the theoretical quantities of the occupied memories of the adjusted tasks T1, T2 and T3 are 1.6G, 2.6G and 2.6G, respectively, according to tasks T1 and T2.
  • T3 occupy the theoretical value of memory 1.6G, 2.6G and 2.6G and the total memory of a single task processing device, for the task processing device group, assign tasks according to the task flow sequence, task processing device group runs the assigned tasks, record tasks
  • the processing throughput a4 is 1400 hours. If the preset adjustment times are 3 times, the number of adjustments to the theoretical amount of memory occupied by each task satisfies the preset adjustment number, and the theoretical value of the task occupied memory is stopped. ;
  • FIG. 2 a schematic diagram of a broken line corresponding to an evaluation parameter indicator in an application example of an embodiment of the present disclosure is shown; it can be seen that among the evaluation parameter indicators a1 to a4 of the recorded task processing, the optimal evaluation parameter indicator is a3, a3 corresponding to The theoretical values of the occupied memory of T1, T2 and T3 are 1.4G, 2.4G and 2.4G, respectively. It is determined that the optimal values of the occupied memory of T1, T2 and T3 are 1.4G, 2.4G and 2.4G respectively, and after determining the optimal magnitude of the resources occupied by T1, T2 and T3, the task can be processed according to the above optimal amount.
  • the group performs the distribution of tasks.
  • the resource in the above example is only one example of the task type in the embodiment of the present disclosure.
  • the task type may further include one or more of a CPU, an I/O, and a bandwidth.
  • the example does not limit the type of resource.
  • the embodiment of the present disclosure is described based on the case where the resource occupied by each task is a fixed value. In fact, the embodiment of the present disclosure is also applicable to the case where the resource occupied by each task is a non-fixed value, and the process can be referred to each other. The embodiments of the present disclosure will not be described again.
  • a method for quantifying task resources may adjust a theoretical quantity of resources occupied by each task, and distribute tasks according to the continuously adjusted theoretical quantity value, and the task processing is performed by the task processing device group.
  • the device group runs the tasks distributed, and records the corresponding evaluation reference indicators, and determines the theoretical value of each resource occupied by the optimal evaluation parameter indicator as the optimal value, so that each task occupies
  • the resources are known. Therefore, when the tasks are distributed for the task processing device group, the distributed tasks occupy the total amount of resources of the task processing device, so that the waste of resources can be reduced, and the resources of the task processing device can be reasonably utilized.
  • the embodiment of the present disclosure can avoid the problem that the task fills up all the resources of the task processing device, causing the device to operate at a high load, and thus can ensure the performance of the device.
  • a flow chart of the steps of the second embodiment of the method for quantifying the task resource of the present disclosure may be included, which may include:
  • Step 301 According to a theoretical quantity of resources occupied by each task and a total resource quantity of a single task processing device, a task processing device group composed of the at least one task processing device, according to a task flow sequence Assignments;
  • Step 302 The task processing device group runs the assigned task, records the evaluation parameter indicator of the task processing, and the processing speed of each task;
  • Step 303 Determine that the processing speed is less than the processing speed empirical value of the task is a task to be adjusted
  • the actual running result data may be collected, and the running result data may include the processing speed of each task, and the optimal processing speed of each task is determined as the processing speed empirical value of each task. .
  • the processing speed of the recorded task when the processing speed of the recorded task is less than the processing speed empirical value of the task, indicating that the resource allocated for the current task is unreasonable, the theoretical quantity of the resource occupied by the task should be adjusted;
  • the processing speed of the recorded task is greater than or equal to the processing speed empirical value of the task, it indicates that the resource allocated for the current task is reasonable, and the theoretical quantity of the resource occupied may not be adjusted.
  • Step 304 Adjust a theoretical quantity value of each of the resources to be adjusted for the task to be adjusted according to a preset amplitude, and return a task for the task processing device group; stop the loop until the preset condition is met;
  • Step 305 Determine an optimal quantity of resources occupied by each task based on the optimal evaluation parameter indicator; the optimal quantity is used for actual task distribution.
  • step 303 and step 304 are performed.
  • the adjustment of the theoretical quantity of resources occupied by each task according to the preset amplitude is refined, so that when the theoretical value of the resource occupied by the task is adjusted, only the task that needs to be adjusted by the theoretical value can be adjusted. It is not necessary to adjust the theoretical magnitude of the resources occupied by all tasks.
  • FIG. 4 is a schematic structural diagram of Embodiment 1 of a device for quantifying a task resource according to the present disclosure, which may include: a task allocating unit 401, a recording unit 402, an adjusting unit 403, and a determining unit 404;
  • the task allocation unit 401 may be configured to allocate, according to the theoretical quantity of resources occupied by each task and the total resource amount of the single task processing device, the task processing device group composed of the at least one task processing device according to the task flow order. task;
  • the recording unit 402 may be configured to record an evaluation parameter indicator of the task processing when the task processing device group runs the assigned task;
  • the adjusting unit 403 may be configured to adjust the theoretical quantity of resources occupied by each task according to the preset amplitude, and return to the task allocation unit; and stop the loop until the preset condition is met;
  • the determining unit 404 may be configured to determine an optimal magnitude of resources occupied by each task based on the optimal evaluation parameter indicator; the optimal amount is used for actual task distribution.
  • the task type may include: transcoding, uploading, downloading, and storing, and the quantifying method of the task resource is used to quantize a type of task, in the one type of task. Contains a variety of tasks.
  • the preset condition may include:
  • the task processing device group running time meets a preset running time
  • the number of adjustments to the theoretical magnitude of the resources occupied by each task satisfies the preset number of adjustments.
  • the task type is transcoding
  • the evaluation parameter indicator of the task processing may include: a throughput of the task processing device group, and/or the task processing device The processing speed of the group.
  • the resource may include one or more of a memory, a CPU, an IO, and a bandwidth.
  • the recording unit 402 may be further configured to record the processing speed of each task
  • the adjusting unit 403 may include:
  • the theoretical quantity subunit is adjusted to be configured to adjust the theoretical quantity of resources occupied by each of the to-be-adjusted tasks according to a preset amplitude.
  • the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.
  • the embodiment of the present application provides a non-volatile computer storage medium, where the computer storage medium stores computer executable instructions for performing any of the embodiments of the present application.
  • a quantitative method of task resources is provided.
  • FIG. 5 is a schematic diagram of a hardware structure of an electronic device for quantifying a task resource according to the present disclosure. As shown in FIG. 5, the electronic device includes:
  • processors 510 and memory 520 one processor 510 is taken as an example in FIG.
  • the apparatus for performing the quantization method of the task resource may further include: an input device 530 and an output device 540.
  • the processor 510, the memory 520, the input device 530, and the output device 540 may be connected by a bus or other means, as exemplified by a bus connection in FIG.
  • the memory 520 is a non-volatile computer readable storage medium, and is applicable to a non-volatile software program, a non-volatile computer-executable program, and a module, such as a method for quantifying task resources in the embodiment of the present application.
  • Program instructions/modules for example, task assignment unit 401, recording unit 402, adjustment unit 403, and determination unit 404 shown in FIG. 4).
  • the processor 510 executes various functional applications and data processing of the server by running non-volatile software programs, instructions, and modules stored in the memory 520, that is, a method for quantifying the task resources of the foregoing method embodiments.
  • the memory 520 may include a storage program area and an storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created by use of a quantization device of the task resource, and the like. Further, the memory 520 may include a high speed random access memory, and may also include a nonvolatile memory such as at least one magnetic disk storage device, flash memory device, or other nonvolatile solid state storage device. In some embodiments, memory 520 can optionally include memory remotely located relative to processor 510, which can be connected to a quantification device of task resources over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • Input device 530 can receive input numeric or character information and generate key signal inputs related to user settings and function control of the quantization device of the task resource.
  • Output device 540 can include a display Such as display devices.
  • the one or more modules are stored in the memory 520, and when executed by the one or more processors 510, perform a quantization method of task resources in any of the above method embodiments.
  • the electronic device of the embodiment of the present application exists in various forms, including but not limited to:
  • Mobile communication devices These devices are characterized by mobile communication functions and are mainly aimed at providing voice and data communication.
  • Such terminals include: smart phones (such as iPhone), multimedia phones, functional phones, and low-end phones.
  • Ultra-mobile personal computer equipment This type of equipment belongs to the category of personal computers, has computing and processing functions, and generally has mobile Internet access.
  • Such terminals include: PDAs, MIDs, and UMPC devices, such as the iPad.
  • Portable entertainment devices These devices can display and play multimedia content. Such devices include: audio, video players (such as iPod), handheld game consoles, e-books, and smart toys and portable car navigation devices.
  • the server consists of a processor, a hard disk, a memory, a system bus, etc.
  • the server is similar to a general-purpose computer architecture, but because of the need to provide highly reliable services, processing power and stability High reliability in terms of reliability, security, scalability, and manageability.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may be or It may not be a physical unit, that is, it may be located in one place, or it may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to implement the solution of the embodiment. Those of ordinary skill in the art can understand and implement without deliberate labor.
  • the present invention solves the problem of waste of resources in the existing resource allocation and the problem that affects the performance of the device, can reasonably utilize resources, and can ensure the performance of the device.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Debugging And Monitoring (AREA)

Abstract

L'invention concerne un procédé et un dispositif pour quantifier des ressources de tâche. Le procédé consiste à : affecter, selon une valeur de quantité théorique de ressources occupées par chaque tâche et une quantité totale de ressources d'un dispositif de traitement de tâche unique, une tâche à un groupe de dispositifs de traitement de tâche consistant en au moins un dispositif de traitement de tâche sur la base d'un ordre chronologique de tâche (101) ; exécuter, par le groupe de dispositifs de traitement de tâche, la tâche affectée, et enregistrer un indice de paramètre d'évaluation de traitement de tâche (102) ; ajuster la valeur de quantité théorique de ressources occupées par chaque tâche selon une amplitude préréglée, retourner à l'étape d'affectation de la tâche au groupe de dispositifs de traitement de tâche, et arrêter la circulation jusqu'à ce qu'une condition prédéfinie soit satisfaite (103) ; et déterminer, sur la base d'un indice de paramètre d'évaluation optimal, une valeur de quantité optimale de ressources occupées par chaque tâche, la valeur de quantité optimale étant utilisée pour une distribution de tâche réelle (104). Le procédé permet l'utilisation rationnelle de ressources et peut garantir les performances d'un dispositif.
PCT/CN2016/096967 2016-03-31 2016-08-26 Procédé et dispositif pour quantifier des ressources de tâche Ceased WO2017166643A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610201629.1 2016-03-31
CN201610201629.1A CN105843687A (zh) 2016-03-31 2016-03-31 一种任务资源的量化方法和装置

Publications (1)

Publication Number Publication Date
WO2017166643A1 true WO2017166643A1 (fr) 2017-10-05

Family

ID=56596526

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/096967 Ceased WO2017166643A1 (fr) 2016-03-31 2016-08-26 Procédé et dispositif pour quantifier des ressources de tâche

Country Status (2)

Country Link
CN (1) CN105843687A (fr)
WO (1) WO2017166643A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110084476A (zh) * 2019-03-25 2019-08-02 平安科技（深圳）有限公司 案件调整方法、装置、计算机设备和存储介质
CN111124644A (zh) * 2019-12-19 2020-05-08 北京旷视科技有限公司 任务调度资源的确定方法、装置及系统
CN111381960A (zh) * 2018-12-29 2020-07-07 中兴通讯股份有限公司 终端任务的处理方法、装置、存储介质及电子装置
CN111813557A (zh) * 2020-07-21 2020-10-23 北京千丁互联科技有限公司 任务处理装置、方法、终端设备和可读存储介质
CN112685180A (zh) * 2020-12-29 2021-04-20 杭州海康威视数字技术股份有限公司 计算单元分配方法、装置及计算单元分配系统
CN113703975A (zh) * 2021-08-27 2021-11-26 创新奇智(重庆)科技有限公司 模型分配方法、装置、电子设备及计算机可读存储介质
CN115248731A (zh) * 2021-04-27 2022-10-28 中移(苏州)软件技术有限公司 一种资源部署方法及设备、存储介质
CN115269014A (zh) * 2022-09-26 2022-11-01 上海登临科技有限公司 一种指令调度方法、芯片及电子设备
CN115756773A (zh) * 2022-11-01 2023-03-07 中电金信软件有限公司 任务调度方法、装置、电子设备和存储介质
CN116449935A (zh) * 2023-06-02 2023-07-18 工业富联(佛山)创新中心有限公司 集群节能管理方法、电子设备及计算机存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105843687A (zh) * 2016-03-31 2016-08-10 乐视控股（北京）有限公司 一种任务资源的量化方法和装置
CN106454402B (zh) * 2016-08-31 2018-11-23 腾讯科技（深圳）有限公司 转码任务调度方法和装置
CN107220115A (zh) * 2017-05-25 2017-09-29 深信服科技股份有限公司 一种基于云平台的任务瓶颈确定方法及装置
CN111031350B (zh) * 2019-12-24 2022-04-12 北京奇艺世纪科技有限公司 转码资源调度方法、电子设备及计算机可读存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110225590A1 (en) * 2010-03-15 2011-09-15 Thomson Steven S System and method of executing threads at a processor
CN103903070A (zh) * 2014-04-15 2014-07-02 广东电网公司信息中心 应用系统资源需求测算系统
CN104391749A (zh) * 2014-11-26 2015-03-04 北京奇艺世纪科技有限公司 一种资源分配方法及装置
CN105843687A (zh) * 2016-03-31 2016-08-10 乐视控股（北京）有限公司 一种任务资源的量化方法和装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007072544A1 (fr) * 2005-12-20 2007-06-28 Fujitsu Limited Appareil de traitement d’informations, ordinateur, méthode d’affectation de ressources et programme d’affectation de ressources
KR101436339B1 (ko) * 2010-09-15 2014-09-01 엠파이어 테크놀로지 디벨롭먼트 엘엘씨 클라우드 컴퓨팅 환경에서의 태스크 할당
CN102360313B (zh) * 2011-09-29 2014-03-26 中国科学技术大学苏州研究院 片上异构多核计算平台的性能加速方法
CN103729246B (zh) * 2013-12-31 2017-05-03 浪潮(北京)电子信息产业有限公司 一种任务调度方法和装置
CN103986669B (zh) * 2014-05-07 2017-04-19 华东师范大学 一种云计算中资源分配策略的评估方法
CN103995749B (zh) * 2014-05-21 2017-06-16 广东省电信规划设计院有限公司 小区云系统的计算任务分配方法和系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110225590A1 (en) * 2010-03-15 2011-09-15 Thomson Steven S System and method of executing threads at a processor
CN103903070A (zh) * 2014-04-15 2014-07-02 广东电网公司信息中心 应用系统资源需求测算系统
CN104391749A (zh) * 2014-11-26 2015-03-04 北京奇艺世纪科技有限公司 一种资源分配方法及装置
CN105843687A (zh) * 2016-03-31 2016-08-10 乐视控股（北京）有限公司 一种任务资源的量化方法和装置

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111381960A (zh) * 2018-12-29 2020-07-07 中兴通讯股份有限公司 终端任务的处理方法、装置、存储介质及电子装置
CN110084476B (zh) * 2019-03-25 2024-05-07 平安科技（深圳）有限公司 案件调整方法、装置、计算机设备和存储介质
CN110084476A (zh) * 2019-03-25 2019-08-02 平安科技（深圳）有限公司 案件调整方法、装置、计算机设备和存储介质
CN111124644B (zh) * 2019-12-19 2023-04-04 北京旷视科技有限公司 任务调度资源的确定方法、装置及系统
CN111124644A (zh) * 2019-12-19 2020-05-08 北京旷视科技有限公司 任务调度资源的确定方法、装置及系统
CN111813557A (zh) * 2020-07-21 2020-10-23 北京千丁互联科技有限公司 任务处理装置、方法、终端设备和可读存储介质
CN112685180A (zh) * 2020-12-29 2021-04-20 杭州海康威视数字技术股份有限公司 计算单元分配方法、装置及计算单元分配系统
CN112685180B (zh) * 2020-12-29 2023-10-10 杭州海康威视数字技术股份有限公司 计算单元分配方法、装置及计算单元分配系统
CN115248731A (zh) * 2021-04-27 2022-10-28 中移(苏州)软件技术有限公司 一种资源部署方法及设备、存储介质
CN113703975A (zh) * 2021-08-27 2021-11-26 创新奇智(重庆)科技有限公司 模型分配方法、装置、电子设备及计算机可读存储介质
CN115269014B (zh) * 2022-09-26 2022-12-30 上海登临科技有限公司 一种指令调度方法、芯片及电子设备
CN115269014A (zh) * 2022-09-26 2022-11-01 上海登临科技有限公司 一种指令调度方法、芯片及电子设备
CN115756773B (zh) * 2022-11-01 2023-08-29 中电金信软件有限公司 任务调度方法、装置、电子设备和存储介质
CN115756773A (zh) * 2022-11-01 2023-03-07 中电金信软件有限公司 任务调度方法、装置、电子设备和存储介质
CN116449935A (zh) * 2023-06-02 2023-07-18 工业富联(佛山)创新中心有限公司 集群节能管理方法、电子设备及计算机存储介质
CN116449935B (zh) * 2023-06-02 2023-11-21 工业富联(佛山)创新中心有限公司 集群节能管理方法、电子设备及计算机存储介质

Also Published As

Publication number Publication date
CN105843687A (zh) 2016-08-10

Similar Documents

Publication Publication Date Title
WO2017166643A1 (fr) Procédé et dispositif pour quantifier des ressources de tâche
US11861410B2 (en) Cloud computing burst instance management through transfer of cloud computing task portions between resources satisfying burst criteria
CN109783224B (zh) 基于负载调配的任务分配方法、装置及终端设备
US20150295970A1 (en) Method and device for augmenting and releasing capacity of computing resources in real-time stream computing system
CN106201661B (zh) 用于弹性伸缩虚拟机集群的方法和装置
CN103763346B (zh) 一种分布式资源调度方法及装置
US9454407B2 (en) Service resource allocation
CN104243405B (zh) 一种请求处理方法、装置及系统
US10783002B1 (en) Cost determination of a service call
CN113835865B (zh) 一种任务部署方法和装置、电子设备和存储介质
US20170185454A1 (en) Method and Electronic Device for Determining Resource Consumption of Task
US20140282540A1 (en) Performant host selection for virtualization centers
CN107818013A (zh) 一种应用调度方法及装置
CN115080220B (zh) 云资源分配方法及设备
US9742684B1 (en) Adaptive service scaling
CN109189572B (zh) 一种资源预估方法及系统、电子设备和存储介质
CN108376103A (zh) 一种云平台的资源平衡控制方法及服务器
CN108241535B (zh) 资源管理的方法、装置及服务器设备
CN112988383A (zh) 一种资源分配方法、装置、设备以及存储介质
CN108429704B (zh) 一种节点资源分配方法及装置
CN117687767A (zh) 一种资源规划的方法、装置及相关设备
CN109445863B (zh) 一种基于fpga的数据处理方法、装置、设备及介质
CN114629960B (zh) 资源调度方法、装置、系统、设备、介质和程序产品
CN113656046B (zh) 一种应用部署方法和装置
CN113742067A (zh) 剩余资源上报和图片分析任务调度方法、装置及设备

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16896413

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16896413

Country of ref document: EP

Kind code of ref document: A1