UNDER construction: The agenda below is not the final one
This event is supported by INRIA, UIUC, NCSA, ANL and French Ministry of Foreign Affairs
Main Topics | Schedule | Speaker | Affiliation | Type of presentation | Title (tentative) | Download |
|
|
|
|
|
|
|
Dinner Before the Workshop | 7:00 PM | Only people registered for the dinner |
|
|
| |
|
|
|
|
|
|
|
Workshop Day 1 | Monday Nov. 25th |
|
|
|
|
|
|
|
|
|
| TITLES ARE TEMPORARY (except if in bold font) |
|
Registration | 08:00 |
|
|
|
|
|
Welcome and Introduction Amphitheatre Chair: Franck | 08:30 | Marc Snir + Franck Cappello | INRIA&UIUC&ANL | Background | Welcome, Workshop objectives and organization | |
| 08:45 | Peter Schiffer | UIUC | Background | Welcome from UIUC Vice Chancellor for Research | |
| 09:00 | Ed. Siedel | UIUC | Background | NCSA update and vision of the collaboration | |
| 09:15 | Michel Cosnard | Inria | Background | INRIA updates and vision of the collaboration | |
9:30 | Marc Snir | ANL | Background | Argonne updates and vision of the collaboration | ||
| 9h45 | Franck Cappello | ANL | Background | Joint-Lab, New Joint-Lab, PUF articulation |
|
| 10:15 | Break |
|
|
| |
Extreme Scale Systems and infrastructures Amphitheatre Chair: Marc Snir | 10:45 | Pete Beckman | ANL |
| Extreme Scale Computing & Co-design Challenges |
|
| 11:15 | John Towns | UIUC |
| Plenary talk | |
11:45 | Gabriel Antoniu | INRIA | Plenary talk | |||
| 12:15 | Lunch |
|
| Plenary talk |
|
13:45 | Bill Kramer | UIUC | Blue Waters | BW Observations and new challenges | ||
14:15 | Marc Snir | UIUC |
| G8 ECS and international collaboration toward extreme scale |
| |
| 14:45 | Rob Ross | ANL |
| Plenary talk | |
15:15 | François Pellegrini | INRIA | Plenary talk | |||
15:45 | Break | |||||
| 16:15 | Yves Robert | INRIA |
| Plenary talk | |
16:45 | Wen Mei Hwu | UIUC | Plenary talk | |||
17:15 | Adjourn | |||||
| 18:45 | Bus for Diner |
|
|
|
|
|
|
|
|
|
|
|
Workshop Day 2 | Tuesday Nov. 26 |
|
|
|
|
|
Applications, I/O, Visualization, Big data Amphitheatre Chair: Rob Ross | 08:30 | Greg Bauer | UIUC | Plenary talk |
| |
| 09:00 | Matthieu Dorier | INRIA | joint-result, submitted | Plenary talk | |
09:30 | Dries Kempe | ANL |
| Plenary talk | ||
| 10:00 | Venkat Vishwanath | ANL |
| Plenary talk | |
| 10:30 | Break |
|
|
|
|
| 11:00 | Babak Behzad | UIUC |
| Plenary talk |
|
| 11:30 | McHenry, Kenton Guadron | UIUC |
| Plenary talk | |
| 12:00 | Lunch |
|
|
| |
|
|
|
|
|
|
|
Mini Workshop1 Resilience Room 1030 Chair: Yves Robert |
|
|
|
|
|
|
| 13:30 | Leonardo | ANL | Joint-result | ||
| 14:00 | Tatiana | INRIA | Joint-result | ||
| 14:30 | Mohamed Slim Bouguera | INRIA | Joint-result, submitted | ||
| 15:00 | Ana Gainaru | UIUC | Joint-result, submitted | ||
| 15:30 | Break |
|
|
|
|
| 16:00 | Sheng Di | INRIA | Joint-result, submitted | ||
| 16:30 | Frederic Vivien | INRIA |
|
| |
| 17h00 | Weslay Bland | ANL |
| ||
| 17H30 | Adjourn |
|
|
|
|
| 19:00 | Bus for Diner |
|
|
|
|
Mini Workshop2 Numerical Agorithms Room 1040 Chair: Bill Gropp |
|
|
|
|
|
|
| 13:30 | Luke Olson | UIUC |
| ||
14:00 | Prasanna Balaprakash | ANL | ||||
| 14:30 | Hushang | INRIA |
| ||
| 15:00 | Jed Brown | ANL |
| | |
| 15:30 | Break |
|
|
|
|
| 16:00 | Pierre Jolivet | INRIA | Best Student Paper nomiee, IEEE, ACM SC13 | ||
16:30 | Vincent Baudoui | Total&ANL | ||||
17:00 | Stefan Wild | ANL | ||||
| 17:30 | Adjourn |
|
|
|
|
| 19:00 | Bus for diner |
|
|
|
|
|
|
|
|
|
|
|
Workshop Day 3 | Friday Nov. 27 |
|
|
|
|
|
|
|
|
|
|
|
|
Mini Workshop3 |
|
|
|
|
|
|
Programming models, compilation and runtime. Room 1030 Chair: Marc Snir | 08:30 | Grigori Fursin | INRIA |
| | |
| 09:00 | Maria Garzaran | UIUC |
| ||
09:30 | Jean-François Mehaut | INRIA |
| |||
10:00 | Break | |||||
| 10:30 | Pavan Balaji | ANL |
| ||
| 11:00 | Rafael Tesser | INRIA | Joint result PDP 2013 | ||
| 11:30 | Emmanuel Jeannot | INRIA | Joint-result, IEEE Cluster2013 | ||
| 12:00 | Closing |
|
|
| |
| 12:30 | Lunch |
|
|
|
|
| 18:00 | Bus for diner |
|
|
|
|
Mini Workshop4 Large scale systems and their simulators Room 1040 Chair: Bill Kramer |
|
|
|
|
|
|
08:30 | Sanjay Kale |
|
| |||
| 09:00 | Arnault Legrand |
|
|
| |
09:30 | Kate Kahey |
|
|
| ||
| 10:00 | Break |
|
|
|
|
10:30 | Gille Fedak |
|
| |||
| 11:00 | Jeremy Henos |
|
| ||
| 11:30 | TBD |
|
|
| |
| 12:00 | Closing |
|
|
|
|
| 12:30 | Lunch |
|
|
|
|
18:00 | Bus for diner |
Abstracts
Kenton McHenry
NSF CIF21 DIBBs: Brown Dog
The objective of this project is to construct a service that will allow for past and present un-curated data to be utilized by science while simultaneously demonstrating the novel science that can be conducted from such data. The proposed effort will focus on the large distributed and heterogeneous bodies of past and present un-curated data, what is often referred to in the scientific community as long-tail data, data that would have great value to science if its contents were readily accessible. The proposed framework will be made up of two re-purposable cyberinfrastructure building blocks referred to as a Data Access Proxy (DAP) and Data Tilling Service (DTS). These building blocks will be developed and tested in the context of three use cases that will advance science in geoscience, biology, engineering, and social science. The DAP will aim to enable a new era of applications that are agnostic to file formats through the use of a tool called a Software Server which itself will serve as a workflow tool to access functionality within 3rd party applications. By chaining together open/save operations within arbitrary software the DAP will provide a consistent means of gaining access to content stored across the large numbers of file formats that plague long tail data. The DTS will utilize the DAP to access data contents and will serve to index unstructured data sources (i.e. instrument data or data without text metadata). Building off of the Versus content based comparison framework and the Medici extraction services for auto-curation the DTS will assign content specific identifiers to untagged data allowing one to search collections of such data. The intellectual merit of this work lies in the proposed solution which does not attempt to construct a single piece of software that magically understands all data, but instead aims at utilizing every possible source of automatable help already in existence in a robust and provenance preserving manner to create a service that can deal with as much of this data as possible. This proverbial “super mutt” of software, or Brown Dog, will serve as a low level data infrastructure to interface with digital data contents and through its capabilities enable a new era of science and applications at large. The broader impact of this work is in its potential to serve not just the scientific community but the general public, as a DNS for data, moving civilization towards an era where a user’s access to data is not limited by a file’s format or un-curated collections.
Emmanuel Jeannot, Esteban Meneses-Rojas, Guillaume Mercier, François Tessier and Gengbin Zheng
Communication and Topology-aware Load Balancing in Charm++ with TreeMatch
Abstract—Programming multicore or manycore architectures is a hard challenge particularly if one wants to fully take advantage of their computing power. Moreover, a hierarchical topology implies that communication performance is heterogeneous and this characteristic should also be exploited. We developed two load balancers for Charm++ that take into account both aspects depending on the fact that the application is compute-bound or communication-bound. This work is based on our TREEMATCH library that compute process placement in order to reduce an application communication cost based on the hardware topology. We show that the proposed load-balancing scheme manages to improve the execution times for the two classes of parallel applications.
Matthieu Dorier
CALCioM: Mitigating I/O Interferences in HPC Systems through Cross-Application Coordination
Unmatched computation and storage performance in new HPC systems have led to a plethora of I/O optimizations ranging from application-side collective I/O to network and disk-level request scheduling on the file system side. As we deal with ever larger machines, the interference produced by multiple applications accessing a shared parallel file system in a concurrent manner become a major problem. Interference often breaks single-application I/O optimizations, dramatically degrading application I/O performance and, as a result, lowering machine wide efficiency.
This talk will focuse on CALCioM, a framework that aims to mitigate I/O interference through the dynamic selection of appropriate scheduling policies. CALCioM allows several applications running on a supercomputer to communicate and coordinate their I/O strategy in order to avoid interfering with one another. In this work, we examine four I/O strategies that can be accommodated in this framework: serializing, interrupting, interfering and coordinating. Experiments on Argonne’s BG/P Surveyor machine and on several clusters of the French Grid’5000 show how CALCioM can be used to efficiently and transparently improve the scheduling strategy between two otherwise interfering applications, given specified metrics of machine wide efficiency.