CN111880933B - Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform - Google Patents
Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform Download PDFInfo
- Publication number
- CN111880933B CN111880933B CN202010731008.0A CN202010731008A CN111880933B CN 111880933 B CN111880933 B CN 111880933B CN 202010731008 A CN202010731008 A CN 202010731008A CN 111880933 B CN111880933 B CN 111880933B
- Authority
- CN
- China
- Prior art keywords
- task
- hardware task
- hardware
- record table
- reconfigurable
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The application discloses a reconfigurable hardware task dynamic allocation method based on heterogeneous computing platforms, which relates to the technical field of computers, and aims to acquire the placement position of a newly arrived hardware task on a reconfigurable chip through rectangular vertexes, improve the instantaneity of the hardware task by adopting the earliest and latest starting time priority principle, execute the resource recovery task of the completed hardware task by adopting the idea of configuration reuse, reduce the rejection rate of hardware task allocation, improve the utilization rate of the reconfigurable chip, reduce the expenditure of the computing platform, support two-dimensional reconfigurable hardware tasks and improve the scheduling efficiency.
Description
Technical Field
The application relates to the technical field of computers, in particular to a reconfigurable hardware task dynamic allocation method based on a heterogeneous computing platform.
Background
In computing platforms for aerospace applications, the hardware tasks that need to be distributed encompass traditional real-time control-type hardware tasks, integer-computing-intensive hardware tasks, floating-point-computing-intensive hardware tasks, communication-intensive hardware tasks, I/O-intensive hardware tasks, and combinations of various types of hardware tasks. The demands of different types of hardware tasks on computing platforms vary greatly.
The simplest and direct reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform is a queuing-based first-come first-serve method, i.e. when a new hardware task arrives, whether available resources exist is checked, if yes, the hardware task is accepted, otherwise, the hardware task is refused. However, the distribution quality of the method is poor, and the ideal distribution method should satisfy the following conditions: the allocation method should be searchable and maximally guarantee the resource requirements of subsequent hardware tasks as long as there is sufficient capacity of empty configurable space in the reconfigurable device or before the latest start time of the task.
The existing dynamic allocation technical means for reconfigurable hardware tasks on chips mainly adopts a module clearance minimization method, and the method utilizes a two-dimensional space-time coordinate system to express the relation between the tasks and time. The vertical axis represents the task execution time, the horizontal axis represents the space occupied by the task, and the whole distribution process is the process that the task continuously extends upwards. Selecting the optimal layout position and starting time for the newly arrived hardware task in two steps: finding all possible allocations meeting deadline constraints for newly arrived hardware tasks; of all possible allocations, the optimal one is selected. The main disadvantages of this method are as follows:
(1) The condition of configuration reuse is not considered, and under the condition of more periodic tasks, the cost of the computing platform is increased;
(2) Allocation is based on slack time, one important assumption being that the execution time of hardware tasks is fixed and predictable, otherwise the allocation method degrades into non-real-time allocation. In an actual computing scene, hardware tasks and software tasks are quite different, the hardware tasks often repeatedly execute data-driven tasks to complete a large number of data processing tasks, and the flexibility requirement is low. Because the data to be processed is usually related to the environment, the execution time of the hardware task cannot be accurately obtained in advance, and the rejection rate of the hardware task allocation is high;
(3) When the method is extended to a two-dimensional reconfigurable hardware task, the complexity and the cost of the method are obviously increased, and the distribution efficiency is lower.
Disclosure of Invention
In order to solve the defects in the prior art, the embodiment of the application provides a reconfigurable hardware task dynamic allocation method based on a heterogeneous computing platform, which comprises the following steps:
s1, judging whether a hardware task Ti is a hardware task which is just executed and completed, if so, deleting the hardware task Ti from an activity record table A and inserting the hardware task Ti into a completed task record table F, updating a rectangular vertex layout record table C, and turning to a step S2;
s2, taking out a hardware task Tj from the waiting record table W, judging whether a rectangle capable of accommodating the hardware task Tj exists in the completed task record table F, if so, moving the hardware task Tj from the completed task record table F to the activity record table A, updating a rectangular vertex layout record table C, activating the hardware task Tj, and if not, turning to a step S3;
s3, judging whether the current time exceeds the latest starting time of the hardware task Tj, if so, refusing to schedule the hardware task Tj and deleting the hardware task Tj, and if not, turning to step S4;
s4, judging whether the hardware task Tj can be distributed in the idle rectangular vertex record table B, if so, distributing the hardware task Tj into the idle rectangular vertex record table B by using a dynamic reconfigurable resource distribution method, and transferring to the step S6, and if not, transferring to the step S5;
s5, searching a replaceable hardware task Tk of the hardware task Tj from the completed task record table F according to the earliest and latest priority principle, deleting the hardware task Tk from the completed task record table F, updating the idle rectangular vertex record table B, and arranging the hardware task Tj into the idle rectangular vertex record table B by using a dynamic reconfigurable resource arrangement method and transferring to the step S6;
s6, inserting the hardware task Tj into the activity record table A, updating the rectangular vertex layout record table C, and activating the hardware task Tj;
s7, repeating the steps S1-S6 until all hardware tasks in the waiting record table W are scanned.
Preferably, when the replaceable hardware task Tk of the hardware task Tj is not found in the completed task record table F, whether the hardware task Tj is allocatable in the rectangular vertex layout record table C is judged, if yes, the hardware task Tj is laid out in the rectangular vertex layout record table C by using a dynamic reconfigurable resource layout method, the hardware task overlapping with the hardware task Tj in the completed task record table F is deleted, and the spare rectangular vertex record table B is updated, and the step S6 is shifted.
Preferably, determining whether the hardware task Tj is allocatable in the rectangular vertex layout record table C includes:
if not, the hardware task Tj is notified to wait and repeat steps S2-S6.
Preferably, searching the hardware task Tj for the replaceable hardware task Tk of the hardware task Tj from the completed task record table F according to the earliest and latest priority principle comprises:
and searching a rectangle which is earliest to complete and can accommodate the hardware task Tj from the completed task record list F, taking the hardware task positioned on the rectangle as a replaceable hardware task Tk of the hardware task Tj, replacing the hardware task Tk by the hardware task Tj and updating the rectangle vertex layout record list C.
Preferably, determining whether the hardware task Ti is a hardware task that has just ended includes:
if not, the hardware tasks Ti are sequentially inserted into the waiting record table W according to the sequence of the latest starting time, and the steps S2-S6 are repeated.
The reconfigurable hardware task dynamic allocation method based on the heterogeneous computing platform provided by the embodiment of the application has the following beneficial effects:
the placement position of the newly arrived hardware task on the reconfigurable chip is obtained through the rectangular vertex, the earliest and latest starting time priority principle is adopted, the instantaneity of the hardware task is improved, the resource recovery task of the completed hardware task is executed by adopting the idea of configuration reuse, the rejection rate of hardware task allocation is reduced, the utilization rate of the reconfigurable chip is improved, the expenditure of a computing platform is reduced, the two-dimensional reconfigurable hardware task is supported, and the scheduling efficiency is higher.
Drawings
Fig. 1 is a schematic flow chart of a reconfigurable hardware task dynamic allocation method based on a heterogeneous computing platform according to an embodiment of the present application.
Detailed Description
The application is described in detail below with reference to the drawings and the specific embodiments.
Interpretation of the terms
Dynamically reconfigurable: the dynamic reconfiguration is also called as reconfiguration in running, which means that different configuration information is input or exchanged for reconfigurable hardware in the running of the system, and the structure of the hardware is changed in real time so as to adapt to different hardware layouts, thereby having higher chip utilization rate and system running efficiency;
reconfigurable chip: is meant to be made up of a number of minimum reconfigurable logic cells and interconnect logic therebetween;
reconfigurable logic unit: the minimum unit of the reconfigurable chip configuration is defined, and when the circuit function is changed slightly, the system at least needs to be configured;
hardware tasks: typically, the functional module, typically a rectangular block, that can be configured into the reconfigurable device after synthesis;
the dynamic reconfigurable resource layout method comprises the following steps: according to the method, new hardware tasks can be laid out in a matrix form according to the current resource distribution condition of the reconfigurable chip, so that the resources of the reconfigurable chip can be fully utilized.
The reconfigurable hardware task dynamic allocation method based on the heterogeneous computing platform provided by the embodiment of the application comprises the following steps:
s101, judging whether the hardware task Ti is the hardware task which is just executed and completed, if so, deleting the hardware task Ti from the activity record table A and inserting the hardware task Ti into the completed task record table F, updating the rectangular vertex layout record table C, and turning to the step S102.
Wherein, the vertices in the completed task record table F are not reassignable and can only be reused. Therefore, after the space is found in the completed task record table F, the space is released to be in an idle state, and then the space is de-allocated to the idle rectangular vertex record table B.
S102, taking out a hardware task Tj from the waiting record list W, judging whether a rectangle capable of accommodating the hardware task Tj exists in the completed task record list F, if so, moving the hardware task Tj from the completed task record list F to the activity record list A, updating the rectangular vertex layout record list C, activating the hardware task Tj, and if not, turning to step S103.
S103, judging whether the current time exceeds the latest starting time of the hardware task Tj, if so, refusing to schedule the hardware task Tj and deleting the hardware task Tj, and if not, proceeding to step S104.
If the hardware task Tj cannot be allocated before the latest start time, the real-time performance of the hardware task cannot be guaranteed, so that the hardware task is rejected and cannot be scheduled.
S104, judging whether the hardware task Tj can be distributed in the idle rectangular vertex record table B, if so, laying out the hardware task Tj into the idle rectangular vertex record table B by using a dynamic reconfigurable resource layout method, and turning to the step S106, and if not, turning to the step S105.
The purpose of this step is to keep the tasks that have been performed on the reconfigurable device as much as possible, and to increase the allocation hit rate.
S105, searching the replaceable hardware task Tk of the hardware task Tj from the completed task record list F according to the earliest and latest priority principle, deleting the hardware task Tk from the completed task record list F, updating the idle rectangular vertex record list B, and arranging the hardware task Tj into the idle rectangular vertex record list B by using a dynamic reconfigurable resource arrangement method and turning to the step S106.
S106, inserting the hardware task Tj into the activity record table A, updating the rectangular vertex layout record table C, and activating the hardware task Tj.
S107 repeats steps S101-S106 until all hardware tasks in the waiting record table W have been scanned.
Optionally, when the replaceable hardware task Tk of the hardware task Tj cannot be found in the completed task record table F, judging whether the hardware task Tj is allocatable in the rectangular vertex layout record table C, if so, laying out the hardware task Tj into the rectangular vertex layout record table C by using a dynamic reconfigurable resource layout method, deleting the hardware task overlapping with the position of the hardware task Tj in the completed task record table F, and updating the free rectangular vertex record table B, and turning to step S106.
Optionally, determining whether the hardware task Tj is allocatable in the rectangular vertex layout record table C includes:
if not, the hardware task Tj is notified to wait and repeat steps S102-S106.
Optionally, searching for an alternative hardware task Tk of the hardware task Tj from the completed task record table F according to the earliest and latest priority principle comprises:
and searching a rectangle which is earliest to complete and can accommodate the hardware task Tj from the completed task record list F, taking the hardware task positioned on the rectangle as a replaceable hardware task Tk of the hardware task Tj, replacing the hardware task Tk by the hardware task Tj and updating the rectangle vertex layout record list C.
Wherein, the vertices in the rectangular vertex layout record table C are not considered to be reused when the hardware tasks are allocated, and any hardware task is deleted from the rectangular vertex layout record table C after being executed.
Optionally, determining whether the hardware task Ti is a hardware task that has just ended includes:
if not, the hardware tasks Ti are sequentially inserted into the waiting record table W according to the sequence of the latest starting time, and the steps S102-S106 are repeated.
According to the reconfigurable hardware task dynamic allocation method based on the heterogeneous computing platform, which is provided by the embodiment of the application, the placement position of the newly arrived hardware task on the reconfigurable chip is obtained through the rectangular vertex, the earliest and latest starting time priority principle is adopted, the instantaneity of the hardware task is improved, the resource recovery task of the completed hardware task is executed by adopting the idea of configuration reuse, the rejection rate of hardware task allocation is reduced, the utilization rate of the reconfigurable chip is improved, the expenditure of the computing platform is reduced, the two-dimensional reconfigurable hardware task is supported, and the scheduling efficiency is improved.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
It will be appreciated that the relevant features of the methods and apparatus described above may be referenced to one another. In addition, the "first", "second", and the like in the above embodiments are for distinguishing the embodiments, and do not represent the merits and merits of the embodiments.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises an element.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.
Claims (5)
1. The reconfigurable hardware task dynamic allocation method based on the heterogeneous computing platform is characterized by comprising the following steps of:
s1, judging whether a hardware task Ti is a hardware task which is just executed and completed, if so, deleting the hardware task Ti from an activity record table A and inserting the hardware task Ti into a completed task record table F, updating a rectangular vertex layout record table C, and turning to a step S2;
s2, taking out a hardware task Tj from the waiting record table W, judging whether a rectangle capable of accommodating the hardware task Tj exists in the completed task record table F, if so, moving the hardware task Tj from the completed task record table F to the activity record table A, updating a rectangular vertex layout record table C, activating the hardware task Tj, and if not, turning to a step S3;
s3, judging whether the current time exceeds the latest starting time of the hardware task Tj, if so, refusing to schedule the hardware task Tj and deleting the hardware task Tj, and if not, turning to step S4;
s4, judging whether the hardware task Tj can be distributed in the idle rectangular vertex record table B, if so, distributing the hardware task Tj into the idle rectangular vertex record table B by using a dynamic reconfigurable resource distribution method, and transferring to the step S6, and if not, transferring to the step S5;
s5, searching a replaceable hardware task Tk of the hardware task Tj from the completed task record table F according to the earliest and latest priority principle, deleting the hardware task Tk from the completed task record table F, updating the idle rectangular vertex record table B, and arranging the hardware task Tj into the idle rectangular vertex record table B by using a dynamic reconfigurable resource arrangement method and transferring to the step S6;
s6, inserting the hardware task Tj into the activity record table A, updating the rectangular vertex layout record table C, and activating the hardware task Tj;
s7, repeating the steps S1-S6 until all hardware tasks in the waiting record table W are scanned.
2. The method for dynamically allocating reconfigurable hardware tasks based on heterogeneous computing platforms according to claim 1, wherein when the replaceable hardware task Tk of the hardware task Tj cannot be found in the completed task record table F, it is determined whether the hardware task Tj is allocatable in the rectangular vertex layout record table C, if yes, the hardware task Tj is laid out in the rectangular vertex layout record table C by using the dynamic reconfigurable resource layout method, the hardware task overlapped with the position of the hardware task Tj in the completed task record table F is deleted, and the spare rectangular vertex record table B is updated, and the step goes to step S6.
3. The heterogeneous computing platform-based reconfigurable hardware task dynamic allocation method according to claim 2, wherein determining whether the hardware task Tj is allocatable in the rectangular vertex layout record table C comprises:
if not, the hardware task Tj is notified to wait and repeat steps S2-S6.
4. The heterogeneous computing platform-based reconfigurable hardware task dynamic allocation method according to claim 1, wherein searching for the replaceable hardware task Tk of the hardware task Tj from the completed task record table F according to the earliest and latest priority principle comprises:
and searching a rectangle which is earliest to complete and can accommodate the hardware task Tj from the completed task record list F, taking the hardware task positioned on the rectangle as a replaceable hardware task Tk of the hardware task Tj, replacing the hardware task Tk by the hardware task Tj and updating the rectangle vertex layout record list C.
5. The method for dynamically assigning reconfigurable hardware tasks based on heterogeneous computing platforms according to claim 1, wherein determining whether the hardware task Ti is an just-finished hardware task comprises:
if not, the hardware tasks Ti are sequentially inserted into the waiting record table W according to the sequence of the latest starting time, and the steps S2-S6 are repeated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010731008.0A CN111880933B (en) | 2020-07-27 | 2020-07-27 | Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010731008.0A CN111880933B (en) | 2020-07-27 | 2020-07-27 | Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111880933A CN111880933A (en) | 2020-11-03 |
| CN111880933B true CN111880933B (en) | 2023-09-22 |
Family
ID=73200728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010731008.0A Active CN111880933B (en) | 2020-07-27 | 2020-07-27 | Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111880933B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6415384B1 (en) * | 1998-10-30 | 2002-07-02 | Lucent Technologies Inc. | Hardware/software co-synthesis of dynamically reconfigurable embedded systems |
| EP1372084A2 (en) * | 2002-05-31 | 2003-12-17 | Interuniversitair Microelektronica Centrum Vzw | Method for hardware-software multitasking on a reconfigurable computing platform |
| CN101799770A (en) * | 2010-01-19 | 2010-08-11 | 湖南大学 | Reconfigurable resource management method based on unit area speed-up ratio |
| CN101833368A (en) * | 2010-04-13 | 2010-09-15 | 杭州电子科技大学 | Method for managing energy of local dynamic reconfigurable system by coordinatively processing software and hardware |
| CN102681901A (en) * | 2012-05-08 | 2012-09-19 | 西安交通大学 | Segmental reconfigurable hardware task arranging method |
| CN103488531A (en) * | 2013-09-26 | 2014-01-01 | 中国船舶重工集团公司第七一六研究所 | Software and hardware mixing real-time task scheduling method based on multi-core processor and FPGA |
| CN104239135A (en) * | 2014-05-19 | 2014-12-24 | 江苏科技大学 | Hybrid task scheduling method of directed acyclic graph (DGA) based reconfigurable system |
| CN104615488A (en) * | 2015-01-16 | 2015-05-13 | 华为技术有限公司 | Task scheduling method and device on heterogeneous multi-core reconfigurable computing platform |
| CN108256182A (en) * | 2018-01-02 | 2018-07-06 | 西安交通大学 | A kind of layout method of dynamic reconfigurable FPGA |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| NL2011315C2 (en) * | 2013-08-19 | 2015-02-23 | Topic Embedded Systems B V | A computing platform, a reconfigurable hardware device and a method for simultaneously executing processes on dynamically reconfigurable hardware device, such as an fpga, as well as instruction set processors, such as a cpu, and a related computer readable medium. |
-
2020
- 2020-07-27 CN CN202010731008.0A patent/CN111880933B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6415384B1 (en) * | 1998-10-30 | 2002-07-02 | Lucent Technologies Inc. | Hardware/software co-synthesis of dynamically reconfigurable embedded systems |
| EP1372084A2 (en) * | 2002-05-31 | 2003-12-17 | Interuniversitair Microelektronica Centrum Vzw | Method for hardware-software multitasking on a reconfigurable computing platform |
| CN101799770A (en) * | 2010-01-19 | 2010-08-11 | 湖南大学 | Reconfigurable resource management method based on unit area speed-up ratio |
| CN101833368A (en) * | 2010-04-13 | 2010-09-15 | 杭州电子科技大学 | Method for managing energy of local dynamic reconfigurable system by coordinatively processing software and hardware |
| CN102681901A (en) * | 2012-05-08 | 2012-09-19 | 西安交通大学 | Segmental reconfigurable hardware task arranging method |
| CN103488531A (en) * | 2013-09-26 | 2014-01-01 | 中国船舶重工集团公司第七一六研究所 | Software and hardware mixing real-time task scheduling method based on multi-core processor and FPGA |
| CN104239135A (en) * | 2014-05-19 | 2014-12-24 | 江苏科技大学 | Hybrid task scheduling method of directed acyclic graph (DGA) based reconfigurable system |
| CN104615488A (en) * | 2015-01-16 | 2015-05-13 | 华为技术有限公司 | Task scheduling method and device on heterogeneous multi-core reconfigurable computing platform |
| CN108256182A (en) * | 2018-01-02 | 2018-07-06 | 西安交通大学 | A kind of layout method of dynamic reconfigurable FPGA |
Non-Patent Citations (2)
| Title |
|---|
| "Reconfiguration planning for heterogeneous self-reconfiguring robots";R. Fitch et al;《 Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003)》;全文 * |
| 一种异构可重构片上系统的实时任务调度算法;刘彦;李仁发;许新达;徐成;;计算机研究与发展(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111880933A (en) | 2020-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110647394B (en) | Resource allocation method, device and equipment | |
| CN100383745C (en) | Facilitating allocation of resources in a heterogeneous computing environment | |
| CN1154928C (en) | Resource management method and apparatus for information processing system of multitasking facility | |
| US20060206894A1 (en) | Method of scheduling jobs using database management system for real-time processing | |
| CN111682973B (en) | Method and system for arranging edge cloud | |
| CN102609467A (en) | Method and device for database connection management | |
| CN102761469A (en) | Allocation method and device for resource pool | |
| CN107864211B (en) | Cluster resource dispatching method and system | |
| CN1960287A (en) | Method and apparatus for scheduling jobs on a network | |
| JP7502550B2 (en) | RESOURCE SCHEDULING METHOD, RESOURCE SCHEDULING SYSTEM, AND DEVICE | |
| CN105094972A (en) | Method and device for processing database operation tasks | |
| CN112905342A (en) | Resource scheduling method, device, equipment and computer readable storage medium | |
| CN105824705B (en) | A kind of method for allocating tasks and electronic equipment | |
| CN111880933B (en) | Reconfigurable hardware task dynamic allocation method based on heterogeneous computing platform | |
| CN115509704A (en) | Task scheduling method, device, equipment and storage medium | |
| CN113849260A (en) | Instance processing core allocation method and device | |
| CN117435324B (en) | Task scheduling method based on containerization | |
| CN113301087A (en) | Resource scheduling method, device, computing equipment and medium | |
| US5517654A (en) | System for parallel implementation of combinatorial optimization in a multiprocessor network for generating search graphs for solving enumerative problems | |
| CN113760524A (en) | Task execution method and device | |
| CN112328403A (en) | SparkContext configuration method and device and server side | |
| JP6951962B2 (en) | How to handle the OpenCL kernel and the computing equipment that carries it out | |
| Huang et al. | EDF‐Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real‐Time | |
| KR101916809B1 (en) | Apparatus for placing virtual cluster and method for providing the same | |
| CN110908791A (en) | Scheduling method, scheduling device and scheduling system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |