We describe the scheduling algorithm with which the RASP circuit synthesizer meets constraints. Because RASP makes an unusually large number of design choices, it uses a local cost-based scheduler. Nonetheless, experimental tests suggest that the scheduler produces a wide range of designs, handling both area and timing constraints very well.
/lp/association-for-computing-machinery/constraint-sensitive-scheduling-in-rasp-jtCQ70yGgW