Research Article

Floorplacement for Partial Reconfigurable FPGA-Based Systems

Algorithm 1

Heuristic pseudocode.
sLength 0
1
readGraph()
setALAP( )
RNs getRootNodes( )
while not scheduled tasks do
 Control possibility of reuse for available tasks in RNs
if not scheduled tasks then
       avTask getFirstALAPAvailableNode(RNs)
       endT findEndTime(avTask, )
       while all the available nodes in RNs have been observed do
        if a position on the FPGA for avTask then
        avTask.terminationTime endT
        avTask.schedulingTime
        avTask.setScheduled true
        if  sLength < endT then
         sLength endT
       end  if
       for  all avTask child nodes chTask do
             if All chTask parents have been scheduled then
                  RNs RNs + chTask
             end  if
       end for
       Control possibility of reuse for available tasks in RNs
       avTask getNextALAPAvailableNode(RNs)
        end  if
       end while
end if
nextControlStep
end  while