Skip to search formSkip to main contentSkip to account menu

Trace scheduling

Trace scheduling is an optimization technique used in compilers for computer programs. A compiler often can, by rearranging its generated machine… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Instruction schedulingLoop unrollingMultiflowST200 family

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Preliminary Evaluation of Trace Scheduling for Global Microcode Compaction
Fisher has recently described a new procedure for global microcode compaction which he calls "trace scheduling." We have… 
2004
2004
The Performance Potential of Trace-based Dynamic Optimization
Dynamic optimization can apply powerful optimizations to h ot execution paths that span traditional boundaries such as branches… 
Review
2003
Review
2003
CSE 231 project report —-survey on instruction scheduling
This paper surveys past research on instruction scheduling for exploiting more Instruction Level Parallelism (ILP). We focus on… 
2002
2002
On the Benefits of Speculative Trace Scheduling in VLIW Processors
VLIW processors are statically scheduled processors and their performance depends on the quality of the compiler’s scheduler. We… 
2002
2002
Speculative trace scheduling in VLIW processors
VLIW processors are statically scheduled processors and their performance depends on the quality of schedules generated by the… 
2001
2001
EPIC Instruction Scheduling Based on Optimal Approaches
This paper presents a method for instruction scheduling that considers the scheduling restrictions inherent in VLIW processors… 
2000
2000
Optimizing the cache performance of non-numeric applications
The latency of accessing instructions and data from the memory subsystem is an increasingly crucial performance bottleneck in… 
1999
1999
Performance Limits of Trace Caches
A growing number of studies have explored the use o f trace caches as a mechanism to increase instruction fetch bandwidth. The… 
1992
1992
Low level scheduling using the hierarchical task graph
This paper introduces a new efficient instruction scheduling algorithm that can schedule across basic blocks. Scheduling globally… 
1984
1984
Parallelism, memory anti-aliasing and correctness for trace scheduling compilers (disambiguation, flow-analysis, compaction)
Trace scheduling 12 is a technique for transforming sequential programs into parallel code. When this investigation began, trace… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)