Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
84,891
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 2-1-3. Graduate Students Accepted. Fiscal Year 1997 1998 1999 2000 2001 2002 Total Number Accepted 15 17 19 4 3 6 64
in I.
"... In PAGE 14: ... The number of new staff researchers employed in the COE development area is listed below. Table2 -1-1. New Staff Researchers Employed Fiscal Year 1997 1998 1999 2000 2001 2002 COE development area 0 3 3 2 4 1 Special Coordination Fund supported area 0 2 2 2 2 1 (2) Recruitment of capable postdoctoral fellows In the COE development area, many postdoctoral fellows have been accepted from the inside and outside of the country by using the Special Coordination Funds and various fellowships.... In PAGE 14: ... The number of postdoctoral fellows accepted in the Special Coordination Fund supported area is listed below. Table2 -1-2. Postdoctoral Fellows Accepted Fiscal Year 1997 1998 1999 2000 2001 2002 Total Total Number Accepted 28 29 31 29 21 10 148 Number from Overseas 20 18 19 17 13 8 95 (3) Recruitment of graduate students The Institute has started the Cooperative Graduate School Program, first with University of Tsukuba, later on with many other universities such as Tokyo Institute of Technology, ... In PAGE 17: .... Table2 -3-1. Invited Researchers Other than Postdoctoral Fellows and Graduate Students Fiscal Year 1997 1998 1999 2000 2001 2002 Total Number Accepted 32 46 54 40 34 - 206 (2) Research collaboration We have concluded agreements on research cooperation with several overseas universities and research institutes.... In PAGE 18: ...esults. The second meeting will be held in the 6th year of the project (August 1 and 2, 2002). The final meeting will be held in the 10th year of the project. Table2 -4-1. Members of the External Evaluation Committee for the COE Project Name Affiliation Specialty Katsumi Tokumaru Professor Emeritus, University of Tsukuba Photochemistry Frans C.... ..."
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 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
Table 3: Elapsed times to compute , and e on which gures (15-17) were based.
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 2 complements the previous qualitative description of the programs by comparing some factual data: Operational since (year); Number of total applications; Number of (fully) certified companies; and Geographical aspects.
"... In PAGE 6: ... Lyon, France, May 15-17, 2006. Table2 . Voluntary security programs facts comparison.... ..."
Table 1: Filter impulse response values for 15, 17, and 21-tap inverses. Half of the impulse
1990
Cited by 18
TABLE I PUNCTURING PATTERNS FOR RATE-1/2 PCCC(1,17/15,17/15)
2007
Cited by 1
Results 1 - 10
of
84,891
