Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
15,493
Table 11: Data for ATUM Traces on 8K Caches References [1] Anant Agarwal, John Hennessy, and Mark Horowitz, \Cache Performance of Operating Systems and Multiprogramming, quot; ACM Transactions on Computer Systems, 6(4):393{431, November 1988. [2] Anant Agarwal and Steven D. Pudar, \Column-Associative Caches: A Technique for Re- ducing the Miss Rate of Direct-Mapped Caches, quot; in Proceedings of the 20th Annual Inter- national Symposium on Computer Architecture, San Diego, California, pp. 179{190, ACM SIGARCH and IEEE Computer Society, May 17{19, 1993. Computer Architecture News, 21(2), May 1993.
1993
Cited by 1
Table 3: Test Set of C Programs In ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1992 326
1992
"... In PAGE 5: ... Therefore, dead code elimination is invoked to delete these blocks. 5 Measurements Static and dynamic frequency measurements and in- struction cache performance measurements were taken from a number of well-known benchmarks, UNIX util- ities, and one application (see Table3 ). The code was generated for the Motorola 68020/68881 processor and... ..."
Cited by 29
Table III. The basic simulation workload ACM Transactions on Embedded Computing Systems, Vol. V, No. N, June 2004.
2004
Cited by 7
Table 1. WET sizes.
"... In PAGE 8: ... 5.1 WET Sizes Table1 lists the benchmarks considered and the lengths of the program runs which vary from 365 and 751 Mil- lion intermediate level statements. The effect of our two Proceedings of the 37th International Symposium on Microarchitecture (MICRO-37 2004) ... ..."
Table 1: Numbers of gures or pictures in articles of the Proceedings IEEE Vi- sualization and ACM SIGGRAPH. On the average, each article contains about eight gures.
1998
Cited by 1
Table 1: Traditional vs. Partial Inlining: Amount of Inlining Achieved [7] K. D. Cooper, M. W. Hall, and L. Torczon, \Unexpected Side E ects of Inline Substitution quot;, ACM Letters on Programming Languages and Systems vol. 1 no. 1, March 1992, pp. 22{32. [8] J. W. Davidson and A. M. Holler, \Subprogram Inlining: A Study of its E ects on Program Execution Time quot;, IEEE Transactions on Software Engineering vol. 18 no. 2, Feb. 1992, pp. 89{102. [9] K. De Bosschere and S. K. Debray, \alto : A Link-Time Optimizer for the DEC Alpha quot;, Technical Report 96-15, Dept. of Computer Science, The University of Arizona, June 1996. [10] J. Dean and C. Chambers, \Towards Better Inlining Decisions using Inlining Trials quot;, Proc. 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida, June 1994, pp. 273{282. [11] R. E. Hank, Region-based Compilation, Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1996. [12] R. E. Hank, W. W. Hwu, and B. R. Rau, \Region-Based Compilation: An Introduction and Motivation quot;, Proc. 28th IEEE/ACM Symposium on Microarchitecture, Nov. 1995, pp. 158{168. 11
"... In PAGE 9: ... Partial inlining can be compared to traditional inlining along two dimensions: rst, the amount of inlining that can be achieved for a given \budget quot; of code growth; and second, the improvement in execution time. Table1 illustrates the rst dimension using three di erent budgets (a code growth factor of m% in this table indicates that each function is allowed to increase in size by at most m%). Three groups of data are shown for each benchmark program: the number of call sites expanded inline; the total number of basic blocks inlined across all of the call sites expanded; and the total number of instructions in these basic blocks.... ..."
Table 5. Most cited Journals in ER papers up to 1999. Journal Title # Cites ACM Transactions on Database Systems 886 Communications of the ACM 278
"... In PAGE 4: ... Source names in Table 4 follow the journal abbreviations used by the Web of Science. See Table5 for a list of the most popular ones. Table 4 is predominated by journal papers, except the two ER papers by Scheuermann and Santos.... In PAGE 4: ... Table 4 is predominated by journal papers, except the two ER papers by Scheuermann and Santos. Table5 lists most frequently cited journals in ER papers between 1979 and 1999. Table 1.... ..."
Table 1. Statistics for GD, ACM [8], and NCSTRL [17].
2003
"... In PAGE 11: ...4 Statistical of the Graph Drawing Literature We compared the data from the GD database, with the data from two computer science databases, the ACM database [8] and the NCSTRL database [17]. Table1 shows a summary of the overall statistics and they are examined in the detail in the appendix. References 1.... ..."
Cited by 19
Table 2: Compression evaluation using les in the Canterbury corpus (Large Set) The original le size (with some pre xes), compressed le size by gzip and compress, and the improvement (%) made by LZW-FP, FPA, and FPA-24 over gzip and compress [FM95] M. Farach and S. Muthukrishnan. Optimal parallel dictionary matching and compression. In ACM Symposium on Parallel Algorithms and Architectures, 1995. [FNS+95] M. Farach, M. Noordeweir, S. Savari, L. Shepp, A. J. Wyner, and J. Ziv. The entropy of DNA: Al- gorithms and measurements based on memory and rapid convergence. In ACM-SIAM Symposium on Discrete Algorithms, 1995.
1998
Cited by 2
Results 11 - 20
of
15,493
