다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Parallel computing, v.19 no.7, 1993년, pp.777 - 788
Nelson, P.A. (Computer Science Department 9062, Western Washington University, 98225-9062,, Bellingham, WA, USA)
AI-Helper
We present a parallel divide-and-conquer matrix multiplication algorithm whose natural communication structures is the hypercube. The complexity of the algorithm is O(log n) using n3/2 processors and O(n) using O(n2) processors. We show how to use the algorithm for practical computing giving a time ...
Berman 307 1984 Proc. 1984 Internat. Conf. on Parallel Processing On mapping parallel algorithms into parallel architectures
Parallel Comput. Berntsen 12 3 335 1989 10.1016/0167-8191(89)90091-4 Communication efficient matrix multiplication on hypercubes
Electron. Letters Chang 27 25 2398 1991 10.1049/el:19911483 o(n) matrix multiplication algorithm for hypercube machines
Chern 90 1983 Proc. 1983 Internat. Conf. on Parallel Processing Efficient matrix multiplications on a concurrent data-loading array processor
Intel Corporation 1986
SIAM J. Comput. Dekel 10 4 657 1981 10.1137/0210049 Parallel matrix and graph algorithms
Parallel Comput. Fox 4 1 17 1987 10.1016/0167-8191(87)90060-3 Matrix algorithms on a hypercube I: Matrix multiplication
Ho 108 1989 Parallel Processing and Medium Scale Multiprocessors Matrix multiplication on boolean cubes using generic communication primitives
IEEE Trans. Comput. Horowitz C-32 6 582 1983 10.1109/TC.1983.1676280 Divide-and-conquer for parallel processing
Kung 256 1979 Sparse Matrix Proceedings 1978 Systolic arrays (for vlsi)
IEEE Trans. Comput. Kung C-31 11 1054 1982 10.1109/TC.1982.1675922 Wavefront array processor: Language, architecture, and applications
ACM Trans. Math. Software Lawson 5 3 308 1979 10.1145/355841.355847 Basic linear algebra subprograms for fortran usage
Mathur 1991 Multiplication of matrices of arbitrary shape on a data parallel computer
Nelson 1985 10.21236/ADA196418 A non-systolic matrix product algorithm
Nelson 1987 Parallel programming paradigms
Nelson 258 1986 Proc. 1986 Internat. Conf. on Parallel Processing Programming solutions to the algorithm contraction problem
Nelson 3 1987 The Characteristics of Parallel Algorithms Programming paradigms for nonshared memory parallel computers
Internat. J. Parallel Programming Ni 17 6 475 1988 10.1007/BF01407815 On partitioning and mapping for hypercube computing
Commun. ACM Seitz 28 1 22 1985 10.1145/2465.2467 The cosmic cube
Numer. Math. Strassen 13 354 1969 10.1007/BF02165411 Gaussian elimination is not optimal
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.