CN102629218A - Reconfigurable hardware task fit method based on length to width ratios of tasks - Google Patents

Reconfigurable hardware task fit method based on length to width ratios of tasks Download PDF

Info

Publication number
CN102629218A
CN102629218A CN2012100660892A CN201210066089A CN102629218A CN 102629218 A CN102629218 A CN 102629218A CN 2012100660892 A CN2012100660892 A CN 2012100660892A CN 201210066089 A CN201210066089 A CN 201210066089A CN 102629218 A CN102629218 A CN 102629218A
Authority
CN
China
Prior art keywords
task
tasks
boundary
reconfigurable hardware
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.)
Pending
Application number
CN2012100660892A
Other languages
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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN2012100660892A priority Critical patent/CN102629218A/en
Publication of CN102629218A publication Critical patent/CN102629218A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention provides a reconfigurable hardware task fit method based on length to width ratios of tasks. A two-dimensional coordinate system formed by an X-axis and a Y-axis is constructed on the basis of a two-dimensional reconfigurable resource model; the task layout direction is determined according to the length to width ratios of the tasks to be placed; when the width is larger than or equal to the height, the tasks are laid out in an X-axis direction; when the width is smaller than the height, the tasks are laid out in a Y-axis direction; an upper boundary and a right boundary produced after the tasks are fit are recognized and recorded in a task boundary set Bset; when boundary values produced after the tasks are fit are equal to a boundary value of a reconfigurable device, the boundary values are not recorded in the boundary set Bset; the same boundary value produced due to the overlapping of task boundaries is repeatedly recorded; and after being executed, the tasks sequentially quit according to the finish time, and boundary values corresponding to the tasks are deleted from the task boundary set Bset. When applied to task sets of reconfigurable hardware tasks with relatively large length to width ratios, the reconfigurable hardware task fit method has the advantages that the task conflict probability can be reduced and the task scheduling success rate can be increased.

Description

