Ensemble representation and techniques for exact control-dependent scheduling

Radivojevic, I.; Brewer, Forrest

doi:10.1109/ishls.1994.302340

Cited by 8 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CPU times for constraint generation were significant but within the range of interactive performance, and exhibited a superlinear but reasonable trend for a variety of metrics of problem size (number of states, number of constraints, etc.). Recently-proposed algorithms for scheduling via BDD's [23], [24] have shown CPU times in the hundreds to thousands of CPU seconds for examples with one component machine.…”

Section: Resultsmentioning

confidence: 99%

Scheduling constraint generation for communicating processes

Takach

Wolf

1995

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

This paper describes a new algorithm for generation of scheduling constraints in networks of communicating processes. Our model of communication intertwines the schedules of the machines in the network: timing constraints of a machine may affect the schedules of machines communicating with it. This model of communication facilitates the modular specification of timing constraints [l]. A feasible solution to the set of constraints generated gives a schedule for each machine in the network such that all internal constraints of each machine are satisfied and communication between machines is statically coordinated whenever possible. Static scheduling of communication saves on the cost of handshake associated with dynamic synchronization. Our algorithm can handle complex, state-dependent and cyclic timing constraints. Experimental results show that our algorithm is both effective and efficient.

show abstract

Section: Resultsmentioning

confidence: 99%

Scheduling constraint generation for communicating processes

Takach

Wolf

1995

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

show abstract

“…Using iterative construction [15] the solution is built on a time-step by time-step basis: only those constraints relevant to a particular time step j are generated and applied to the OBDD representing a valid partial solution for the previous (j-1) steps. In this way, only partial time sequences of constraints need to be added at each step.…”

Section: B Iterative Construction Processmentioning

confidence: 99%

Incorporating speculative execution in exact control-dependent scheduling

Radivojevic

Brewer

1994

Proceedings of the 31st Annual Conference on Design Automation Conference - DAC '94

View full text Add to dashboard Cite

-This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forward branching control/data paths. The technique provides a closed form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. To extract parallelism implicit in the input specification Boolean 'guard' functions are used to identify paths where operations have to be scheduled and the execution order of the conditionals is dynamically resolved. An efficient and systematic iterative construction method is presented along with benchmark results.

show abstract

“…These exact and efficient symbolic scheduling techniques based on BDDs are used to perform control/data path scheduling by combining the advantages of both heuristic methods and techniques based on integer linear programming (ILP). BDDs are used to describe scheduling constraints and solution sets either directly [RB94] or encapsulated in finite state machine (FSM) descriptions [CD94,HB98].…”

Section: Introductionmentioning

confidence: 99%

Scheduling hardware/software systems using symbolic techniques

Strehl

Thiele

Ziegenbein

et al. 1999

Proceedings of the Seventh International Workshop on Hardware/Software Codesign - CODES '99

View full text Add to dashboard Cite

In this paper, a scheduling method for heterogeneous embedded systems is developed. At first, an internal representation model called FunSrate is presented which enables the explicit representation of nondeterminism and scheduling using a combination of functions and state machines. The new scheduling method is able to deal with mixed data/control Row specifications and takes into account different mechanisms of non-determinism as occurring in the design of embedded systems. Constraints imposed by other already implemented components are respected. Tbe scheduling approach avoids the explicit ennmeration of execution paths by using symbolic techniques and gnarantees to find a deadlock-free and bounded schedule if one exists. The generated schedule consists of statically scheduled basic blocks which are dynamically called at run time.

show abstract

Ensemble representation and techniques for exact control-dependent scheduling

Cited by 8 publications

References 15 publications

Scheduling constraint generation for communicating processes

Scheduling constraint generation for communicating processes

Incorporating speculative execution in exact control-dependent scheduling

Scheduling hardware/software systems using symbolic techniques

Contact Info

Product

Resources

About