1994 · 75 citations · 13 references
ComputingComputer EngineeringComputer ScienceEmbedded SystemsReal-time SystemsSchedulingCpu SchedulingReal-time SchedulingReal-time Systems ArchitectureReal-time Systems DesignSchedulability AnalysisReactive System ModelingReactive SystemsReal-time Task SchedulingScheduling Algorithms
Abstract { Existing software scheduling techniques limit the functions that can be implemented in software to those with a restricted class of timing constraints, in particular those with a coarse-grained, uniform, periodic behavior. In practice, however, many systems change their I/O behavior in response to the inputs from the environment. This paper considers one such class of systems, called reactive real-time systems, where timing requirements can include sequencing, rate, and response time constraints. We present a static, non-preemptive, ne-grained software scheduling algorithm to meet these constraints. This algorithm is suitable for control-dominated embedded systems with hard real-time constraints, and is part of the core of a hardware/software co-synthesis system. I
13
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Statecharts: a visual formalism for complex systems
David Harel · Science of Computer Programming · 1987 · 6.7K citations
Efficient implementation of a BDD package
Karl S. Brace, Richard Rudell, Randal E. Bryant · 1990 · 1.1K citations · Full text
Logic verification using binary decision diagrams in a logic synthesis environment
Sharad Malik, A.R. Wang, Robert K. Brayton et al. · 2003 · 509 citations