A kind of reconfigurable hardware task laying method based on the task length breadth ratio
Technical field
The invention belongs to field of computer technology, be specifically related to a kind of reconfigurable hardware task laying method based on the task length breadth ratio.
Background technology
In restructurable computing system; The restructural resource is abstract usually to be two kinds of models of peacekeeping two dimension; In two-dimentional restructural resource model, computational resource is divided with the mode of two-dimensional array and is organized, and the least unit of reconstruct is a rectangular element in the two-dimensional array; A reconfigurable hardware task takies a rectangular area in the array; A plurality of tasks are carried out layout through the mode of scheduling in reconfigurable hardware, because the placement of each task in resource space has two-dimensional freedom, therefore normal employing clear area scanning and these two kinds of methods of state matrix record are that task to be scheduled is searched suitable placement position.The clear area scan method mainly is to come resource is described through the record clear area; Wherein the most important thing is maximum idle rectangle method MER (Maximal Empty Rectangle); The idling-resource rectangle tabulation that one of MER method record does not overlap mutually; Obtain to wait to dispatch the placement location of hardware task through the idling-resource rectangle of searching coupling, this method need safeguard the tabulation of resource rectangle, and it is higher relatively to search the complexity of coupling idling-resource during task scheduling; The state matrix recording method comes management resource through the matrix of safeguarding record restructural computing unit (Reconfigurable Computing Unit) state; But and search the placement location of waiting to dispatch hardware task through the scanning mode matrix; The method need scan and search state matrix, and spended time is longer relatively.What the placement strategy that when the task layout, adopts was commonly used has two kinds; A kind of is first fit laying method (First Fit); Another kind is best laying method (Best Fit); These two kinds of laying methods are not all considered the scale information of two-dimensional device model and hardware task, and therefore under the situation that load factor is higher and the hardware task scale is consistent relatively, the task scheduling success ratio is not high.
Summary of the invention
In order to overcome the problem that exists in the above-mentioned prior art; The object of the present invention is to provide a kind of reconfigurable hardware task laying method based on the task length breadth ratio; On the basis of two-dimentional restructural resource model, utilize the scale information of two-dimensional device model, through the information of introducing reconfigurable hardware task length breadth ratio the reconfigurable hardware task is carried out layout again; Cause the probability of conflict with competitive resource between the reduction task, improve the task scheduling success ratio.
In order to achieve the above object, the technical scheme that the present invention adopted is:
A kind of reconfigurable hardware task laying method based on the task length breadth ratio may further comprise the steps:
The first step is on the two-dimentional restructural resource model basis of W * H in scale, makes up the two-dimensional coordinate system of X, Y axle composition, and the least unit of X, Y axle is a restructural computing unit, based on the reconfigurable hardware task T of two-dimensional coordinate system iRequired reconstruct resource identifies with rectangle, and rectangle size is described as: T i=(w i, h i), wherein i is a positive integer, w iBe task T iTake the width of resource, h iBe task T iTake the height of resource; Task T iTo occupy high h of being in the two-dimensional coordinate system i, wide is w iThe rectangular area, be called the task put area, first task T 1Put area lower left corner coordinate be (0,0), task T then 1Placement location can be expressed as: [(0,0), (w 1, h 1)];
Second step, during reconfigurable hardware task layout, according to the length breadth ratio of waiting the task of the placing layout direction that sets the tasks, shown in (1):
decisionV ( w i , h i ) = 1 , w i ≥ h i 0 , Other - - - ( 1 )
W wherein i, h iWide and high for reconfigurable hardware task to be placed,
As the wide w that waits the task of placing iMore than or equal to its high h iThe time, task will be along the X-direction layout; As the wide w that waits the task of placing iLess than its high h iThe time, task will be along the Y direction layout;
The 3rd step; To the successful task of layout in the reconfigurable device; This method identification mission is placed coboundary and the right margin that the back produces; And it is recorded among the task boundary set Bset, place the boundary value of boundary value that the back produces and reconfigurable device when identical when task, will refuse record among the task boundary set Bset; For the same edge dividing value of the overlapping generation in task border, adopt the mode of duplicate record to be recorded among the Bset, delete corresponding border record when making things convenient for task termination to withdraw from;
In the 4th step, after the reconfigurable hardware task is complete, task will withdraw from according to the concluding time successively, simultaneously the corresponding boundary value of this task of deletion from task boundary set Bset.
Salient point of the present invention is:
To the relatively large situation of reconfigurable hardware task length breadth ratio; Utilize the scale information of two-dimentional restructural resource model; Decide the task placement direction through placing the task length breadth ratio; Reduced the probability that the reconfigurable hardware task clashes when layout, thereby improved the success ratio of task scheduling, in the reconfigurable system applicable to real time execution.
Description of drawings
Fig. 1 is a two-dimensional coordinate system synoptic diagram of the present invention, and unit horizontal, ordinate is the reconfigurable cell number.
Fig. 2 is a reconfigurable hardware task layout example schematic of the present invention.
Embodiment
Below in conjunction with accompanying drawing and instance the present invention is done detailed description.
A kind of reconfigurable hardware task laying method based on the task length breadth ratio may further comprise the steps:
The first step is on the two-dimentional restructural resource model basis of W * H in scale, makes up the two-dimensional coordinate system of X, Y axle composition, and the least unit of X, Y axle is a restructural computing unit, based on the reconfigurable hardware task T of two-dimensional coordinate system iRequired reconstruct resource identifies with rectangle, and rectangle size is described as: T i=(w i, h i), wherein i is a positive integer, w iBe task T iTake the width of resource, h iBe task T iTake the height of resource; Task T iTo occupy high h of being in the two-dimensional coordinate system i, wide is w iThe rectangular area, be called the task put area, first task T 1Put area lower left corner coordinate be (0,0), task T then 1Placement location can be expressed as: [(0,0), (w 1, h 1)].
With reference to Fig. 1, A is that scale is the two-dimentional restructural resource model of W * H, and wherein wide W=10, high H=10, B are that restructural calculates minimum unit.
Second step, during reconfigurable hardware task layout, according to the length breadth ratio of waiting the task of the placing layout direction that sets the tasks, shown in (1):
decisionV ( w i , h i ) = 1 , w i ≥ h i 0 , Other - - - ( 1 )
W wherein i, h iWide and high for reconfigurable hardware task to be placed
As the wide w that waits the task of placing iMore than or equal to its high h iThe time, task will be along the X-direction layout; As the wide w that waits the task of placing iLess than its high h iThe time, task will be along the Y direction layout.
With reference to Fig. 2, task T 1Placement location is [(0,0) (3,7)], task T 2After the arrival, according to the length breadth ratio of the task of placement, i.e. w i=7>h i==3, T sets the tasks 2Place along directions X, placement location is [(3,0) (10,3)]; Task T 3After the arrival, same length breadth ratio, i.e. w according to the task of placement i=6>h i=3, T sets the tasks 3Place along X-direction, according to boundary value (X-0,3 of task boundary set Bset record; Y-0,3,7), task T wherein 2The border of placing the X-direction of back generation equals device boundaries, therefore refuses record, task T 3The initial boundary value that can place along X-direction is 3, and the initial boundary value that can place along Y direction is 3, then task T 3Placement location be [(3,3) (9,6)]; Task T 3Arrive the back if adopt best laying method Best Fit placement strategy or First Fit placement strategy etc., work as T 4Then can cause conflict after the arrival, i.e. task T 4Can't place, place task T and adopt based on the laying method of task length breadth ratio 3, task T then 4Can successfully place, according to the length breadth ratio of the placing task layout direction that sets the tasks, w i=8>h i==3, task T 4Place along X-direction, according to boundary value (X-0,3,9 of task boundary set Bset record; Y-0,3,6,7), the initial boundary value that can place along X-direction is 0, the initial boundary value that can place along Y direction is 7, then task T 4Placement location be [(0,7) (8,10)].
In the 3rd step, to the successful task of layout in the reconfigurable device, this method identification mission is placed coboundary and the right margin that the back produces, and it is recorded among the task boundary set Bset.When the boundary value that after task is placed, produces is identical with the boundary value of reconfigurable device, will refuse record among the task boundary set Bset; For the same edge dividing value of the overlapping generation in task border, adopt the mode of duplicate record to be recorded among the Bset, delete corresponding border record when making things convenient for task termination to withdraw from.
With reference to Fig. 2, task T 4After the placement, updating task boundary set Bset is recorded as: (X-0,3,8,9; Y-0,3,6,7), task T 4The border of placing the Y direction of back generation equals the reconfigurable device border, therefore refuses record.
In the 4th step, after the reconfigurable hardware task was complete, task withdrawed from according to the concluding time successively, simultaneously the corresponding boundary value of this task of deletion from task boundary set Bset.
With reference to Fig. 2, task T 1Withdraw from task T among the deletion task boundary set Bset after complete 1Corresponding border record: (X-3; Y-7), updating task boundary set Bset is recorded as: (X-0,8,9; Y-0,3,6), carry out end according to task successively and withdraw from proper order, and updating task boundary set Bset.

