Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
64,110
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 3: All SH-frequent itemsets of the sample database SH-frequent itemset BC BD BCD lmv(X) 21 22 27 SH(X) 36.8% 38.6% 47.4%
2005
"... In PAGE 2: ... lmv(X)/Tmv = 27/57 = 0.474 gt; 35%. Therefore, {B, C, D} is an SH-frequent itemset. Table3 enumerates all SH-frequent itemsets. Table 1: Example of a transaction database with counting TID Transaction Count T01 {A, B, C, D, E, G, H} {1, 1, 1, 1, 1, 1, 1} T02 {F, H} {4, 3} T03 {B, C, D} {4, 3, 3} T04 {C, E} {4, 1} T05 {B, D} {3, 2} T06 {B, C, D} {3, 2, 1} T07 {B, C, D, E} {3, 4, 1, 2} T08 {A, F, G} {4, 2, 1} Table 2: Local measure value and itemset share value of each 1-itemset ... ..."
Cited by 2
Table 1. Intervals of time when speed declined at stations 22 and 27.
"... In PAGE 10: ... The procedure was as follows. First, the time intervals when speeds declined on the three middle lanes were obtained; see Table1 . The centers of these intervals are the most reliable estimates for the time when the apex of the transition passed through each detector.... In PAGE 11: ... 6b. Table1 also reveals that the three middle lanes were in transition at station 27 for about 19 minutes. This information is consistent with the two non-equilibrium black diamonds in the flow density plot of Fig.... ..."
Cited by 2
Table 12: Data for ATUM Traces on 32K Caches [3] J. H. Chang, H. Chao, and K. So, \Cache Design of A Sub-Micron CMOS System/370, quot; in Proceedings of the 14th Annual International Symposium on Computer Architecture, Pittsburgh, Pennsylvania, pp. 208{213, IEEE Computer Society and ACM SIGARCH, June 2{5, 1987. Computer Architecture News, 15(2), June 1987. [4] John L. Hennessy and David A. Patterson, Computer Architecture: A Quantitative Ap- proach. Morgan Kaufmann Publishers, Inc., 1990. [5] Mark D. Hill, \A Case for Direct-Mapped Caches, quot; Computer, 21(12):25{40, December 1988.
1993
Cited by 1
Table 13: Data for ATUM Traces on 128K Caches [6] Norman P. Jouppi, \Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Bu ers, quot; in Proceedings of the 17th Annual International Symposium on Computer Architecture, Seattle, Washington, pp. 364{373, IEEE Computer Society and ACM SIGARCH, May 28{31, 1990. Computer Architecture News, 18(2), June 1990. [7] S. Przybylski, M. Horowitz, and J. Hennessy, \Performance Tradeo s in Cache Design, quot; in Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pp. 290{298, IEEE Computer Society and ACM SIGARCH, May 30{ June 2, 1988. Computer Architecture News, 16(2), May 1988. 36
1993
Cited by 1
Tables 57 22 -27 4194277 8 176 47 -541 140737488354787 3 141
1999
Cited by 5
Tables 57 22 -27 4194277 8 176 47 -541 140737488354787 3 141
1999
Cited by 5
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 III. The basic simulation workload ACM Transactions on Embedded Computing Systems, Vol. V, No. N, June 2004.
2004
Cited by 7
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.... ..."
Results 1 - 10
of
64,110
