Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
81,655
Table C.2: Values of (r1,n1 2 , t0, 0) for the single message pingpong between two nodes of the same cluster on the SUPRENUM and neighbouring nodes on the Intel iPSC/860, Touchstone Delta, Intel Paragon and Meiko CS-2 computers. The Delta measurements were made at Caltech on 17 Jan. 1992, the Paragon measurements at ORNL 25-28 May, 1993, and the CS-2 measurements at Southampton University on 9 July, 1993. Subsequent hardware and software changes may have improved the results.Speci cation Range
Table C.2: Values of (r1,n1 2 , t0, 0) for the single message pingpong between two nodes of the same cluster on the SUPRENUM and neighbouring nodes on the Intel iPSC/860, Touchstone Delta, Intel Paragon and Meiko CS-2 computers. The Delta measurements were made at Caltech on 17 Jan. 1992, the Paragon measurements at ORNL 25-28 May, 1993, and the CS-2 measurements at Southampton University on 9 July, 1993. Subsequent hardware and software changes may have improved the results.Speci cation Range
Table C.2: Values of (r1,n1 2 , t0, 0) for the single message pingpong between two nodes of the same cluster on the SUPRENUM and neighbouring nodes on the Intel iPSC/860, Touchstone Delta, Intel Paragon and Meiko CS-2 computers. The Delta measurements were made at Caltech on 17 Jan. 1992, the Paragon measurements at ORNL 25-28 May, 1993, and the CS-2 measurements at Southampton University on 9 July, 1993. Subsequent hardware and software changes may have improved the results.Speci cation Range
Table C.2: Values of (r1,n1 2 , t0, 0) for the single message pingpong between two nodes of the same cluster on the SUPRENUM and neighbouring nodes on the Intel iPSC/860, Touchstone Delta, Intel Paragon and Meiko CS-2 computers. The Delta measurements were made at Caltech on 17 Jan. 1992, the Paragon measurements at ORNL 25-28 May, 1993, and the CS-2 measurements at Southampton University on 9 July, 1993. Subsequent hardware and software changes may have improved the results.Speci cation Range
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 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 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
Tables, quot; Proc. of the 1986 SIGMOD Conf., Washington, DC, May 1986.
1990
Cited by 85
Table: Bridging the Gap between the Digital and the Tangi- ble. In Journal of Planning in Education and Research, Vol- ume 21, pp.195-202. 4. Bier, E., et al., Toolglass and Magic Lenses: The Seethrough Interface. In proceedings of ACM SIGGRAPH 1993, Anaheim, CA., Aug. 1993, pp. 73-80 5. Cotting, D.; Naef, M.; Gross, M.; Fuchs, H., quot;Embedding Imperceptible Patterns into Projected Images for Simultane- ous Acquisition and Display. quot; Third IEEE and ACM Interna- tional Symposium on Mixed and Augmented Reality, 02-05 Nov. 2004 Page(s):100 109.
2005
Cited by 7
Results 1 - 10
of
81,655
