Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
42,400
Table 1. Runtime Overhead for Compiler- based Split Control and Data Stack (All time in seconds)
2002
Cited by 31
Table 2.1: Front-ends and compiler based on the GNU C compiler
1997
Cited by 19
Table 1. Runtime Overhead for Compiler- based Split Control and Data Stack (All time in seconds)
2002
"... In PAGE 5: ... The major failure event categories identified in the dependability literature to date include Hardware, Software, Human Error, Process, Environment, Security, External, Planned Downtime, and Design. Table1 includes two sources estimated failure distribution allocation among the categories of causes. More detailed studies have been done and published among IT management journals, but their results are somewhat questionable as they ... ..."
Table 1: Base optimizations.
1993
"... In PAGE 11: ... 3 Optimizations and Code Transformations 3.1 Base Optimizations A standard set of classic optimizations is available in commercial compilers today #28see Table1 #29.... ..."
Cited by 3
Table 1: Base optimizations.
1993
"... In PAGE 11: ... 3 Optimizations and Code Transformations 3.1 Base Optimizations A standard set of classic optimizations is available in commercial compilers today #28see Table1 #29.... ..."
Cited by 3
Table 1. Compilation-based function f(x, y) = x2 + y3 defined over domain {1, . . . , 5}.
2004
"... In PAGE 6: ... This means we need exponential time and space to construct these functions. For example, consider the function f(x, y) shown in Table1 . In this example we show a function which is composed of two functions over different variables with their respective results added together.... ..."
Cited by 2
Table 1. Compilation-based function f(x, y) = x2 + y3 defined over domain {1, . . . , 5}.
2004
"... In PAGE 10: ... This means we need exponential time and space to construct these functions. For example, consider the function f(x, y) shown in Table1 . In this example we show a function which is composed of two functions over different variables with their respective results added together.... ..."
Cited by 2
Table 6: Ratios of code expansion.
1991
"... In PAGE 31: ... The profile column shows the sizes of pro#0Cle-based code optimized programs relative to the sizes of globally optimized programs. In Table6 , we show that our prototype compiler has e#0Bectively controlled the code expansion due to forming super-blocks. The cost of implementing the pro#0Cle-based classic code optimizations is modest.... ..."
Cited by 21
Table 2: Instruction execution counts from a register deprivation base trial
1993
"... In PAGE 4: ...2 Comparative measurements To separate the impact that each additional register has on the global optimization phases of the optimizer from any side effects that they might have on the code generated for each benchmark program, a base trial must be per- formed in which the compiler produces code without performing any global optimization transformations. Unlike the optimized trial, the results of the base trial shown in Table2... ..."
Cited by 4
Table 6.1: Memory Reference Characteristics of Address Traces The traces for the Weather, Simple and FFT applications were derived using a post- mortem scheduling scheme whereas the trace for the Speech application was derived using a compiler-based tracing scheme. A description of the applications and the schemes used to acquire the traces is presented in Chaiken et al. [1990]. The postmortem and compiler-based tracing techniques involve running the application as a set of processes on a uniprocessor to simulate the execution of the application on a multiprocessor. Using statistics acquired from the uniprocessor execution, the memory- 63
1991
Cited by 3
Results 11 - 20
of
42,400
