Results 11 - 20
of
152,679
Table 5. Non-Return Indirect Branch Profiling (User Mode) in Java Run Time System Static Branch Sites Dynamic Instances
Table 6. Non-Return Indirect Branch Profiling (Kernel Mode) in Java Run Time System Static Branch Sites Dynamic Instances
"... In PAGE 20: ...Table 7 shows that kernel branches benefit from split structures with even small (32 or 64-entry) BTB configurations. This is not surprising since Table6 and Figure 4 show that a small number of indirect branches dominate dynamic branch instances in kernel. In kernel, invocations of indirect branches and the corresponding target access patterns are relatively constant across applications.... ..."
Table 1. Run-times in seconds of benchmarked systems.
1997
"... In PAGE 4: ... Details of implementations on individual target plat- forms and analysis follow next. Table1 summarizes run times on the platforms, and Figure 4 shows a plot of the results. 5.... ..."
Cited by 3
Table 1. Run-times in seconds of benchmarked systems.
1997
"... In PAGE 4: ... Details of implementations on individual target plat- forms and analysis follow next. Table1 summarizes run times on the platforms, and Figure 4 shows a plot of the results. 5.... ..."
Cited by 3
Table 8: Comparison of the four procedures.
"... In PAGE 21: ... The run times (in seconds) for obtaining IP optimal solutions are also shown. Table8... In PAGE 22: ...developed by Wilhelm and Srinivasa (1994) and with the OSL branch and bound solver applied directly to each problem. The run times in Table8 are all in seconds. Results show that the aggregation scheme is successful, not only in improving bounds from the LP relaxation, but also in finding optimal integral solutions within reasonable times.... ..."
Table 3: Run time system performance, system A (Pentium 4, 1600 MHz). The median times reported by the MPD script vsuite/timings/report.sh are shown.
2005
"... In PAGE 3: ... The SVR4 tests were redone on a DNARD system (for its ARM cpu, no assembler stubs are provided in either the SR or MPD distributions). Table3 shows a factor-of-about-ten performance hit for the operations that require context switches; note, however, that the absolute values for all such operations are still smaller than 5 s on 1600 MHz machine and will likely not be noticeable if a parallelized program is run on a LAN-coupled cluster: on the switched LAN connected to the test... In PAGE 5: ... Compared to the assembler routines, they are only slower by a factor of 10 (see table 2). Table3 shows three classes of high level operations. 1.... ..."
Table 4: Run time system performance, system B (StrongARM SA-110, 233 MHz). The median times reported by the MPD script vsuite/timings/report.sh are shown.
2005
Table 2. Running time of Authorization System for quot;Hello World quot; Example
"... In PAGE 7: ...uns Windows Server 2003 and .NET Framework 1.1. Table2 shows the results averaged over 50 runs. The column, GRAM.... ..."
Results 11 - 20
of
152,679