ACM Home Page
Please provide us with feedback. Feedback
PMRSB: parallel multilevel recursive spectral bisection
Full text HtmlHtml (2 KB),  PdfPdf (144 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) table of contents
San Diego, California, United States
Article No. 27  
Year of Publication: 1995
ISBN:0-89791-816-9
Author
Stephen T. Barnard  Cray Research, Inc., 894 Ross Drive, Suite 203, Sunnyvale, CA
Sponsors
IEEE-CS : Computer Society
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

The design of a parallel implementation of multilevel recursive spectral bisection on the Cray T3D is described. The code is intended to be fast enough to enable dynamic repartitioning of adaptive meshes and to partition meshes that are too large for workstations. Two innovations in the implementation are recursive asynchronous task teams and a parallel version of the multilevel accelerator. A performance improvement of a factor of 140 over the best available serial implementation is demonstrated.


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
S. T. Barnard and H. D. Simon, 'Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems', Concurrency: Practice and Experience, Vol. 6, No. 2, 101-117 (1994).
2
 
3
E. D. Brooks III, B. C. Gorda, and Karen H. Warren, 'The Parallel C Preprocessor', Scientific Programming, Vol. 1, No. 1, 79-89 (1992).
 
4
CMSSL For CM Fortran, Vol. II, version 3.2, Thinking Machines Corp., (1994).
 
5
P. Diniz, S. Plimpton, B. Hendrickson, and R. Leland, 'Parallel algorithms for dynamically partitioning unstructured grids', Proceeding of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 615-620 (1995).
 
6
M. Garey, D. Johnson, and L. Stockmeyer, 'Some simplified NP- complete graph problems', Theoretical Computer Science,1, 237-267 (1976).
 
7
C. Lanczos, 'An iteration method for the solution of the eigenvalue problem of linear differential and integral operators', J. Res. Nat. Bur. Stand., 45, 255-282 (1950).
 
8
 
9
C. C. Paige and M. A. Saunders, 'Solution of sparse indefinite systems of linear equations', SIAM J. Numer. Anal., Vol. 12, 617-629 (1974).
 
10
B. N. Parlett, 'The Rayleigh quotient iteration and some generalizations for nonnormal matrices', Math Comp., 28(127), 679- 693 (1974).
 
11
 
12
H. Gazit, 'Randomized parallel connectivity', in Synthesis of Parallel Applications, ed. by J. H. Reif, 197-214, Morgan Kaufmann Publishers, Inc., 1993.
 
13
H. Simon, 'Partitioning unstructured problems for parallel processing', Comput. Syst. Eng., 2(2/3), 135-148 (1991).
 
14
Numerical Recipes in C, Second Edition, W. H. Press, S. A. Teukolosky, W. T. Vetterling, and B. P. Flannery, Cambridge University Press, 1994.