CN102999435B - Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system - Google Patents
Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system Download PDFInfo
- Publication number
- CN102999435B CN102999435B CN201110276255.7A CN201110276255A CN102999435B CN 102999435 B CN102999435 B CN 102999435B CN 201110276255 A CN201110276255 A CN 201110276255A CN 102999435 B CN102999435 B CN 102999435B
- Authority
- CN
- China
- Prior art keywords
- task
- current
- current task
- hrca
- reconfigurable cell
- 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.)
- Expired - Fee Related
Links
Landscapes
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention provides a two-dimensional task placement method of a reconfigurable unit of an HRCA (heterogeneous reconfigurable computing array) system. In combination with three kinds of fragment generation factors which influence the reconfigurable unit of the HRCA system, including the coincidence degree of time of a current task and a neighboring task, the coincidence degree of side length of the current task and the neighboring task and the influence degree of the current task to other idle blocks, the suitability of placing the length and the width of the current task along every two adjacent sides of each idle block is sequentially calculated, and the position with the highest suitability among all positions of all idle blocks is selected as the finial placement position of the current task. The two-dimensional task placement method of the reconfigurable unit has the advantages that the tasks can be placed more compactly and reasonably, the fragments in the reconfigurable unit can be reduced and the space utilization ratio of the reconfigurable unit is improved.
Description
Technical field
The present invention relates to a kind of two-dimentional task of the reconfigurable cell of HRCA (super mixing reconfigureable computing array) system is put
Put method.
Background technology
HRCA system is a kind of mixed structure, including not reconfigurable cell and reconfigurable cell.Reconfigurable cell does not wrap again
Include universal computing unit and stone unit, wherein, universal computing unit executes cpu function, be responsible for two dimension task in HRCA system
Reconfigurable cell in placement, stone unit is carried out the computing unit of specific function, is responsible for repeating in execution application program
The module using.The problem how two-dimentional task places in reconfigurable cell is not only related to the rationally effective of reconfigurable cell
Using, and be the basis that on research restructural chip, task reorientates with the defragmentation of reconfigurable cell, its efficiency one
It is directly the bottleneck problem of restructurable computing system.
Content of the invention
The present invention proposes a kind of two-dimentional task laying method of the reconfigurable cell of HRCA system it is therefore intended that making task put
Put more compact and reasonable, reduce the fragment in reconfigurable cell, improve the space availability ratio of reconfigurable cell.
In order to achieve the above object, being employed technical scheme comprise that of the present invention：In conjunction with three kinds impact HRCA systems can
The fragment factor of reconfiguration unit, is adjacent task registration in time including current task, current task and its
The registration of the length of side of adjacent task, and the influence degree to other free blocks for the current task, calculate various placement locations pair
In the appropriate level of task, the final placement location of task is determined with this.
Wherein, current task is adjacent task registration in time and refers to, if adjacent task estimated completes
Between be later than the Estimated Time Of Completion of current task, then current task is adjacent task registration in time is 1, otherwise,
Current task is adjacent the execution of the remaining execution time that task registration in time is adjacent task and current task
The ratio of time.
The registration that current task is adjacent the length of side of task refers to, current task is adjacent the adjacent side of task
Length ratio.
Current task refers to the influence degree of other free blocks, the quantity of all free blocks overlapping with current task
Reciprocal value.
The product of three of the above factor is referred to as appropriate degree.
The two-dimentional task laying method of the reconfigurable cell of HRCA system of the present invention comprises the steps：
Step 10, obtains a current task information to be placed, and setting one is used for depositing the overall situation of current task
The variable of appropriate degree is simultaneously initialized as zero, and setting one is used for depositing the variable of placement location of current task and being initialized as
Empty；
Step 20, obtains the idle block message of one of idle set of blocks, and judge whether current task fails to grow up in working as
The width of the length of front free block and current task is not more than the width of current idle block, if so, then continues next step；Otherwise, skip to
Step 60；
Step 30, calculate the length and width of current task respectively along every two adjacent edges of current idle block place when suitable
Degree, selects maximum in all appropriate degree as current appropriate degree；
Step 40, judges that current appropriate degree, whether more than overall appropriate degree, if so, then continues next step；Otherwise,
Skip to step 60；
Step 50, the variable update of the appropriate degree for depositing the overall situation of current task is the numerical value of current appropriate degree,
The variable update of the placement location for depositing current task is the placement location corresponding to current appropriate degree；
Step 60, judges that whether current idle block is last free block in idle set of blocks, under if so, then continuing
One step；Otherwise, skip to step 20, obtain next free time block message；
Step 70, judges whether the variable of the placement location for depositing current task is empty, if not empty, then will wherein
The placement location being stored is as the final placement location of current task；Otherwise, do not find the suitable placement location of current task,
The placement of current task terminates.
The two-dimentional task laying method of the reconfigurable cell of the present invention, can make task place more compact and reasonable, reduce
Fragment in reconfigurable cell, improves the space availability ratio of reconfigurable cell.
Brief description
Fig. 1 show the structural representation of the HRCA system of the present invention；
The flow chart that Fig. 2 show the two-dimentional task laying method of the reconfigurable cell of HRCA system of the present invention.
Specific embodiment
Describe technical scheme below in conjunction with the accompanying drawings in detail.
As shown in figure 1, the HRCA system 9 of the present invention includes reconfigurable cell 1 and not reconfigurable cell 2, wherein can not weigh
Structure unit 2 includes universal computing unit 3 and stone unit 4.Universal computing unit 3 executes cpu function, and stone unit 4 is carried out
The computing unit of specific function, is responsible for reusable module in execution application program.Universal computing unit 3 include scheduler 5,
Placement device 6, loader 7 and task waiting list 8.Wherein task sequence scheduling is responsible for by scheduler 5, and placement device 6 is responsible for task and is put
Put strategy realization, loader 7 is then responsible for specific task placement operation.After task reaches, select to place position for it by placement device 6
Put.Again task is put into by reconfigurable cell 1 by loader 7 after selected placement location or stone unit 4 executes.Arrival but temporarily
The task that Shi Wufa places and executes will wait in task waiting list 8, and now scheduler 5 can be according to task feature to queue
In task be scheduling, thus changing placement and the execution sequence of task.Reconfigurable cell 1 include multiple for placing and holding
The module of row task, the module wherein not yet placing task is referred to as free block, and the summation of all free blocks is referred to as idle set of blocks.
The two-dimentional task laying method of the reconfigurable cell of HRCA system of the present invention, in conjunction with three kinds of impact HRCA systems
The fragment factor of reconfigurable cell, is adjacent task registration in time including current task, current task with
The registration of the length of side of its adjacent task, and the influence degree to other free blocks for the current task, calculate various placement locations
For the appropriate level of task, the final placement location of task is determined with this.
Three kinds of influence factors are defined as follows：
(1) current task is adjacent task registration in time：If the Estimated Time Of Completion of adjacent task is later than
The Estimated Time Of Completion of current task, then described current task is adjacent task registration in time is 1, otherwise, when
When front task is adjacent the execution of the remaining execution time that task registration in time is adjacent task and current task
Between ratio.
(2) current task is adjacent the registration of the length of side of task：I.e. to be adjacent task adjacent for current task
The ratio of the length on side.
(3) influence degree to other free blocks for the current task：The i.e. quantity of all free blocks overlapping with current task
Reciprocal value.
The product of three of the above factor is referred to as appropriate degree.In units of free block, the length and width calculating current task successively divides
Not along every two adjacent edges of each free block place when appropriate degree, select in all positions of all free blocks appropriate degree
Big position is as the final placement location of current task.
The two-dimentional task laying method of the reconfigurable cell of HRCA system as shown in Figure 2, step is as follows：
Step 10, obtains a current task information to be placed, and setting one is used for depositing the overall situation of current task
The variable of appropriate degree is simultaneously initialized as zero, and setting one is used for depositing the variable of placement location of current task and being initialized as
Empty；
Step 20, obtains the idle block message of one of idle set of blocks, and judge whether current task fails to grow up in working as
The width of the length of front free block and current task is not more than the width of current idle block, if so, then continues next step；Otherwise, skip to
Step 60；
Step 30, calculate the length and width of current task respectively along every two adjacent edges of current idle block place when suitable
Degree, selects maximum in all appropriate degree as current appropriate degree；
Step 40, judges that current appropriate degree, whether more than overall appropriate degree, if so, then continues next step；Otherwise,
Skip to step 60；
Step 50, the variable update of the appropriate degree for depositing the overall situation of current task is the numerical value of current appropriate degree,
The variable update of the placement location for depositing current task is the placement location corresponding to current appropriate degree；
Step 60, judges that whether current idle block is last free block in idle set of blocks, under if so, then continuing
One step；Otherwise, skip to step 20, obtain next free time block message；
Step 70, judges whether the variable of the placement location for depositing current task is empty, if not empty, then will wherein
The placement location being stored is as the final placement location of current task；Otherwise, do not find the suitable placement location of current task,
The placement of current task terminates.
The above, only presently preferred embodiments of the present invention, it is not limited to the scope of the present invention, the present invention's is above-mentioned
Embodiment can also make a variety of changes.Such as, in said method, the tandem of each step can convert, and and for example, obtain and appoint
Business information and the idle block message of acquisition can synchronously carry out carrying out without substep, and for another example, the length and width of all free blocks judge can
Carry out without carrying out one by one etc. with synchronous.I.e. every claims according to the present patent application and description are made
Simply, equivalence changes and modification, falls within the claims of patent of the present invention.
Claims (9)
1. a kind of two-dimentional task laying method of the reconfigurable cell of HRCA system, this HRCA system includes reconfigurable cell and not
Reconfigurable cell, reconfigurable cell includes multiple free blocks for placing and executing task it is characterised in that methods described
For：Choose the length and width of current task to be placed adjacent along each can accommodate the free block of current task every two respectively
The position corresponding to greatest measure in appropriate degree when side is placed is as the final placement location of current task；Described appropriate degree
Be adjacent task registration in time for current task, current task be adjacent task the registration of the length of side, when
The product of the influence degree three to other free blocks for the front task, described current task is institute to the influence degree of other free blocks
There is the reciprocal value that spatially can accommodate the idle number of blocks of current task completely.
If 2. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 1 is it is characterised in that neighbour
The Estimated Time Of Completion taking over business is later than the Estimated Time Of Completion of current task, then described current task be adjacent task when
Between on registration be 1, otherwise, current task is adjacent the remaining execution that task registration in time is adjacent task
The ratio of the execution time of time and current task.
3. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 1 is it is characterised in that described
Current task be adjacent the length of side of task registration be adjacent for current task the adjacent side of task length ratio
Value.
4. the two-dimentional task laying method of the reconfigurable cell of HRCA system as described in any one in claim 1-3, its
It is characterised by, methods described comprises the steps：
Step 10, obtains a current task information to be placed, and setting one is used for depositing the suitable of the overall situation of current task
The variable of degree is simultaneously initialized as zero, and setting one is used for depositing the variable of placement location of current task and being initialized as sky；
Step 20, obtains the idle block message of one of idle set of blocks, judges whether failing to grow up in currently empty of current task
The width of the length of not busy block and current task is not more than the width of current idle block, if so, then continues next step；Otherwise, skip to step
60；
Step 30, calculate the length and width of current task respectively along every two adjacent edges of current idle block place when appropriate degree, choosing
Go out maximum in all appropriate degree as current appropriate degree；
Step 40, judges that current appropriate degree, whether more than overall appropriate degree, if so, then continues next step；Otherwise, skip to
Step 60；
Step 50, the numerical value that the variable update being used for the appropriate degree of the overall situation depositing current task is current appropriate degree, will
The variable update of the placement location for depositing current task is the placement location corresponding to current appropriate degree；
Step 60, judges that whether current idle block is last free block in idle set of blocks, if so, then continues next step
Suddenly；Otherwise, skip to step 20, obtain next free time block message；
Step 70, judges whether the variable of the placement location for depositing current task is empty, if not empty, then will wherein be deposited
The placement location of storage is as the final placement location of current task；Otherwise, do not find the suitable placement location of current task, currently
The placement of task terminates.
5. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 4 is it is characterised in that described
Reconfigurable cell is not used for executing described step 10-70.
6. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 5 is it is characterised in that described
Reconfigurable cell does not include the placement device of a final placement location for selecting current task.
7. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 6 is it is characterised in that described
Reconfigurable cell does not also include a loader for current task is put into final placement location.
8. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 7 is it is characterised in that described
Reconfigurable cell does not also include one for depositing the task waiting list of task reaching but temporarily cannot placing.
9. the two-dimentional task laying method of the reconfigurable cell of HRCA system as claimed in claim 8 is it is characterised in that described
Reconfigurable cell does not also include one for being scheduling the task in task waiting list thus the placement changing task is suitable
The scheduler of sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110276255.7A CN102999435B (en) | 2011-09-16 | 2011-09-16 | Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110276255.7A CN102999435B (en) | 2011-09-16 | 2011-09-16 | Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102999435A CN102999435A (en) | 2013-03-27 |
| CN102999435B true CN102999435B (en) | 2017-02-22 |
Family
ID=47928028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110276255.7A Expired - Fee Related CN102999435B (en) | 2011-09-16 | 2011-09-16 | Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102999435B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101710292A (en) * | 2009-12-21 | 2010-05-19 | 中国人民解放军信息工程大学 | Reconfigurable task processing system, scheduler and task scheduling method |
| CN101944049A (en) * | 2010-09-16 | 2011-01-12 | 四川大学 | Unified dispatching algorithm of reconfigurable system software/ hardware task based on placement cost |
| CN102012838A (en) * | 2010-11-30 | 2011-04-13 | 中国人民解放军信息工程大学 | Real-time re-configurable task dispatching method by adopting heuristic configuration retention strategy |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7904848B2 (en) * | 2006-03-14 | 2011-03-08 | Imec | System and method for runtime placement and routing of a processing array |
| US20070283311A1 (en) * | 2006-05-30 | 2007-12-06 | Theodore Karoubalis | Method and system for dynamic reconfiguration of field programmable gate arrays |
-
2011
- 2011-09-16 CN CN201110276255.7A patent/CN102999435B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101710292A (en) * | 2009-12-21 | 2010-05-19 | 中国人民解放军信息工程大学 | Reconfigurable task processing system, scheduler and task scheduling method |
| CN101944049A (en) * | 2010-09-16 | 2011-01-12 | 四川大学 | Unified dispatching algorithm of reconfigurable system software/ hardware task based on placement cost |
| CN102012838A (en) * | 2010-11-30 | 2011-04-13 | 中国人民解放军信息工程大学 | Real-time re-configurable task dispatching method by adopting heuristic configuration retention strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102999435A (en) | 2013-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105653204B (en) | A kind of distributed figure calculation method based on disk | |
| CN102243598B (en) | Method for scheduling task in Distributed Data Warehouse and system | |
| CN106293950B (en) | A kind of resource optimization management method towards group system | |
| US9311157B2 (en) | Method and apparatus for dynamic resource allocation of processing units on a resource allocation plane having a time axis and a processing unit axis | |
| CN101604264B (en) | Task scheduling method and system for supercomputer | |
| CN110231986A (en) | Dynamic based on more FPGA reconfigurable multi-task scheduling and laying method | |
| CN100578459C (en) | Method and apparatus of thread scheduling | |
| CN102722417A (en) | Distribution method and device for scan task | |
| CN104035751A (en) | Graphics processing unit based parallel data processing method and device | |
| CN110990154B (en) | Big data application optimization method, device and storage medium | |
| CN112306658B (en) | Digital twin application management scheduling method for multi-energy system | |
| CN103699433A (en) | Method and system for performing dynamic adjustment on number of tasks in Hadoop platform | |
| CN103914556A (en) | Large-scale graph data processing method | |
| CN103473120A (en) | Acceleration-factor-based multi-core real-time system task partitioning method | |
| CN103488531A (en) | Software and hardware mixing real-time task scheduling method based on multi-core processor and FPGA | |
| CN102004664A (en) | Scheduling method of embedded real-time operating system of space vehicle | |
| CN102760073B (en) | Method, system and device for scheduling task | |
| CN102402461A (en) | Balanced scheduling method based on operation scale | |
| CN102662636B (en) | Two-layer virtual machines-based concurrent job scheduling method | |
| CN106033442A (en) | Parallel breadth-first search method based on shared memory system structure | |
| CN108572872A (en) | A kind of method for managing resource based on FPGA Reconfiguration Technologies | |
| CN105051689A (en) | Method, apparatus and system for scheduling resource pool in multi-core system | |
| CN104281636A (en) | Concurrent distributed processing method for mass report data | |
| CN102999435B (en) | Two-dimensional task placement method of reconfigurable unit of HRCA (heterogeneous reconfigurable computing array) system | |
| CN105430074A (en) | Data dependency and access traffic based cloud data allocation storage optimization method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170222 Termination date: 20180916 |