The Programming Contest will occur on Thursday, in parallel with the conference. Teams have to register at the registration desk.
08:00 | Registration |
08:30 |
Tutorial:
Automatic Performance Tuning Jeremy Johnson, Drexel University, Philadelphia, USA. |
10:30 | Coffee-Break |
10:50 |
Tutorial: Roomy: A System for Space Limited Computations Daniel Kunkle, Northeastern University, Boston, USA. |
13:00 | Lunch |
14:15 |
Conference opening Brigitte Plateau |
14:20 |
Invited talk: Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors Christian Bertin (STMicroelectronics) & Claude-Pierre Jeannerod (INRIA) & Christophe Monat (STMicroelectronics), Grenoble and Lyon, France. |
15:20 | Presentation and start of the Programming Contest |
15:30 | Coffee-Break |
15:50 |
Parallel operations of sparse polynomials on multicores - I. Multiplication and Poisson bracket Mickaël Gastineau |
16:15 |
Parallel Sparse Polynomial Division Using Heaps Roman Pearce and Michael Monagan |
16:40 |
Polynomial Homotopies on Multicore Workstations Jan Verschelde and Genady Yoffe |
17:05 | 10' pause |
17:15 |
Programming Contest: presentation of the implementations and status update NB Room is closed at 18:00. Teams can tune their soft during the night on the machines. The programming contest will be performed on Thursday afternoon from 13:30. |
09:00 |
Invited talk: Fifteen years after DSC and WLSS2: what parallel computations I do today Erich L. Kaltofen, North Carolina State University, USA. |
10:00 | Coffee-Break and Start of the Programming Contest |
10:30 |
Parallel Gaussian Elimination for Gröbner bases computations in finite fields Jean-Charles Faugere and Sylvain Lachartre |
10:55 |
A Quantitative Study of Reductions in Algebraic Libraries Yue Li and Gabriel Dos Reis |
11:20 |
Parallel computations in modular group algebras Alexander Konovalov and Steve Linton |
11:45 | Lunch / PASCO Program Commitee meeting |
13:30 |
Parallel Computation of the Minimal Elements of a Poset Charles E. Leiserson, Liyun Li, Marc Moreno Maza and Yuzhen Xie |
13:55 |
Cache-Oblivious Polygon Indecomposability Testing Fatima K. Abu Salem |
14:20 | 10' pause |
14:30 |
Generic design of Chinese remaindering schemes Jean-Guillaume Dumas, Thierry Gautier and Jean-Louis Roch |
14:55 |
Parallel Sparse Polynomial Interpolation over Finite Fields Mahdi Javadi and Michael Monagan |
15:20 | Coffee-Break and Programming Contest |
15:40 |
High performance linear algebra using interval arithmetic Hong Diep Nguyen and Nathalie Revol |
16:00 |
Parallel Computation of Determinants of Matrices with Polynomial Entries for robust control design Kinji Kumura and Hirokazu Anai |
16:20 |
Cache Friendly Sparse Matrix-vector Multiplication Sardar Anisul Haque, Shahadat Hossain and Marc Moreno Maza |
16:40 | 10' pause |
16:50 |
SPIRAL-Generated Modular FFTs Lingchuan Meng, Jeremy Johnson, Franz Franchetti, Yevgen Voronenko, Marc Moreno Maza and Yuzhen Xie |
17:10 |
Parallelising the computational algebra system GAP Reimer Behrends, Alexander Konovalov, Steve Linton, Frank Lübeck and Max Neunhöffer |
17:30 | 10' pause |
17:40 | End of the Programming Contest and Status report |
19:45 |
La Bastille - Grenoble's fortress and cablecar
|
09:00 |
Invited talk: Exploiting Multicore Systems with Cilk Stephen T. Lewin-Berlin, Intel and Quanta Research Cambridge, Inc, Cambridge, USA. |
10:00 | Coffee-Break |
10:30 |
Parallel arithmetic encryption for high-bandwitdh communications on multicore/GPGPU platforms Ludovic Jacquin, Vincent Roca, Jean-Louis Roch and Mohamed Al Ali |
10:55 |
A complete modular resultant algorithm targeted for realization on graphics hardware Pavel Emeliyanenko |
11:20 |
Exact Sparse Matrix-Vector Multiplication on GPUs and Multicore Architectures Brice Boyer, Jean-Guillaume Dumas and Pascal Giorgi |
11:45 | Lunch |
13:30 |
Parallel Disk-Based Computation for Large, Monolithic Binary Decision Diagrams Daniel Kunkle, Vlad Slavici and Gene Cooperman |
13:55 |
Accuracy Versus Time: A Case Study with Summation Algorithms Philippe Langlois, Matthieu Martel and Laurent Thévenoux |
14:20 |
A high-performance algorithm for calculating cyclotomic polynomials Andrew Arnold and Michael Monagan |
14:45 | Coffee-Break |
15:00 |
Tutorial: Combinatorial Scientific Computing Sivan Toledo |
16:00 | Conclusion meeting |
16:30 | End of PASCO'2010 |