Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
66,484
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 14: Data for Multitasking Traces on 8K Caches [8] Andr e Seznec, \A case for two-way skewed-associative caches, quot; in Proceedings of the 20th Annual International Symposium on Computer Architecture, San Diego, California, pp. 169{178, ACM SIGARCH and IEEE Computer Society, May 17{19, 1993. Computer Architecture News, 21(2), May 1993. [9] Alan Jay Smith, \Cache Memories, quot; ACM Computing Surveys, 14(3):473{530, September 37
1993
Cited by 1
TABLE 4 CONFIRMATORY SAMPLE ANALYSES GENERAL ATOMICS SAN DIEGO, CALIFORNIA
2000
Table 1 Legistlatively-mandated membership of the San Diego Bay Interagency Water Quality Panel (Bay Panel)
"... In PAGE 4: ...Management, 29(2) (2001) Page 4 of 21 to coordinate biological monitoring efforts within the Bay and to share data. In 1987, a formal activity was initiated by California State Assembly Bill 158, authored by Assemblyman Lucy Killea, which established The San Diego Bay Interagency Water Quality Panel (Bay Panel) with a specified membership ( Table1 ). The legislation was designed to formally encourage governmental agencies and non- governmental organizations with jurisdiction or interests in San Diego Bay to coordinate their efforts across physical, chemical, biological and policy domains.... ..."
Table 1: Convergence rates for several = ( 1; 2)T for uniform re nement (upper) and adaptive re nement (lower). 4. References 1 Bank, R.E., Dupont, T.F., Yserentant, H.: The hierarchical basis multigrid method. Numer. Math. 52, 427-458 (1988) 2 Bank, R.E., Gutsch, S.: Hierarchical basis for the convection-di usion equation on unstructured meshes. Ninth Interna- tional Symposium on Domain Decomposition Methods for Partial Di erential Equations (P. Bj rstad, M. Espedal and D. Keyes, eds.), J. Wiley and Sons, New York, (1996) to appear 3 Bank, R.E., Gutsch, S.: The generalized hierarchical basis two-level method for the convection-di usion equation on a regular grid. submitted to the Proceedings of the 5th European Multigrid Conference in Stuttgart (1996) 4 Bank, R.E., Xu, J.: The hierarchical basis multigrid method and incomplete LU decomposition. Seventh International Symposium on Domain Decomposition Methods for Partial Di erential Equations (D. Keyes and J. Xu, eds.), 163-173. AMS, Providence, Rhode Island (1994) 5 Reusken, A.A.: Approximate cyclic reduction preconditioning. Preprint RANA 97-02, Eindhoven University of Technology Addresses: Randolph E. Bank, Department of Mathematics, University of California at San Diego, USA Sabine Gutsch, Mathematical Seminar II, Christian-Albrechts-University Kiel, Germany
Table 1: Load Balancing Statistics [18] Shasha D. and Goodman N. Concurrent Search Tree Algorithms, ACM Transactions on Database Systems, 13(1), 1988, pp. 53-90. [19] Weihl E. W. and Wang P. Multi-version Memory: Software cache Management for Concurrent B- Trees, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 650-655. [20] Yen I. and Bastani F. Hash Table in Massively Parallel Systems, Proceedings of the 1992 Interna- tional Conferences on Computer Languages, April 20-23, 1992, pp. 660-664.
1992
"... In PAGE 16: ... With hot spots the variation is much greater, indicating the nice e ect load balancing has for smoothing the variation and reducing the gradient. Finally Table1 shows the calculated average number of moves made by a node in the entire system, with and without hot spots and with and without load balancing, and the normalized variation of the capacity at each processor from the mean. The table shows that the load balancing reduces the coe cient of variation at the cost of a very small increase in the average moves in the system, indicating that load balancing is e ective with low overhead.... ..."
Cited by 4
TABLE 1 BACKGROUND EXPOSURE RATES AND RADIONUCLIDE CONCENTRATIONS IN SOIL GENERAL ATOMICS SAN DIEGO, CALIFORNIA
2000
TABLE 5 SOIL RELEASE CRITERIA1 HOT CELL FACILITY SITE GENERAL ATOMICS SAN DIEGO, CALIFORNIA
2000
Table 1: Parallel complexity of block PCG for a 3D elliptic problem on two di erent parallel architectures: a three-dimensional mesh of processors and a binary hypercube. n: number of points in each dimension; p: total number of processors.Krylov-Schwarz methods have been reported on extensively, together with other types of domain decomposition methods, such as Krylov-Schur (or \iter- ative substructuring quot;) since 1987 in the proceedings of the nearly annual Inter- national Conference on Domain Decomposition Methods for Partial Di erential Equations [6, 7, 19, 20, 23, 25, 29], and also in [24]. Here we summarize some results of [5] for a two-dimensional body- tted 14
1995
Cited by 19
Table 5: Star Trek 2: 4109 ratings; training set density = 23#25; 25 splits
1995
"... In PAGE 21: ...38. Table5 shows the results for a larger group: 4109 ratings from 141 people on 94 episodes #2831#25 of the maximum possible number of ratings#29. This time the mean errors for linfeat, nearest neighbor, and regression are all very similar at 1.... ..."
Results 1 - 10
of
66,484
