Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Trace scheduling

Trace scheduling is an optimization technique used in compilers for computer programs. A compiler often can, by rearranging its generated machine… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
GPU performance depends not only on thread/warp level parallelism (TLP) but also on instruction-level parallelism (ILP). It is… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Multiflow compiler uses the trace scheduling algorithm to find and exploit instruction-level parallelism beyond basic blocks… Expand
  • figure 1-1
  • figure 1-2
  • figure 1-3
  • figure 1-4
  • figure 1-5
Is this relevant?
2000
2000
Microprocessors must exploit both instruction-level parallelism (ILP) and memory parallelism for high performance. Sophisticated… Expand
  • figure 2.6
  • figure 2.7
  • figure 5.4
  • figure 6.1
  • figure 8.1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The basic idea behind software pipelining was first developed by Patel and Davidson for scheduling hardware pipe-lines. As… Expand
Is this relevant?
1988
1988
We discuss the integration of a trace scheduling optimizer into a retargetable optimizing microcode compiler that handles complex… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Very Long Instruction Word (VLIW) architectures were promised to deliver far more than the factor of two or three that current… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1984
1984
Fisher's trace scheduling procedure for global compaction has proven to be able to produce significant reduction in execution… Expand
  • table 1
  • table 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
 
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?