Logo

Mathematical Sciences Research Institute

Home » Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory

Workshop

Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory January 29, 2007 - February 02, 2007
Registration Deadline: January 22, 2007 almost 8 years ago
To apply for Funding you must register by: October 29, 2006 about 8 years ago
Organizers 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)
Speaker(s)

Show List of Speakers

Description

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 & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

MSRI has preferred rates at the Rose Garden Inn, depending on room availability. 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 the MSRI rate on all room types available.

MSRI has preferred rates at the Hotel Durant. Reservations may be made by calling 1-800-238-7268. When making reservations, guests must request the MSRI preferred rate. If you are making your reservations on line, please go to this link and enter the promo/corporate code 123MSRI. Our preferred rate is $139 per night for a Deluxe Queen/King, based on availability.

MSRI has preferred rates of $149 - $189 plus tax at the Hotel Shattuck Plaza, depending on room availability. Guests can either call the hotel's main line at 510-845-7300 and ask for the MSRI- Mathematical Science Research Inst. discount; or go to www.hotelshattuckplaza.com and click Book Now. Once on the reservation page, click “Promo/Corporate Code“ and input the code: msri.

MSRI has preferred rates of $110 - $140 at the Berkeley Lab Guest House, depending on room availability. Reservations may be made by calling 510-495-8000 or directly on their website. Select “I am an individual traveler affiliated with MSRI”.

Additional lodging options may be found on our short term housing page.

Show Directions to Venue

Show Visa/Immigration

Schedule
Show All Collapse
Jan 29, 2007
Monday
09:00 AM - 10:00 AM
  Parallelism perspectives for the LinBox library
Clement Pernet
10:30 AM - 11:30 AM
  Interactive Parallel Computing using Python and IPython
Brian Granger
11:30 AM - 12:30 PM
  Processor oblivious parallel algorithms with provable performances: applications
Jean-Louis Roch
01:30 PM - 02:00 PM
  Parallel Computation Tools for Research: A Wishlist (part 0)
Henry Cohn (Microsoft Research New England)
Jan 30, 2007
Tuesday
09:00 AM - 10:00 AM
  Programming Models for Parallel Computing
Katherine Yelick
10:30 AM - 11:30 AM
  Moving Lapack and ScaLapack to Higher Precision without Too Much Work
Yozo Hida
11:30 AM - 12:30 PM
  Structure and Representations of Real Reductive Lie Groups: A Computational Approach
Alfred Noel
01:30 PM - 02:00 PM
  Parallel computation of Grobner bases in the Weyl algebra
Anton Leykin
Jan 31, 2007
Wednesday
09:00 AM - 10:00 AM
  MPMPLAPACK: The Massively Parallel Multi-Precision Linear Algebra Package
Jason Martin
10:30 AM - 11:30 AM
  Parallel Computation in Number Theory
William Hart
11:30 AM - 12:30 PM
  Distributed Computing using SAGE
Yi Qiang
01:30 PM - 02:00 PM
  Loosely Dependent Parallel Processes
Robert Bradshaw
02:00 PM - 02:30 PM
  Combinatorial Designs: constructions, algorithms and new results
Ilias Kotsireas
Feb 01, 2007
Thursday
09:00 AM - 10:00 AM
  Parallel Homotopy Algorithms to Solve Polynomial Systems
Jan Verschelde
10:30 AM - 11:30 AM
  Component-level Parallelization of Triangular Decompositions
Marc Moreno-Maza
11:30 AM - 12:30 PM
  Experimental Mathematics and High-Performance Computing
David Bailey
01:30 PM - 02:00 PM
  Parallel sparsening and simplification of systems of equations
Winfried Neun, Thomas Wolf
02:00 PM - 02:30 PM
  Parallel sparsening and simplification of systems of equations
Winfried Neun, Thomas Wolf
Feb 02, 2007
Friday
09:00 AM - 10:00 AM
  Interactive Parallel Supercomputing: Today: MATLAB(r) and Python coming Cutting Edge: Symbolic Parallelism with Mathematica(r) and MAPLE(r)
Alan Edelman (Massachusetts Institute of Technology)
10:30 AM - 11:30 AM
  Disk-Based Parallel Computing: A New Paradigm
Gene Cooperman
11:30 AM - 12:30 PM
  Science at the petascale: tools in the tool box
Robert Harrison