Force-directed list scheduling

Force-directed list scheduling, a second-order differential equation example, and a fifth-order digital elliptic wave filter example. 

In force-directed list scheduling (FDLS), the approach is similar except that force is used as the priority function. More precisely, whenever a hardware constraint is exceeded in the course of regular scheduling, force calculations are used to... 

For applications where it is important to minimize the average time required to execute multiple iterations of a behavior containing conditional blocks, a mechanism must be included to minimize the length of the shorter branches in a control block. This occurs naturally in force-directed list scheduling (FDLS) since operations are assigned ASAP, shbject to resource limitations. If a branch is shorter than its counterpart, then we simply can strip the NOPs between the last data flow operation and the beginning of the join operation. 

The scheduling approach in HIS differs from most scheduling techniques traditionally used in high-level synthesis (e.g., list scheduling [21], force-directed scheduling [35]). HIS uses As-Fast-As-Possible (AFAP) scheduling [11] for... 

One commonly used approach is a list scheduling (LS) technique [1] where a hardware constraint is specified and the algorithm attempts to minimize the total execution time by using a local priority function to defer operations when resource conflicts occur. A different sjppTOxh,force-directed scheduling (FDS),... 

Figure 7. a) List schedule using urgency, and b) force-directed schedule for a simple example. 

---