Claims (1)

1. reconfigurable hardware task laying method based on the task length breadth ratio is characterized in that step is following:
The first step is on the two-dimentional restructural resource model basis of W * H in scale, makes up the two-dimensional coordinate system of X, Y axle composition, and the least unit of X, Y axle is a restructural computing unit, based on the reconfigurable hardware task T of two-dimensional coordinate system iRequired reconstruct resource identifies with rectangle, and rectangle size is described as: T i=(w i, h i), wherein i is a positive integer, w iBe task T iTake the width of resource, h iBe task T iTake the height of resource; Task T iTo occupy high h of being in the two-dimensional coordinate system i, wide is w iThe rectangular area, be called the task put area, first task T 1Put area lower left corner coordinate be (0,0), task T then 1Placement location can be expressed as: [(0,0), (w 1, h 1)];
Second step, during reconfigurable hardware task layout, according to the length breadth ratio of waiting the task of the placing layout direction that sets the tasks, shown in (1):
decisionV ( w i , h i ) = 1 , w i ≥ h i 0 , Other - - - ( 1 )
W wherein i, h iWide and high for reconfigurable hardware task to be placed,
As the wide w that waits the task of placing iMore than or equal to its high h iThe time, task will be along the X-direction layout; As the wide w that waits the task of placing iLess than its high h iThe time, task will be along the Y direction layout;
The 3rd step; To the successful task of layout in the reconfigurable device; This method identification mission is placed coboundary and the right margin that the back produces; And it is recorded among the task boundary set Bset, place the boundary value of boundary value that the back produces and reconfigurable device when identical when task, will refuse record among the task boundary set Bset; For the same edge dividing value of the overlapping generation in task border, adopt the mode of duplicate record to be recorded among the Bset, delete corresponding border record when making things convenient for task termination to withdraw from;
In the 4th step, after the reconfigurable hardware task is complete, task will withdraw from according to the concluding time successively, simultaneously the corresponding boundary value of this task of deletion from task boundary set Bset.
CN2012100660892A 2012-03-14 2012-03-14 Reconfigurable hardware task fit method based on length to width ratios of tasks Pending CN102629218A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2012100660892A CN102629218A (en) 2012-03-14 2012-03-14 Reconfigurable hardware task fit method based on length to width ratios of tasks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2012100660892A CN102629218A (en) 2012-03-14 2012-03-14 Reconfigurable hardware task fit method based on length to width ratios of tasks

