Incorporating speculative execution in exact control-dependent scheduling

1 January 1994

conference paper
Published by Association for Computing Machinery (ACM)

p. 479-484
https://doi.org/10.1145/196244.196473

Abstract

-This paper describes a symbolic formulation that allows incorporation of speculative operation execution (pre-execution) 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.

Keywords

DESIGN AUTOMATION
AUTOMATIC CONTROL
MACHINERY
DISTRIBUTED COMPUTING
SATISFIABILITY
SPECULATIVE EXECUTION
CLOSED FORM SOLUTION
COMPUTER GRAPHICS
BOOLEAN FUNCTIONS

This publication has 0 references indexed in Scilit: