An evaluation of partitioners for parallel SAMR applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2150, Issue , 2001, Pages 171-174

  Chandra, Sumir ^a   Parashar, Manish ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ADAPTIVE GRIDS; APPLICATION-CENTRIC; DYNAMIC PARTITIONING; EXPERIMENTAL EVALUATION; PROBLEM SIZE; SOFTWARE LIBRARIES; STRUCTURED ADAPTIVE MESH REFINEMENT;

ARTIFICIAL INTELLIGENCE;

EID: 84937419200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_26     Document Type: Conference Paper

References (4)

1. Karypis, G., Schloegel, K., Kumar, V.: ParMetis-Parallel Graph Partitioning and Sparse Matrix Ordering Library, ver. 2. 0. University of Minnesota, 1998.
2. Parashar, M., et al: A Common Data Management Infrastructure for Adaptive Algorithms for PDE Solutions. Technical Paper at Supercomputing, 1997.
3. Steensland, J.: http://www.caip. rutgers. edu/˜johans/vampire. Vampire, 2000.
4. Steensland, J., Chandra, S., Thuné, M., Parashar, M.: Characterization of Domain-Based Partitioners for Parallel SAMR Applications. IASTED International Conference on Parallel and Distributed Computing and Systems, 2000.