On applicability of symbolic techniques to larger scheduling problems

Authors:
I. Radivojevic;F. Brewer
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara;Department of Electrical and Computer Engineering, University of California, Santa Barbara
Venue:
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Year:
1995

Citing 10
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Zero-suppressed BDDs for set manipulation in combinatorial problems

DAC '93 Proceedings of the 30th international Design Automation Conference
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Incorporating speculative execution in exact control-dependent scheduling

DAC '94 Proceedings of the 31st annual Design Automation Conference
Ensemble representation and techniques for exact control-dependent scheduling

ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
Execution interval analysis under resource constraints

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A scheduling method by stepwise expansion in high-level synthesis

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
A new approach to pipeline optimisation

EURO-DAC '90 Proceedings of the conference on European design automation

Efficient encoding for exact symbolic automata-based scheduling

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Representing and Scheduling Looping Behavior Symbolically

ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been generally assumed that recently introduced symbolic techniques are applicable only to small scheduling problems. This report demonstrates that applicability of these techniques can be extended to larger dataflow graphs by: (i) using Zero-Suppressed BDDs, (ii) applying a set of interior constraints that reduce the size of intermediate solutions, (iii) implicit application of complex constraints, and (iv) formulation of set-based heuristics that preserve whole sets of partial solutions exhibiting desirable properties. Both heuristic and exact methods are discussed using standard benchmarks and are compared to the previously published work.