Publications (1)

Publication Number Publication Date
CN102629218A true CN102629218A (en) 2012-08-08

Family

ID=46587478

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2012100660892A Pending CN102629218A (en) 2012-03-14 2012-03-14 Reconfigurable hardware task fit method based on length to width ratios of tasks

Country Status (1)

Country Link
CN (1) CN102629218A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10452605B2 (en) 2015-03-27 2019-10-22 Huawei Technologies Co., Ltd. Method and apparatus for task scheduling on heterogeneous multi-core reconfigurable computing platform
US10552222B2 (en) 2015-01-16 2020-02-04 Huawei Technologies Co., Ltd. Task scheduling method and apparatus on heterogeneous multi-core reconfigurable computing platform

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101853178A (en) * 2010-04-30 2010-10-06 西安交通大学 Description method of reconfigurable hardware resource in scheduling
CN101944049A (en) * 2010-09-16 2011-01-12 四川大学 Unified dispatching algorithm of reconfigurable system software/ hardware task based on placement cost
CN101996092A (en) * 2009-06-03 2011-03-30 东北大学 On-line two-dimensional region management and task setting method of dynamically reconfigurable field programmable gate array (FPGA)
CN102262612A (en) * 2011-07-28 2011-11-30 西安交通大学 Method for lowering restructurable hardware task layout conflict

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101996092A (en) * 2009-06-03 2011-03-30 东北大学 On-line two-dimensional region management and task setting method of dynamically reconfigurable field programmable gate array (FPGA)
CN101853178A (en) * 2010-04-30 2010-10-06 西安交通大学 Description method of reconfigurable hardware resource in scheduling
CN101944049A (en) * 2010-09-16 2011-01-12 四川大学 Unified dispatching algorithm of reconfigurable system software/ hardware task based on placement cost
CN102262612A (en) * 2011-07-28 2011-11-30 西安交通大学 Method for lowering restructurable hardware task layout conflict

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
余国良等: "一种采用边界表进行可重构资源管理及硬件任务调度的算法", 《计算机研究与发展》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10552222B2 (en) 2015-01-16 2020-02-04 Huawei Technologies Co., Ltd. Task scheduling method and apparatus on heterogeneous multi-core reconfigurable computing platform
US10452605B2 (en) 2015-03-27 2019-10-22 Huawei Technologies Co., Ltd. Method and apparatus for task scheduling on heterogeneous multi-core reconfigurable computing platform

Similar Documents

Publication Publication Date Title
CN102262612B (en) Method for lowering restructurable hardware task layout conflict
CN102681901B (en) Segmental reconfigurable hardware task arranging method
CN104408589A (en) AGV optimization scheduling method based on mixed particle swarm optimization
CN103718244B (en) For collection method and the device of media accelerator
CN106991135B (en) Rapid tile generation method for remote sensing image data
CN103699608A (en) Page distribution method and device
CN103647850A (en) Data processing method, device and system of distributed version control system
CN102243321A (en) Method and system for processing seismic pre-stack time migration
CN103150326A (en) Skyline query method orienting to probability data flow
Cui et al. An efficient algorithm for online management of 2d area of partially reconfigurable fpgas
CN102629218A (en) Reconfigurable hardware task fit method based on length to width ratios of tasks
CN104809231A (en) Mass web data mining method based on Hadoop
CN102937993A (en) Method and device for accessing keywords
CN103116593B (en) A kind of parallel method of the calculating convex hull based on multicore architecture
CN103902582B (en) A kind of method and apparatus for reducing data warehouse data redundancy
CN101675437B (en) Semiconductor layout scanning method and system
CN101853178B (en) Description method of reconfigurable hardware resource in scheduling
CN103294714B (en) The defining method of the memory location of the field attribute value of index field and device
CN106168932A (en) A kind of Flash control method and device
CN103106254B (en) The parallel joining method of polygon vector data file
CN103310077B (en) Roll the modeling method of consequent sequence stretching adult
CN106155924A (en) Picture merges method, device and smart machine
Olakkenghil et al. An FPGA task placement algorithm using reflected binary gray space filling curve
CN116108757B (en) Multistage simulation time pushing method in training environment, server and storage medium
CN107248187A (en) A kind of method of quick three-dimensional model texture cutting restructuring

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20120808