List scheduling

Get organized (sort through tasks, create a master list, schedule tasks, use a system). 

The scope is limited to the schedule list (schedule 1, 2, and 3) in the Annex on Chemicals. The nature of the chemicals is described in Article II of the CWC. Article II defines the chemicals covered by the CWC and gives the criteria that determine if a chemical within a given context can be included or excluded from the scope for the purposes of the CWC. 

Methyl Benzilate [CAS 76-89-1] Methyldiethanolamine [CAS 105-59-9] Methylphosphinyl Dichloiide [CAS 676-83-5] Control list Schedule 3 Control list... 

The Annex on Chemicals to the CWC lists the toxic chemicals and their precursors that are considered a risk to the Convention. This Annex divides the substances into three Schedules or lists. Schedule 1 chemicals pose the highest risk to the Convention many have been developed, produced, stockpiled or used as chemical weapons in the past and they have few if any peaceful uses. Schedule 2 chemicals pose a significant risk to the Convention either because they can be used themselves as chemical weapons or as a consequence of their role as precursors to Schedule 1 or 2 chemicals. Schedule 2 chemicals are also not produced commercially on a large scale. Schedule 3 chemicals are produced in large quantities commercially but pose a risk to the Convention because of their role as precursors to either Schedule 1 or Schedule 2 chemicals. 

All array indices are analyzed over time through a fast simulation to support the above-mentioned steps. This information will also be used for actual array-type selection. For the investigated applications, arrays could be realized through FIFOs or ring buffers in most cases. If possible, array entries will be moved to other locations to realize monotonous access orders supporting such efficient realizations. A fast and very simple list scheduler is used to estimate background memory access conflicts,... 

Due to the constructive nature of list scheduling, hardware constraints can be checked easily whenever operations of the ready-list (this list keeps all operations that can be scheduled in the actual control step, i.e., all their predecessors are already scheduled) are mapped into the current cycle. In order to... 

FCFS, also known as As-Soon-As-Possible, or ASAP) scheduling, list scheduling, and scheduling the critical path first. 

Another scheduling approach is list scheduling, which schedules operations into control steps, one control step at a time. For the current control step, a list of data ready operators is constructed, containing those operators whose inputs are produced in earlier control steps, and that do not violate any resource constraints. This list is then sorted according to some priority function, the highest-priority operator is placed into the current control step, the list is updated, and the process continues until no more operators can be placed into that control step. This process is then repeated on the next control step, until the entire design is scheduled. Two common priority functions are mobility... 

The example in Figure 4 can be scheduled as indicated by the finite state machine (FSM) diagram shown in Figure 8 (recall that in an FSM, the states correspond to control steps). Both list scheduling and... 

Using detailed information on the size and timing of these resources, the operations in each cluster are scheduled into clock steps and phases using list scheduling, with operations on the (critical path — McFarlandSGa, longest path — McFarland86b) scheduled first. 

List scheduling, with operations ranked according to their urgency (the minimum number of cycles required between the operation and any enclosing timing constraints). 

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

The CSTEP control step scheduler uses list scheduling on a block-by-block basis, with timing constraint evaluation as the priority function. Operations are scheduled into control steps one basic block at a time, with the blocks scheduled in executidepth-first traversal of the control flow graph. For each basic block, data ready operator are considered for placement into the current control step, using a priority function that reflects whether or not that placement will violate timing constraints. Resource limits may be applied to limit the number of operators of a particular type in any one control step. 

List scheduling, with priority to operations on the longer critical paths. 

Performs loop folding, overlapping the execution of successive loop iterations. Then uses list scheduling, with priorily to... 

Uses list scheduling, with expected freedom (mobility) as the priority function. 

First, list scheduling and ASAP and ALAP scheduling are used as described above. Then integer linear programming is used to schedule the operations into control steps, and allocate functional units, while minimizing the functional unit cost. 

List scheduling, with operations ranked according to their mobility, and operations with lower mobilily scheduled before scheduling operations with higher mobilily. An operation s mobility is the number of control steps that it can possibly be delayed from its ASAP control step, i.e. the difference between its ALAP control step and its ASAP control step. Thus operations with a mobility equal to zero are on the critical path, and are scheduled first. If two nodes have the same mobility, the node with the most successors is scheduled first. 

List scheduling, with constraints on the number of functional units, chaining, multi-cycle operations, and support for pipelined functional units. 

Fisher [FisherSl] describes the list scheduling algorithm as it is used in microcode compaction. CSTEP uses list scheduling with a number of modifications that support scheduling for synthesis. First, it supports primitive estimation of combinational delay. Second, it uses this estimation to support multiple cycle operators and cascaded operators. Third, it uses a modified priority function in which negative priority values force placement of operators to be delayed. 

---