EECS 298-11: CAD Seminar Wednesday, February 22, 5pm 531 Cory Hall, Hogan Room New Results in BDD-Based Scheduling Prof. Forrest Brewer UC Santa Barbara BDD-based symbolic algorithms offer the utility of a strong canonical form and compressed representation. These capabilities allow several long standing problems in High-Level synthesis to be recast as exact Boolean constructions. This has lead to the first exact formulations for arbitrary forward control branching and some limited forms of speculative execution. Surprisingly, we show that these techniques are time competitive with other exact search procedures and have several inherent advantages. In particular, sets of prospective solutions can be propagated very efficiently allowing construction of very efficient and robust heuristics. In this talk we will discuss the properties required of a control-based scheduler and formulation of an implicit technique. Also discussed are efficient techniques for ensuring deterministic causality of the results and optimal treatment of conditionally available resources. Finally, we detail techniques for improving the efficiency of the construction allowing exact solution of some larger problems and greatly improved heuristics.