 | Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg - 1993 - 248 Seiten
...isolate errors. Further details about the CM-5 networks can be found in [1] and [2]. References [1] CE Leiserson, ZS Abuhamdeh, DC Douglas, CR Feynman,...network architecture of the Connection Machine CM-5. In Symposium on Parallel and Distributed Algorithms '92, June 1992. [2] Thinking Machines Corporation,... | |
 | Alan Gibbons, Paul Spirakis - 1993 - 452 Seiten
...Verlag, 1992. [9] AM Gibbons and MS Paterson. Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1992, San Diego, California, 257-263. [10] AM Gibbons and W. Rytter. Efficient Parallel Algorithms.... | |
 | Kevin Bolding, Lawrence Snyder - 1994 - 340 Seiten
...Universal networks for hardware-efficient supercomputing. In IEEE Transactions on Computers (1985) 7. CE Leiserson, ZS Abuhamdeh, DC Douglas, CR Feynman,...Network Architecture of the Connection Machine CM-5. In Symposium on Parallel Algorithms and Architectures (1992) processor random element random 128 bytes... | |
 | Monique Becker, Luc Litzler, Michel Trehel - 1994 - 330 Seiten
...Performance Fortran Handhook. The MIT Press. 1994. [13] CE Leiserson, ZS Ahuhamdeh, DC Douglas, C. R Feynman, MN Ganmukhi, JV Hill, WD Hillis, BC Kuszmaul....network architecture of the Connection Machine CM-5. In: 4th Symp. Parallel Algorithms & Architectures. l19921 272-285. [14] SJ Lo Verso, M. Isman. A. Nanopoulos,... | |
 | Serge Abiteboul, Eli Shamir - 1994 - 668 Seiten
...1992. [17] CG Plaxton and T. Suel. A lower bound for sorting networks based on the shuffle permutation. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 70—79, June 1992. To appear in Mathematical Systems Theory. [18] CG Plaxton and T. Suel. A super-logarithmic... | |
 | Prithviraj Banerjee - 1995 - 260 Seiten
...(K. Holding and L. Snyder, Eds.), pp. 241-255, Springer- Verlag, May 1994. 12. CE Leiserson et ai, "The network architecture of the Connection Machine CM-5," in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, (San Diego, CA.), pp. 272-285, Association... | |
 | Dharma P. Agrawal - 1995 - 174 Seiten
...the 8th International Parallel Processing Symposium, pp. 396-401, Apr. 1994. 15. CE Leiserson et al, "The network architecture of the Connection Machine CM-5," in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, (San Diego, CA.), pp. 272-285, Association... | |
 | Will Moore, Wayne Luk - 1995 - 492 Seiten
...arithmetic can be done on CCMs effectively. References [I] J. Arnold, D. Buell and E. Davis, "Splash 2," Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June, 1992, pp. 316-322. [2] P. Athanas and L. Abbott, "Real-Time Image Processing on a Custom Computing... | |
 | Richard J. Nowakowski - 1998 - 556 Seiten
...[Leiserson et al. 1992] Charles Eric Leiserson et al., "The network architecture of the CM-5", pp. 272-285 in Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (San Diego, 1992), ACM Press, New York, 1992. [Lolli 1763] Giovanni Battista Lolli, Osservazione teonco-pratiche... | |
 | 1996 - 608 Seiten
...1991. [JM92] DB Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. In Proceedings of the 4th Annual ACM Symposium on Parallel algorithms and architectures, San Diego, California, pages 363-372, 1992. [КагЭЗ] DR Karger. Global min-cuts in RNC, and other... | |
| |
Yang, and R. Zak. The network architecture of the Connection Machine CM-5. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272-285, July 1992. 
