Paper Info
Title
Incorporating speculative execution in exact control-dependent scheduling
Abstract
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.
Year
DOI
Venue
1994
10.1145/196244.196473
DAC
Keywords
Field
DocType
design automation,automatic control,machinery,distributed computing,satisfiability,speculative execution,closed form solution,computer graphics,boolean functions
Boolean function,Permission,Speculative execution,Scheduling (computing),Computer science,Parallel computing,Algorithm,Closed-form expression,Real-time computing,Automatic control,Electronic design automation,Schedule
Conference
ISSN
ISBN
Citations 
0738-100X
0-89791-653-0
17
PageRank 
References 
Authors
0.98
17
2
Name
Order
Citations
PageRank
Ivan Radivojevic1453.47
Forrest Brewer241462.95