Results 1 - 10 of 65,486

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.

in Implementing Distributed Search Structures
by Padmashree Krishna, Theodore Johnson 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 9. 11-pt average for different target word size (WSJ database).

in Tuning a Corpus Analysis Approach for Automatic Query Expansion
by Susan Gauch, Jianying Wang
"... In PAGE 9: ... After we found the optimal target word location, we want to know how many target words are enough. Table9 shows the average of 11-pt average for different numbers of target words (all using offset 0). Surprisingly, 4000+ target words give the best performance, with the added benefit of dramatically lower computation demands since creating the similarity matrix is O(Nt 2) where Nt is the number of target... ..."

Table 9. 11-pt average for different target word size (WSJ database).

in Tuning a Corpus Analysis Approach for Automatic Query Expansion
by Susan Gauch, Jianying Wang
"... In PAGE 9: ... After we found the optimal target word location, we want to know how many target words are enough. Table9 shows the average of 11-pt average for different numbers of target words (all using offset 0). Surprisingly, 4000+ target words give the best performance, with the added benefit of dramatically lower computation demands since creating the similarity matrix is O(Nt 2) where Nt is the number of target... ..."

Table 9.11 Long Wall Results

in Rhys Cooper, Building Maps Using Reactive Robotics iii
by Rhys Cooper, Supervisor Noel Sharkey

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.

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 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

in A Unified Framework for Hybrid Access Cache Design and Its Applications
by Kevin B. Theobald, Herbert H. J. Humy, Guang R. Gao 1993
Cited by 1

Table 9 and 11.

in Combining Shared and Distributed Memory Programming Models on Clusters of Symmetric Multiprocessors: Some Basic Promising Experiments
by L. Giraud 2001
"... In PAGE 7: ...0d0 do j=ia(i), ia(i+1)-1 y(i) = y(i) + a(j)*x(ja(j)) enddo enddo !$OMP END DO !$OMP END PARALLEL Algorithm 1: OpenMP directives to parallelize the sparse matrix-vector product. In Table9 and 11, we report experiments where only one multi-threaded MPI process is used. Actually in such a situation no message is exchanged, and then the possible network bottleneck is removed.... ..."
Cited by 1

Table 4 Occurrences of AMERICA* in 33 pre9/11 texts

in Gutachter: Ao.Univ.-Prof. Dr. Wolfgang Grosser
by Zur Erlangung Des Magistergrades, An Der Geisteswissenschaftlichen Fakultät, Der Universität Salzburg, Dominik Engel, Salzburg Februar
"... In PAGE 54: ....3.2 Direct References to Self and Other The keywords that obviously contribute to the intended model of self and other occur in different quantities before and after 9/11. Table4 and Table 5 show the difference between references to America* for the two phases. It can be seen that after 9/11 Bush refers to this important group of keywords more than 65% more often than he did before 9/11.... ..."

Table 2. Sample Entries for Vancouver, Canada*

in Data Processing Procedures and Methodology for Estimating Trip Distances for the 1995 American Travel Survey (ATS)
by Ho-Ling Hwang Jane, Jane Rollow
"... In PAGE 18: ...tc.). Misspelled foreign place names were especially common, where ORNL matched the place names with the latitude and longitude so that distance could be calculated. Table2 shows examples of various spellings and codings of location names for Vancouver, Canada. 4.... ..."

Table 6 Occurrences of TERROR* in 33 pre9/11 texts

in Gutachter: Ao.Univ.-Prof. Dr. Wolfgang Grosser
by Zur Erlangung Des Magistergrades, An Der Geisteswissenschaftlichen Fakultät, Der Universität Salzburg, Dominik Engel, Salzburg Februar
"... In PAGE 54: ... Direct references to keywords relating to other provide support for this thesis. The data for occurrences of terror , terrorists , terrorism can be seen in Table6 and Table 7. Figure 4 (page 56) shows a plot of occurrences of the two major groups of keywords relating to direct references of self and other and serves to illustrate the more frequent use of these keywords after 9/11.... ..."
Results 1 - 10 of 65,486