A new symbolic technique for control-dependent scheduling

Radivojevic, I.; Brewer, Forrest

doi:10.1109/43.486271

Cited by 59 publications

(69 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…All schedules for these benchmarks are found in just a few seconds. More challenging CDFGs, ROTOR and S2R from [7], are shown in [7]. Our formulation shows the best improvement in cases with longer schedules.…”

Section: Dfg Resultsmentioning

confidence: 95%

“…Forward and backward validation is performed on the entire ensemble set until a complete pass with no pruning of that time-step's transition relation occurs. This algorithm originated in [7] and is shown here modified for an automata formulation. …”

Section: Causal Validationmentioning

confidence: 99%

“…This is accomplished using an encoding which only preserves whether or not an operation has been scheduled but not precisely when. In this way, we minimize the problems of [7] for long schedules and of [2][10] with regards to automata size.…”

mentioning

confidence: 99%

“…This ability is a key part of our long-term HLS goal. Further, we utilize exact symbolic ROBDD techniques because of their demonstrated success in finding all optimal constrained solutions [7] [8]. We wish to apply these techniques to constrained critical portions of large scale system designs.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Efficient encoding for exact symbolic automata-based scheduling

Haynal

Brewer

1998

Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design - ICCAD '98

View full text Add to dashboard Cite

1. ABSTRACT This paper presents an efficient encoding and automaton construction which improves performance of automata-based scheduling techniques. The encoding preserves knowledge of what operations occurred previously but excludes when they occurred, allowing greater sharing among scheduling traces. The technique inherits all of the features of BDD-based control dominated scheduling including systematic speculation. Without conventional pruning, all schedules for several large samples are quickly constructed. KeywordsHigh-level synthesis, scheduling, BDD, automata INTRODUCTIONThe scheduling problem occurs across diverse areas of application from networking to manufacturing to high-level synthesis of digital systems (HLS). Scheduling which assigns operations to time-slots in a synchronous system subject to data and control-flow dependencies as well as resource constraints is a key component of many HLS systems. Consequently, solving this problem efficiently is a direct way to enhance the abilities of such systems.Most solutions to the scheduling problem fall into two categories: i) heuristics and ii) integer linear programming (ILP

show abstract

Section: Dfg Resultsmentioning

confidence: 95%

Section: Causal Validationmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Efficient encoding for exact symbolic automata-based scheduling

Haynal

Brewer

1998

Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design - ICCAD '98

View full text Add to dashboard Cite

show abstract

“…CVLS [6] uses condition vectors to improve resource sharing among mutually exclusive operations. Radivojevic and Brewer [7] presented an exact symbolic formulation, which generates an ensemble schedule of valid, scheduled traces. The 'Waveschedule' approach [8] incorporates speculative execution into high-level synthesis to achieve its objective of minimising the expected number of cycles.…”

Section: Related Workmentioning

confidence: 99%

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Gupta

Dutt

Gupta

et al. 2003

IEE Proc., Comput. Digit. Tech.

View full text Add to dashboard Cite

The quality of high-level synthesis results for designs with complex and nested conditionals and loops can be improved significantly by employing speculative code motions. Two techniques are presented that add scheduling steps to the branch of a conditional construct with fewer scheduling steps. This 'balances' or equalises the number of scheduling steps in the conditional branches and increases the scope for application of speculative code motions. These branch balancing techniques have been applied 'dynamically' during scheduling. The authors have implemented algorithms for dynamic branch balancing techniques in a C-to-VHDL high-level synthesis framework called Spark. The utility of these techniques is demonstrated by experimental results on four designs derived from two moderately complex applications, namely, MPEG-1 and the GIMP image processing tool. These results show that the two branch balancing techniques can reduce the cycles on the longest path through the design by up to 38% and the number of states in the controller by up to 37%.

show abstract

Core Architectures for Digital Media and the Associated Compilation Techniques

Jess

Design of Systems on a Chip: Design and Test

View full text Add to dashboard Cite

A new symbolic technique for control-dependent scheduling

Abstract: The experiments demonstrate the ability of the proposed technique to efficiently exploit parallelism not explicitly specified in the input description.

Cited by 59 publications

References 42 publications

Efficient encoding for exact symbolic automata-based scheduling

Efficient encoding for exact symbolic automata-based scheduling

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Core Architectures for Digital Media and the Associated Compilation Techniques

Contact Info

Product

Resources

About