Martin C. Herbordt
- [1] F. Annexstein and M. Baumslag (1990): "A Unified Approach to Offline Permutation Routing," Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures. Google Scholar
Digital Library
- [2] W. C. Athas and C. L. Seitz (1988): "Multicomputers: Message-Passing Concurrent Computers," IEEE Computer, August. Google ScholarDigital Library
- [3] K. E. Batcher (1980): "Design of the Massively Parallel Processor," IEEE Trans. on Computers, C-29 (9).Google ScholarDigital Library
- [4] W. J. Bouknight, S. A. Denenberg, D. E. McIntyre, J. M. Randall, A. H. Sameh, D. L. Slotnick (1972): "The Illiac IV System," Proc. of the IEEE, 60 (4).Google Scholar
- [5] W. J. Dally and C. L. Seitz (1987): "Deadlock Free Routing in Multiprocessor Interconnection Networks," IEEE Trans. on Comp, C-36 (5). Google ScholarDigital Library
- [6] M. C. Herbordt, C. C. Weems, D. B. Shu (1990): "Routing on the CAAPP" Proc. International Conference on Pattern Recognition.Google Scholar
- [7] P. Kermani and L. Kleinrock (1979): "Virtual Cut-Through: A New Computer Communication Switching Technique," Computer Networks, 3.Google Scholar
- [8] M. Kunde (1988): "Parallel Routing and Sorting on Mesh-Connected Processor Arrays," VLSI Algorithms and Architectures: Proc. A WOC '88, Lecture Notes in Computer Science #319, Springer Verlag.Google Scholar
- [9] F. T. Leighton, F. Makedon, I. Tollis (1989): "A 2n - 2 Step Algorithm for Routing in an n × n Array With Constant Size Queues," Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures. Google ScholarDigital Library
- [10] H. Li and M. Maresca (1987): "Polymorphic-Torus Network," Proc. International Conference on Parallel Processing.Google Scholar
- [11] J. J. Little, G. E. Blelloch, T. A. Cass (1989): "Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine," IEEE Trans. on PAMI, 11 (3). Google ScholarDigital Library
- [12] R. Miller, V. K. Prasanna Kumar, D. Reisis, Q. F. Stout, (1988): "Meshes With Reconfigurable Buses," Proc. MIT conference on Advanced Research in VLSI. Google ScholarDigital Library
- [13] D. Nassimi and S. Sahni (1979): "Bitonic Sort on a Mesh-Connected Parallel Computer," IEEE Trsns. Comp., C-28.Google Scholar
- [14] D. Nassimi and S. Sahni (1980): "An Optimal Routing Algorithm for Mesh-Connected Parallel Computers," J. of the ACM, 27. Google ScholarDigital Library
- [15] S. E. Orcutt (1976): "Implementation of Permutation Functions in Illiac IV-Type Computers," IEEE Trans. on Computers, C-25 9.Google ScholarDigital Library
- [16] H. S. Stone (1971): "Parallel Processing with the Perfect Shuffle," IEEE Trans. on Computers, C- 20.Google ScholarDigital Library
- [17] C. D. Thompson and H. T. Kung (1977): "Sorting on a Mesh Connected Computer," Comm. of the ACM, 20 (4). Google ScholarDigital Library
- [18] L. G. Valiant and G. J. Brebner (1981): "Universal Schemes for Parallel Computation," Proc. 13th ACM Symposium on the Theory of Computing. Google ScholarDigital Library
- [19] C. C. Weems, S. P. Levitan, A. R. Hanson, E. M. Riseman, J. G. Nash, D. B. Shu (1989): "The Image Understanding Architecture," International Journal of Computer Vision, 2.Google ScholarCross Ref
- [20] C. C. Weems and J. R. Burrill (1990): "The Image Understanding Architecture and its Programming Environment," in Parallel Architectures and Algorithms for Image Understanding, V. K. Prasanna Kumar, ed. Academic Press, Orlando, Florida.Google Scholar
Index Terms
- Message-passing algorithms for a SIMD torus with coteries
Recommendations
A message passing strategy for array redistributions in a torus network
The array redistribution problem occurs in many important applications in parallel computing. In this paper, we consider this problem in a torus network. Tori are preferred to other multidimensional networks (like hypercubes) due to their better ...
Performance of hybrid message-passing and shared-memory parallelism for discrete element modeling
SC '00: Proceedings of the 2000 ACM/IEEE conference on SupercomputingThe current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP clusters. To address this we study an algorithm from Discrete Element Modeling, ...
Comments