Sciweavers

56 search results - page 1 / 12
» Efficient Backtracking Instruction Schedulers
Sort
View
IEEEPACT
2000
IEEE
14 years 3 months ago
Efficient Backtracking Instruction Schedulers
Santosh G. Abraham, Waleed Meleis, Ivan D. Baev
CASES
2007
ACM
14 years 2 months ago
A backtracking instruction scheduler using predicate-based code hoisting to fill delay slots
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
Tom Vander Aa, Bingfeng Mei, Bjorn De Sutter
ICTAI
2007
IEEE
14 years 5 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
PLDI
1996
ACM
14 years 3 months ago
A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
Alexandre E. Eichenberger, Edward S. Davidson
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
14 years 3 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin