SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2002, Pages 460-468

A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745696728 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/IPDPS.2002.1015530 Document Type: Conference Paper

Times cited : (11)

References (11)

1
- 0034958341
- Blue Gene: A vision for protein science using a petaflop supercomputer
- F. Allen et al. Blue Gene: A vision for protein science using a petaflop supercomputer. IBM Systems J., 40:310-327, 2001.
- (2001) IBM Systems J. , vol.40 , pp. 310-327
- Allen, F.¹

2
- 0034825505
- Demonstrating the scalability of a molecular dynamics application on a petaflop computer
- G. S. Almasi, C. Caşcaval, J. G. Castaños, M. Denneau, W. Donath, M. Eleftheriou, M. Giampapa, H. Ho, D. Lieber, J. E. Moreira, D. Newns, M. Snir, and H. S. Warren Jr. Demonstrating the scalability of a molecular dynamics application on a petaflop computer. In Proc. 15th ACM Intl. Conf. on Supercomputing (ICS), 2001.
- (2001) Proc. 15th ACM Intl. Conf. on Supercomputing (ICS)
- Almasi, G.S.¹ Caşcaval, C.² Castaños, J.G.³ Denneau, M.⁴ Donath, W.⁵ Eleftheriou, M.⁶ Giampapa, M.⁷ Ho, H.⁸ Lieber, D.⁹ Moreira, J.E.¹⁰ Newns, D.¹¹ Snir, M.¹² Warren, H.S.¹³

3
- 0013188975
- A linear-time approximation algorithm for the weighted vertex cover problem
- R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms, 2:198-203, 1981.
- (1981) J. Algorithms , vol.2 , pp. 198-203
- Bar-Yehuda, R.¹ Even, S.²

4
- 0029345012
- Fault-tolerant wormhole routing algorithms for mesh networks
- R. V. Boppana and S. Chalasani. Fault-tolerant wormhole routing algorithms for mesh networks. IEEE Trans. on Computers, 44:848-864, 1995.
- (1995) IEEE Trans. on Computers , vol.44 , pp. 848-864
- Boppana, R.V.¹ Chalasani, S.²

5
- 0031365719
- Communication in multicomputers with nonconvex faults
- S. Chalasani and R. V. Boppana. Communication in multicomputers with nonconvex faults. IEEE Trans. on Computers, 46:616-622, 1997.
- (1997) IEEE Trans. on Computers , vol.46 , pp. 616-622
- Chalasani, S.¹ Boppana, R.V.²

6
- 0035334342
- A fault-tolerant routing scheme for meshes with nonconvex faults
- C.-L. Chen and G.-M. Chiu. A fault-tolerant routing scheme for meshes with nonconvex faults. IEEE Trans. on Parallel and Distributed Systems, 12:467-475, 2001.
- (2001) IEEE Trans. on Parallel and Distributed Systems , vol.12 , pp. 467-475
- Chen, C.-L.¹ Chiu, G.-M.²

7
- 0023346637
- Deadlock-free message routing in multiprocessor interconnection networks
- W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers, 36:547-553, 1987.
- (1987) IEEE Trans. on Computers , vol.36 , pp. 547-553
- Dally, W.J.¹ Seitz, C.L.²

8
- 0003603813
- W. H. Freeman, New York
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

10
- 84966534891
- C.-T. Ho and L. Stockmeyer. A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers. http://www.almaden.ibm.com/cs/people/stock/lamb.ps
- A New Approach to Fault-tolerant Wormhole Routing for Mesh-connected Parallel Computers
- Ho, C.-T.¹ Stockmeyer, L.²

11
- 0003777592
- PWS Publishing, Boston
- D. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, 1997.
- (1997) Approximation Algorithms for NP-Hard Problems
- Hochbaum, D.¹

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