ACM Home Page
Please provide us with feedback. Feedback
Parallel algorithms for the orthogonal multiprocessor
Full text PdfPdf (445 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 30th annual Southeast regional conference table of contents
Raleigh, North Carolina
SESSION: Session 3C: Algorithms for parallel machines table of contents
Pages: 292 - 299  
Year of Publication: 1992
ISBN:0-89791-506-2
Author
Khaled M. F. Elsayed  North Carolina State University, Raleigh, NC
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/503720.503752
What is a DOI?

ABSTRACT

The orthogonal multiprocessor is a partially shared memory architecture. The architecture exhibits attractive characteristics specially with regards to the simplicity of the interconnection network. This architecture proves to be a powerful platform for a large class of scientific problems. A large set of algorithms have been mapped into this architecture including matrix multiplication, fast Fourier transform, sorting, and partial differential equations.The major contribution of this paper is the mapping of two popular algorithms into the orthogonal multiprocessor architecture. The first algorithm is the Jacobi method for evaluating eigenvalues of a symmetric matrix. The second algorithm is image component labeling based on image shrinking operation. Also a discussion of areas of further study for the orthogonal multiprocessor is included.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Buehrer, R., Brudiers, H. J., Bens, H., Bron, B., Priess, H., Hale8, W., Halin, H. J., Isacon, A., Tadian, M., The ETH-Multiprocessor EM- PRESS: A Dynamically Configurable MIMD System. IEEE Trans. Comput., vol. 31, pp. 1035- 1044, 1982.
 
2
Cypher, R. E., Sans, J. L. C. and Snyder, L., Practicul Algorithms for Image Component Lsbeling sad SIMD Mesh Connected Computers, in Pvoc, Int. Conf. Parallel Processing 1987, pp. 772-779, 1987.
 
3
Gloub, G., and Van Loan, C., Matrix Computation, North Ozford, Academic Pveu, Offiford, 1983.
 
4
Hwang, K., and Kim, D., Parallel Pattern Clustering on a Multiproeessor with Orthogonally Shared Memory, in Proc. Int. Conf. Parallel Processing 1987, pp. 172-176, 1987.
 
5
Hwang, K., and Kim, D., Generalization of Or- Computation, in Proc. Frontiers Massively Parallel Comput. 88, Fs}rfax, VA, Oct. 11-13, pp. 391-398, 1988.
 
6
7
 
8
 
9
 
10
 
11
Tseng, P. S., Hwang, K., and Kumar, V. K. P., A VLSLBased Multiprocessor Architecture for Implementing Parallel Algorithms, in Proc. 13th International Conlerence on Parallel Proceaaing. Aug. 1985., pp. 657-664, 1985.