SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 2, 1996, Pages 196-201

Efficient parallel matrix inversion on interconnection networks 1

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030143879 PISSN: 07437315 EISSN: None Source Type: Journal
DOI: 10.1006/jpdc.1996.0055 Document Type: Article

Times cited : (8)

References (12)

1
- 0023432638
- Deterministic simulation of idealized parallel computers on more realistic ones
- 1. H. Alt, T. Hagerup, K. Mehlhorn, and F. Preparata, Deterministic Simulation of idealized parallel computers on more realistic ones. SIAM J. Comput. 16, 5 (1987), 808-835. Received April 1, 1993; accepted September 19, 1995
- (1987) SIAM J. Comput. , vol.16 , Issue.5 , pp. 808-835
- Alt, H.¹ Hagerup, T.² Mehlhorn, K.³ Preparata, F.⁴

2
- 0011668677
- Ph.D. dissertation, Computer Sci. Div., Univ. of Cal., Berkeley
- 2. L. Csanky, On the parallel complexity of some computational problems. Ph.D. dissertation, Computer Sci. Div., Univ. of Cal., Berkeley, 1974.
- (1974) On the Parallel Complexity of Some Computational Problems
- Csanky, L.¹

3
- 0000538288
- Fast parallel matrix inversion algorithms
- 3. L. Csanky, Fast parallel matrix inversion algorithms. SIAM J. Comput. 5, 4 (1976), 618-623.
- (1976) SIAM J. Comput. , vol.5 , Issue.4 , pp. 618-623
- Csanky, L.¹

4
- 0000456144
- Parallel matrix and graph algorithms
- 4. E. Dekel, D. Nassimi, and S. Sahni, Parallel matrix and graph algorithms. SIAM J. Comput. 10, 4 (1981), 657-675.
- (1981) SIAM J. Comput. , vol.10 , Issue.4 , pp. 657-675
- Dekel, E.¹ Nassimi, D.² Sahni, S.³

5
- 0024302065
- Parallel evaluation of the determinant and of the inverse of a matrix
- 5. Z. Galil and V. Pan, Parallel evaluation of the determinant and of the inverse of a matrix. Inform. Process. Lett. 30 (1989), pp. 41-45.
- (1989) Inform. Process. Lett. , vol.30 , pp. 41-45
- Galil, Z.¹ Pan, V.²

6
- 0011542073
- Parallel hashing - An efficient implementation of shared memory
- 6. A. Karlin and E. Upfal, Parallel hashing - An efficient implementation of shared memory. Proc. of the 18th Ann. Symp. on Theory on Computing, 1986, pp. 160-168.
- (1986) Proc. of the 18th Ann. Symp. on Theory on Computing , pp. 160-168
- Karlin, A.¹ Upfal, E.²

7
- 0003819663
- 7. F. Thomson Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo CA, 1992.
- (1992) Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo CA, 1992
- Thomson Leighton, F.¹

8
- 77953997012
- The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI
- 8. D. Pradham and M. Samatham, The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI. IEEE Trans. Comput. C-37, 4 (1989), 567-581.
- (1989) IEEE Trans. Comput. , vol.C37 , Issue.4 , pp. 567-581
- Pradham, D.¹ Samatham, M.²

9
- 0019563297
- The cube-connected cycles: A versatile network for parallel computation
- 9. F. Preparata and J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation. Comm. ACM 24, 5 (1981), 300-309.
- (1981) Comm. ACM , vol.24 , Issue.5 , pp. 300-309
- Preparata, F.¹ Vuillemin, J.²

10
- 0023594047
- How to emulate shared memory
- 10. A. G. Ranade, How to emulate shared memory. Proc. of 28th Ann. Symp. on Foundations of Computer Science, 1987, pp. 185-194.
- (1987) Proc. of 28th Ann. Symp. on Foundations of Computer Science , pp. 185-194
- Ranade, A.G.¹

11
- 0015017871
- Parallel processing with the perfect shuffle
- 11. H. Stone, Parallel processing with the perfect shuffle. IEEE Trans. on Comput. C-20, 2 (1972), pp. 153-163.
- (1972) IEEE Trans. on Comput. , vol.C-20 , Issue.2 , pp. 153-163
- Stone, H.¹

12
- 0023266822
- How to share memory in a distributed system
- 12. E. Upfal and A. Widgerson, How to share memory in a distributed system. J. Assoc. Comput. Mach. 34, 1 (1987), 185-194.
- (1987) J. Assoc. Comput. Mach. , vol.34 , Issue.1 , pp. 185-194
- Upfal, E.¹ Widgerson, A.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.