G. Zilles. Master/Slave Speculative Parallelization and Approximate Code. PhD thesis, University of Wisconsin -- Madison, 2002.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dataflow Dominance: A Definition and Characterization - Ramsay (2003) Self-citation (Wisconsin) (Correct)
No context found.
Craig Zilles. Master/slave speculative parallelization and approximate code. Thesis, University of Wisconsin, 2002.
Appears in the proceedings of the 35th International.. - Craig Zilles Department (2002) Self-citation (Sciences) (Correct)
No context found.
C. Zilles. Master/Slave Speculative Parallelization and Approximate Code. PhD thesis, Computer Sciences Department, University of Wisconsin--Madison, Aug. 2002.
Master/S;ave Speculative Parallelization - Sohi (2002) Self-citation (Sciences) (Correct)
....with a hot loop nest from gcc, shown in Figure 5. The variable sometimes max is a loop carried dependence, but, as shown in the control flow graph in Figure 6a, the inner loop is only executed on 0.1 percent of outer loop iterations. 3. 1 Task Selection Our sensitivity analysis results (in [24]) indicate our current automatic distiller prototype is largely insensitive to the exact task boundaries selected (performance varies less than 5 for most benchmarks) provided the tasks are large enough (greater than 100 instructions on average) to amortize the communications overheads. As a ....
....(performance varies less than 5 for most benchmarks) provided the tasks are large enough (greater than 100 instructions on average) to amortize the communications overheads. As a result, we only highlight a few important issues here; a complete description of our task selector can be found in [24]. Tasks are selected by identifying instructions in the original program to be the beginning of new tasks. A fork instruction is inserted into the distilled program at the task boundary so it can signal the beginning of a new task. The original program is annotated with these task boundaries ....
[Article contains additional citation context not shown here]
C. Zilles. Master/Slave Speculative Parallelization and Approximate Code. PhD thesis, Computer Sciences Department, University of Wisconsin--Madison, Aug. 2002.
Compiler Optimization of Value Communication for Thread-Level.. - Zhai (2005) (Correct)
No context found.
G. Zilles. Master/Slave Speculative Parallelization and Approximate Code. PhD thesis, University of Wisconsin -- Madison, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC