A model for scheduling protocol-constrained components and environments

Steve Haynal, Forrest Brewer
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
This paper presents a technique for highly constrained event sequence scheduling. System resource protocols as well as an external interface protocol are described by non-deterministic finite automata (NFA). All valid schedules which adhere to interfacing constraints and resource bounds for flow graph described behavior are determined exactly. A model and scheduling results are presented for an extensive design example.
doi:10.1145/309847.309933 dblp:conf/dac/HaynalB99 fatcat:q7p2fafzdvflxnvz4t6csuu6oq