|
|
|
| Graph Partitioning and Applications: Current and Future Directions Workshop | |
N. Radhakrishnan (left) of the Army Research Laboratory and Padma Raghavan (right) of the University of Tennessee review material from the conference. |
Graph partitioning is an important problem with extensive applications in many different areas
including scientific computing, parallel processing, VLSI design, data-mining, and efficient storage
of large databases. The ability to find good partitionings of large, irregular dynamic and adaptive
meshes is critical for efficient execution of many computational simulations on high performance
computers.
A two day workshop on Graph Partitioning Applications was held at the Army High Performance Computing Research Center (AHPCRC) at the University of Minnesota. This workshop was sponsored by the AHPCRC and the Supercomputing Institute and was organized by Rupak Biswas, NASA Ames Research Center, Bruce Hendrickson, Sandia National Laboratories, George Karypis, University of Minnesota, and Vipin Kumar, University of Minnesota. The workshop started with a keynote speech from Dr. Andy Mark of the Army Research Laboratory. Dr. Mark gave an overview of the partitioning requirements at the various Army research laboratories. This was followed by talks that ranged from graph partitioning requirements to new applications of graph partitioning algorithms to new algorithms and models for serial, parallel, and adaptive graph partitioning. |
This information is available in alternative formats upon request by
individuals with disabilities. Please send email to
alt-format@msi.umn.edu
or call 612-624-0528.
HOME
|
QUESTIONS |
FEEDBACK
Events |
Links |
People |
Programs |
Publications |
Support |
Welcome
|
|
URL: http:// |
|
| This page last modified on | ||
| Please direct questions or problems to help@msi.umn.edu | ||
|
Website related questions or problems should be directed to
webmaster@msi.umn.edu
The University of Minnesota Supercomputing Institute does not collect personal information on visitors to our website. For the University of Minnesota policy, see www.privacy.umn.edu. © 2002 by the Regents of the University of Minnesota |
||