Site Search
Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory
Jan 29, 2007 to Feb 2, 2007

Organizer(s)

Ifti Burhanuddin (USC, Computer Science), James Demmel (Berkeley, Math & CS), Edray Goins (Purdue, Math), Erich Kaltofen (North Carolina SU, Math), Fernando Perez (U Colorado, Applied Math), William Stein (Chair; Washington, Math), Helena Verrill (LSU, Math), Joe Weening (CCR, Research)
To apply for funding, you must register by Fri, Dec 01 2006.

Workshop page at the University of Washington





The goal of this workshop is to study and formulate practical parallel algorithms that support interactive mathematical research in algebra, geometry, and number theory, and to formulate strategies to encourage implementation and testing of these ideas.
For more information please go to: http://sage.math.washington.edu/msri07/



Computer manufacturers have begun delivering multiprocessor machines onto desktops; indeed, this seems to be the only means for continuing the pace of cpu power growth that we have become accustomed to. At the moment, general purpose mathematical software packages rarely exploit parallelism, and this is especially true in the areas of algebra, geometry, number theory, and combinatorics. Dramatic advances in performance will only be possible if parallelism can be harnessed in ways that are transparent to users.


We hope to bring together a diverse group of mathematics and computer science researchers and students to discuss algorithms, assess current prospects, and suggest ways to move forward. Talks and discussions will cover new algorithms that exploit parallelism, specific problems likely to benefit from dramatic speedups from parallelism, and strategies to encourage implementation of these ideas.

FORMAT: There will be at most 3 hour long lectures a day, and will be plenty of time for interaction between participants. In addition, we will have one or two panel discussions about the current state of the art, and strategies for implementing support for parallel computation. Before the workshop the organizers will create a preliminary strategic plan for parallel computation that will focus discussion during the workshop, and which will hopefully be significantly improved during the workshop.

The talks will focus on the following topics:
  1. Parallel multimodular and p-adic methods for dense, sparse and
    black box linear algebra over finite fields, the rational numbers and rational functions (e.g., linear system solutions, matrix multiplication, determinants and characteristic polynomials, kernels, etc.)
  2. Parallel Groebner basis techniques, parallel triangular set construction
  3. Distributed general purpose integer factorization algorithms
  4. Uni- and multivariate polynomial arithmetic on large polynomials (high degree, many terms) such as multiplication, GCD, factorization, both for exact and approximate coefficients
  5. Parallel methods for searching for rational points on curves
  6. Distributed computation of large tables (e.g., elliptic curves, modular forms, data about L-functions, number fields, etc.)
Applications of parallel computation to numerical problems, e.g., in differential equations, linear algebra, etc., tend to have been more fully developed than in algebraic areas, so we will invite experts in those areas in order to hear about techniques that have been successful at attacking those problems.

In sum, we aim at the following benefits for the mathematical community:
  (a) new techniques and algorithms to exploit parallelism,
  (b) exposure of areas and problems that may benefit from these ideas,
  (c) a strategic assessment of how best to move the state of the art forward, and
  (d) a significant improvement of freely available general purpose software for mathematical research.



A block of rooms has been reserved at the Hotel Durant. Please mention the workshop name and reference the following code when making reservations via phone, fax or e-mail: P50000. The cut-off date for reservations is January 5, 2006.

A block of rooms has been reserved at the Rose Garden Inn. Reservations may be made by calling 1-800-992-9005 OR directly on their website. Click on Corporate at the bottom of the screen and when prompted enter code MATH (this code is not case sensitive). By using this code a new calendar will appear and will show MSRI rate on all room types available. The following Group Code should be entered in the "Comment" field when booking through our Website. Group Code = CGMS36. Please note: The Original Queen room type does not have an in-room T1 connection, but we do have WIFI available in our main lobby area. The cut-off date for reservations is January 8, 2007.

Funding: The funding deadline has passed. Late funding requests will be considered only if additional funds become available.

Funding

To apply for funding, you must register by Fri, Dec 01 2006. Click to Register
Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are made typically 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.
Schedule
Monday, January 29, 2007
9:00AM - 10:00AM Clement Pernet Parallelism perspectives for the LinBox library [Video available]
10:30AM - 11:30AM Brian Granger Interactive Parallel Computing using Python and IPython [Video available]
11:30AM - 12:30PM Jean-Louis Roch Processor oblivious parallel algorithms with provable performances: applications [Video available]
1:30PM - 2:00PM Henry Cohn Parallel Computation Tools for Research: A Wishlist (part 0) [Video available]
Tuesday, January 30, 2007
9:00AM - 10:00AM Katherine Yelick Programming Models for Parallel Computing [Video available]
10:30AM - 11:30AM Yozo Hida Moving Lapack and ScaLapack to Higher Precision without Too Much Work [Video available]
11:30AM - 12:30PM Alfred Noel Structure and Representations of Real Reductive Lie Groups: A Computational Approach [Video available]
1:30PM - 2:00PM Anton Leykin Parallel computation of Grobner bases in the Weyl algebra [Video available]
Wednesday, January 31, 2007
9:00AM - 10:00AM Jason Martin MPMPLAPACK: The Massively Parallel Multi-Precision Linear Algebra Package [Video available]
10:30AM - 11:30AM William Hart Parallel Computation in Number Theory [Video available]
11:30AM - 12:30PM Yi Qiang Distributed Computing using SAGE [Video available]
1:30PM - 2:00PM Robert Bradshaw Loosely Dependent Parallel Processes [Video available]
2:00PM - 2:30PM Ilias Kotsireas Combinatorial Designs: constructions, algorithms and new results [Video available]
Thursday, February 01, 2007
9:00AM - 10:00AM Jan Verschelde Parallel Homotopy Algorithms to Solve Polynomial Systems [Video available]
10:30AM - 11:30AM Marc Moreno-Maza Component-level Parallelization of Triangular Decompositions [Video available]
11:30AM - 12:30PM David Bailey Experimental Mathematics and High-Performance Computing [Video available]
1:30PM - 2:00PM Thomas Wolf, Winfried Neun Parallel sparsening and simplification of systems of equations [Video available]
2:00PM - 2:30PM Thomas Wolf, Winfried Neun Parallel sparsening and simplification of systems of equations [Video available]
Friday, February 02, 2007
9:00AM - 10:00AM Alan Edelman Interactive Parallel Supercomputing: Today: MATLAB(r) and Python coming Cutting Edge: Symbolic Parallelism with Mathematica(r) and MAPLE(r) [Video available]
10:30AM - 11:30AM Gene Cooperman Disk-Based Parallel Computing: A New Paradigm [Video available]
11:30AM - 12:30PM Robert Harrison Science at the petascale: tools in the tool box [Video available]


Questions about this workshop should be sent either by email to
or by regular mail to:
Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory
Mathematical Sciences Research Institute
17 Gauss Way, Berkeley, CA
94720-5070.
USA

The Institute is committed to the principles of Equal Opportunity and Affirmative Action.



|