CSCAPES members are planning to offer a tutorial titled "OpenAD/F: Advanced Derivative Computation" in conjuction with the SciDAC 2009 Conference on June 19, 2009 at the San Diego Supercomputer Center. For further information and registration, visit the website https://outreach.scidac.gov/scidac09/tutorials/
Michael Wolf defended his PhD Dissertation titled "Hypergraph-based combinatorial optimization of matrix-vector multiplication" at the Department of Computer Science of the University of Illinois at Urbana-Champaign on April 16, 2009. Wolf's thesis advisor is Michael Heath. As a PhD student, Wolf spent the summers of 2007 and 2008 at Sandia National Labs (SNL) and both visits were funded by CSCAPES. Erik Boman of SNL served on the thesis committee of Wolf. The CSCAPES team congratulates Michael on this occasion.
Three minisymposia are being organized by CSCAPES members at the upcoming SIAM Conference on Computational Science and Engineering, to be held March 2--6, 2009 in Miami, Florida.
CSCAPES member Mahantesh Halappanavar successfully defended his PhD Dissertation at the Department of Computer Science at Old Dominion University on January 23, 2009. Mahantesh's thesis work is on algorithms for vertex weighted matching, and his advisor is Alex Pothen (currently at Purdue). Bruce Hendrickson of Sandia National Labs was an external member of the thesis committee. The CSCAPES team congratulates Mahantesh on this occasion.
Doruk Bozdag, a CSCAPES member, defended his PhD Dissertation titled "Graph Coloring and Clustering Algorithms for Science and Engineering Applications" at the Department of Electrical and Computer Engineering of The Ohio State University on December 8, 2008. Doruk's thesis advisors are Umit Catalyurek and Fusun Ozguner. The CSCAPES team congratulates Doruk on the successful completion of his PhD work.
The first version of ColPack, our software package consisting of C++ implementations of serial algorithms for a variety of graph coloring and related problems in sparse derivative matrix computation, has been released in October 2008. Visit http://www.cscapes.org/coloringpage/ for more information.
Parallel implementations of some of the coloring algorithms in ColPack are made available in Zoltan 3.1.
Bruce Hendrickson was promoted to Senior Manager of the Computer Science and Mathematics Group (which consists of six research departments) at Sandia National Labs, starting September 26, 2008.
The Zoltan Team is pleased to announce the release of
Zoltan v3.1. Zoltan enables more efficient parallel computing
for dynamic, unstructured applications by providing tools such
as dynamic load balancing, partitioning, data migration,
graph coloring, distributed data directories, and unstructured
communication primitives, as well as interfaces to the popular
PT-Scotch, PaToH and ParMETIS libraries.
New Features in Zoltan v3.1 include:
Schloss Dagstuhl, where this seminar is hosted, is one of the primary international venues for informatics. The seminar is being organized by Uwe Naumann (RWTH Aachen, Germany), Olaf Schenk (Universitat Basel, Switzerland), Horst Simon (Lawrence Berkeley National Laboratory, USA), and Sivan Toledo (Tel Aviv University, Israel). Several CSCAPES members will be speaking at the seminar. Read more at the seminar website.
The organizing committee for this event consists of CSCAPES members Paul Hovland and Jean Utke, and Christian Bischhof, Martin Bucker, Oliver Fortmeier, and Uwe Naumann from RWTCH Aachen University. A total of six invited or contributed talks will be delivered by CSCAPES members at this conference. The proceedings of the conference, edited by memebrs of the organizing committee, will be published in a volume of the Springer series Lecture Notes in Computational Science and Engineering. Read more at the conference website.
Another CSCAPES member has been awarded an NSF CAREER grant. Dr. Michelle Strout, Assistant Professor in the Computer Science Department at Colorado State University, has won this prestigious award for her project "Parallelization using Inspector/Executor Strategies (PIES)."
Erik Boman and Karen Devine of the CSCAPES institute and Mike Heroux
(TOPS) are co-organizing a tutorial on "Scalable Tools for Scientific Simulation" on April 3, 2008, at the High Performance Computer Science Week in Denver, CO.
http://www.hpcsw.org/symposium_agenda.shtml
Organized by: Alex Pothen (Old Dominion University, USA)
Part 1
Part 2
SciDAC (Scientific Discovery through Advanced Computing) 2007 Conference , took place in Boston, MA from June 24th to June 28th, has brought together computational scientists from around the world to celebrate new advancements in different areas of computational science. In this conference, CSCAPES researchers has contributed 2 talks and a poster:
It contains several new features, including hypergraph repartitioning for dynamic load balancing.
See www.cs.sandia.gov/Zoltan for more information.
Click here for a tutorial (given at SciDAC 2007 conference).
As part of CSCAPES's commitment to training and outreach, Duc Nguyen, a Junior in the Computer Science Department at Old Dominion University will be spending this summer at Argonne National Lab working on a research project under the supervision of Dr. Paul Hovland of the Lab's Mathematics and Computer Science Division. Duc's summer visit is made possible thanks to Argonne's Student Research Participation Program. Duc will work on parts of SparsLinC, a library for computing linear combinations of sparse vectors, in the context of the OpenAD project for the development of automatic differentiation tools.
Their paper, "Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations," presents a novel algorithm for redistributing data in adaptive parallel simulations. As an adaptive simulation's computational requirements change, the algorithm rebalances processor workloads while keeping interprocessor communication costs and data redistribution costs low. The new method exploits the robust and accurate hypergraph partitioning model to reduce average total communication costs by roughly 20% compared to traditional graph repartitioning methods. The algorithm will be released this winter in the Zoltan Parallel Data Management Toolkit, open-source software available at http://www.cs.sandia.gov/Zoltan. Authors of the paper are Umit Catalyurek and Doruk Bozdag of the Ohio State University, and Erik Boman, Karen Devine, Robert Heaphy, and Lee Ann Fisk Riesen of Sandia National Laboratories.
IPDPS is a highly competitive international conference (sponsored by IEEE) covering all aspects of parallel computation, including algorithms, applications, architectures, and system software. Only 109 out of 419 total submissions were accepted and the award-winning paper was judged best of the submissions to the Algorithms track. The award will be presented March 28, 2007, in Long Beach, CA.
Dr. Umit Catalyurek, Assistant Professor in the Department of Biomedical Informatics at Ohio State University, has won this prestigious award for his project "Scalable Combinatorial Scientific Computing". Read more in OSU Resarch News