<F3.746e+05> S.<F3.819e+05> Hammond,<F3.543e+05> Mapping Unstructured Grid Problems to Massively Parallel<F3.819e+05> Computers, Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fast And High Quality Multilevel Scheme For Partitioning.. - Karypis, Kumar (1998) (275 citations) (Correct)
....to intelligently enforce the balanced partition and the small edge cut requirements. A partition of Gm can be obtained using various algorithms such as (a) spectral bisection [45, 47, 2, 24] b) geometric bisection [37, 36] if coordinates are available) 2 and (c) combinatorial methods [31, 3, 11, 12, 17, 5, 33, 21]. Since the size of the coarser graph Gm is small (i.e. V m 100) this step takes a small amount of time. We implemented four di#erent algorithms for partitioning the coarse graph. The first algorithm uses the spectral bisection. The other three algorithms are combinatorial in nature and ....
<F3.746e+05> S.<F3.819e+05> Hammond,<F3.543e+05> Mapping Unstructured Grid Problems to Massively Parallel<F3.819e+05> Computers, Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY, 1992.
Large Numerical Linear Algebra in 1994: The Continuing Influence.. - Edelman (1994) (1 citation) (Correct)
.... 7 4 7 5 7 6 7 7 7 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 3 1 3 2 3 3 3 4 3 5 3 6 3 7 3 Step 4 The second approach, automatic scheduling by a compiler, was taken by Denny Dahl of Thinking Machines Corporation [2] Steve Hammond of NCAR [7, 8], and Shukla and Agrawal [11] There is an important distinction that should be emphasized. The first approach described above, i.e. user orchestrated patterns, is appropriate for very regular communication patterns. Such patterns arise in dense linear algebra problems. By contrast, automatic ....
S.W.Hammond, Mapping Unstructured Grid Problems to Massively Parallel Computers, PhD dissertation, Rensselaer Polytechnic Institute, May, 1992. Also available as RIACS technical report TR92.14.
A Fast and High Quality Multilevel Scheme for. . . - Karypis, Kumar (1998) (Correct)
....to intelligently enforce the balanced partition and the small edge cut requirements. A partition of Gm can be obtained using various algorithms such as (a) spectral bisection [47, 46, 2, 24] b) geometric bisection [37, 36] if coordinates are available 2 ) and (c) combinatorial methods [31, 3, 11, 12, 17, 5, 33, 21]. Since the size of the coarser graph Gm is small (i.e. V m 100) this step takes a small amount of time. We implemented four different algorithms for partitioning the coarse graph. The first algorithm uses the spectral bisection. The other three algorithms are combinatorial in nature, ....
S.W. Hammond. Mapping Unstructured Grid Problems to Massively Parallel Computers. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC