Dagstuhl Seminar on Combinatorial Scientific Computing

... Feb 1 - Feb 6, 2009, Schloss Dagstuhl.

GOTO: Abstract - Program

Upcoming Dagstuhl Seminar Proceedings

A Dagstuhl seminar proceedings volume containing

executive summary by the organizers
abstracts for each presentation / poster
survey articles by the plenary speakers
"Getting Started" articles for each of the tutorials

will be published after the seminar. Copyright stays with the individual authors. A post-conference special collection is in the planning.

Abstract

With the continuing advances in high-performance computing (HPC) the role of computational science and engineering has gained significant importance over the last decades. At the same time scientific simulation faces a number of challenges. Many of those are combinatorial in nature and unified by a common set of abstractions, data structures, and algorithms based on combinatorics, graphs, and hypergraphs.

The focus of the upcoming Dagstuhl seminar on Combinatorial Scientific Computing will be on load balancing on parallel architectures, automatic generation of efficient tangent-linear and adjoint codes for use in large-scale (PDE-constrained) nonlinear optimization, sparse numerical linear algebra, and optimizing compilers for modern HPC architectures. The five days will be filled with tutorials and introductory talks, presentations of new results, and (panel / round table) discussions on combinatorial scientific and high-performance computing and their links with applications (e.g. modeling of large (electric power) networks) and algorithm and software tool development (e.g. compilers).

The purpose of the seminar is to bring together a diverse community of researcher working in different aspects in this exiting field. We will gather graduate students, young researcher, scientists in mid-career, and senior investigators from both academia and industry. Some are experts on graph combinatorial aspects, some are focusing on theoretical analysis, and some are more directed towards software / compiler development and concrete applications.

Refer also to the official announcement of the seminar at Dagstuhl's website.

A list of particpants together with abstracts of their presentations can be found at Dagstuhl's website.

[goto top]

Program

Sunday, Feb 1, 2009

Arrival at Schloss Dagstuhl after 3pm.

Monday, Feb 2, 2009

Morning (Chair: U. Naumann)
- 9am-9.15am: Opening (organizers)
- 9.15am - 10.15am: Plenary Talk: Combinatorial Scientific Computing: A View to the Future (B. Hendrikson, Sandia National Laboratory, short bio) abstract
- 11am-noon: Plenary Talk: Graph Matchings in CSC (A. Pothen, Purdue University, short bio) abstract
Afternoon (Chair: O. Schenk)
- 2pm-3pm: Plenary Talk: Combinatorial Problems in HPC (R. Bisseling, Utrecht University, short bio abstract
- 3.30pm-4.30pm: Contributed Talks
  - Y. Hu: Node and Edge Label Overlap Removal in Visualizing Large Networks
  - P. Arbenz: Micro-Finite Element Analysis of Human Bone Structures
  - U. Rüde: PDEs with a trillion elements / When theory fails to predict performance
- 4.30pm-6.30pm: Tutorial: E. Boman, Sandia National Laboratory: Zoltan [abstract] [homepage]

Tuesday, Feb 3, 2009

Morning (Chair: A. Walther)
- 9am-10am: Plenary Talk: Combinatorial Problems in Automatic Differentiation (P. Hovland, Argonne National Laboratory, short bio) abstract
- 11am-noon: Contributed Talks
  - T. Steihaug: The CPR Method and Beyond
  - A. Gebremedhin: The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing
  - A. Lyons and I. Safro: Randomized Heuristics for Exploiting Jacobian Scarcity
Afternoon (Chair: S. Toledo)
- 2pm-3pm: Plenary Talk: Combinatorial Problems in Numerical Linear Algebra (I. Duff, RAL, short bio): abstract
- 3.30pm-4.30pm: Contributed Talks
  - J. Reid and J. Scott: Reducing the total bandwidth of a sparse unsymmetric matrix
  - T. Davis: Multifrontal multithreaded rank-revealing sparse QR factorization
  - X. Li: Evaluation of Sparse LU Factorization and Triangular Solution on Multicore Platforms
- 4.30pm-6.30pm: Tutorial: F. Pellegrini, LABRI: Scotch and PT-Scotch [abstract] [homepage]
- 7.30pm-9.30pm: Tutorial: J. Utke, Argonne National Laboratory: OpenAD [abstract] [homepage]

Wednesday, Feb 4, 2009

Morning (Chair: U. Rüde)
- 9am-10am: Plenary Talk: Present and Future of High-Performance Scientfific Computing (R. van der Pas, SUN Microsystems, short bio): abstract
- 11am-noon: Contributed Talks
  - L. Grigori, E. Boman, S. Donfack, and T. Davis: Hypergraphbased Unsymmetric Nested Dissection Ordering for Sparse LU
  - J. Langguth: Heuristic initialization of bipartite matching algorithms
  - Cancelled: C. Bekas: Massive Scale-out of Parallel Graph Partitioning: A Case in Human Bone Simulations
Afternoon:
- Hiking tour
- Guided tour Trier + wine tasting

Thursday, Feb 5, 2009

Morning (Chair: A. Pothen)
- 9am-10am: Plenary Talk: Emerging Applications in Combinatorial Scientific Computing (D. A. Bader, Georgia Institute of Technology short bio): abstract
- 11am-noon: Contributed Talks
  - D. Bozdag and U. Catalyurek: Parallel Short Sequence Mapping for HighThroughput Genome Sequencing
  - H. Dollar and J. Scott: Fast AMD orderings for matrices with some dense rows
  - S. Daitch: A Nearly-Linear Time Algorithm for Solving Linear Systems in a Symmetric M-Matrix
Afternoon
- 2pm-4pm: Tutorial: A. Wächter, IBM: Ipopt [abstract] [homepage]
- 4pm-6pm: Tutorial: A. Walther, TU Dresden: ADOL-C [abstract] [homepage]
- Round Tables
  - 1.30pm-2pm: Graph coloring for parallel computation (Contact: A. Gebremedhin)
  - 2pm-3pm: Multilevel algorithms for discrete problems (Contact: E. Boman)
Evening (Chair: J. Gilbert)
- 7.30pm-8.30pm: Plenary Talk: Combinatorial and scientific computing approaches to modern large-scale data analysis (M. Mahoney, Standford University, short bio) abstract
- 8.30pm-9.30pm: Round Table: Data-Flow Reversal in Adjoint Codes (Contact: U. Naumann)

Friday, Feb 6, 2009

Morning
- 9am-11am: Tutorial: J. Gilbert, UCSB: Star-P: A tool for interactive numerical and combinatorial computing [abstract] [homepage];
- 11am: Closing (organizers)
Afternoon
- Departure from Schloss Dagstuhl by Saturday morning

[goto top]