Trace scheduling

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

Topic mentions per year

Topic mentions per year

1981-2014
02419812014

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… (More)
Is this relevant?
2011
2011
Since its introduction by Joseph A. Fisher in 1979, trace scheduling has influenced much of the work on compile-time ILP… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
This article presents the first optimal algorithm for trace scheduling. The trace is a global scheduling region used by compilers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Translation validation consists of transforming a program and <i>a posteriori</i> validating it in order to detect a modification… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2002
2002
VLIW processors are statically scheduled processors and their performance depends on the quality of schedules generated by the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The basic idea behind software pipelining was first developed by Patel and Davidson for scheduling hardware pipe-lines. As… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Multiflow compiler uses the trace scheduling algorithm to find and exploit instruction-level parallelism beyond basic blocks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • 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… (More)
  • table 1
  • table 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local compaction… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?