ACM Home Page
Please provide us with feedback. Feedback
Profile driven weighted decomposition
Full text PdfPdf (909 KB)
Source International Conference on Supercomputing archive
Proceedings of the 10th international conference on Supercomputing table of contents
Philadelphia, Pennsylvania, United States
Pages: 165 - 172  
Year of Publication: 1996
ISBN:0-89791-803-7
Authors
Karen A. Tomko  Department of Computer Science and Engineering, Wright State University, Dayton, OH
Edward S. Davidson  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

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

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
Dan Anderson, Alex Akkerman, and Dave Strenski. FCRASH, optimization of an explicit FEA based crash simulation code for the Cray C916/16-51. In Gray User Group Conference, Denver, CO., March, 1995.
 
2
Stephen Barnard and Horst Simon. A fast multilevel implementation of recursive spectral bisections for partitioning unstructured problems. Technical Report RNR-92-33, NASA Ames Research Center, NAS Systems Division, April 1993.
 
3
CONVEX Computer Corporation. CXpa Reference, second edition.
4
 
5
 
6
Charbel Farhat and Michel Lesoinne. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. International Journal for Numerical Methods in Engineering, 36:745- 764, 1993.
 
7
M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP~complete graph problems. Theoretical Computer Science, 1(3):237-267, 1976.
 
8
Bruce Hendrickson and Robert Leland. The Chaco user's guide: Version 2.0. Technical Report SAND94- 2692, Sandia National Laboratories, Albuquerque, NM, July 1995.
9
 
10
George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report TR 95-035, Dept. Computer Science, University of Minnesota, 1995.
 
11
Robert Leland and Bruce Hendrickson. An empirical study of static load balancing algorithms. In Proceedings of the Scalable High Performance Computing Conference (SHtPUC-gj), pages 682-685, 1994.
 
12
Bongki Moon and Joel Saltz. Adaptive runtime support for Direct Simulation Monte Carlo Methods on distributed memory architectures. In Proceedings of the Scalable High Performance Computing Conference (SI-IPCC-gd), pages 176-183, May 1994.
 
13
 
14
Horst Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2/3):135-148, 1991.
 
15
 
16
 
17
 
18
Waterloo Maple Software, Waterloo, Ontario, Canada. Maple V Language Reference Manual.

Collaborative Colleagues:
Karen A. Tomko: colleagues
Edward S. Davidson: colleagues

Peer to Peer - Readers of this Article have also read: