================================================================================ CALL FOR PAPERS
EXADAPT: 2nd International Workshop on Adaptive Self-tuning Computing Systems for Exaflop Era
March 3rd, 2012, London, UK (co-located with ASPLOS 2012)
Sponsored by Google ================================================================================
Modern large scale computing systems are rapidly evolving and may soon feature millions of cores with exaflop performance. However, this leads to a tremendous complexity with an unprecedented number of available design and optimization choices for architectures, applications, compilers and run-time systems. Using outdated, non-adaptive technology results in an enormous waste of expensive computing resources and energy, while slowing down time to market.
The 2nd International Workshop on Self-tuning, Large Scale Computing Systems for Exaflop Era (EXADAPT) is an interdisciplinary forum for researchers, practitioners, developers and application writers to discuss ideas, experience, methodology, applications, practical techniques and tools to improve or change current and future computing systems using self-tuning technology. Such systems should be able to automatically adjust their behavior to multi- objective usage scenarios at all levels (hardware and software) based on empirical, dynamic, iterative, statistical, collective, bio-inspired, machine learning and alternative techniques while fully utilizing available resources.
All papers will be peer-reviewed including short position papers and should include unpublished ideas on how to simplify, automate and standardize the design, programming, optimization and adaptation of large-scale computing systems for multiple objectives to improve performance, power consumption, utilization, reliability and scalability.
==== Important Dates ====
- Submissions due: December 21, 2011, 23:59:59 submitter's time zone NO EXTENSIONS WILL BE GRANTED
- Author notification: January 14, 2012
- Revised papers due: January 31, 2012
==== Past EXADAPT workshops ====
- 1st ACM SIGPLAN EXADAPT 2011 at PLDI 2011/FCRC 2011, San Jose, CA, USA
Website:
==== Program Chairs/organizers: ====
- Grigori Fursin, INRIA Saclay, France
- Robert Hundt, Google, USA
- Jason Mars, University of Virginia, USA
- Yuriy Kashnikov, Exascale Computing Research, France
==== Program Committee: ====
- Erik R. Altman, IBM TJ Watson, USA
- Jose Nelson Amaral, University of Alberta, Canada
- David H. Bailey, Lawrence Berkeley National Laboratory, USA
- Steve Blackburn, Australian National University, Australia
- Francois Bodin, CAPS Entreprise, France
- Franck Capello, INRIA, France
- Koen DeBosschere, Ghent University, Belgium
- Rajiv Gupta, University of California, Riverside, USA
- Anton Lokhmotov, ARM, UK
- Geoff Lowney, Intel, USA
- Bernd Mohr, Julich Supercomputing Centre, Germany
- Tipp Moseley, Google, USA
- Toshio Nakatani, IBM Tokyo Research Lab, Japan
- Nacho Navarro, UIUC, USA / UPC, Spain
- Boyana Norris, Argonne National Laboratory, USA
- Keshav Pingali, University of Texas at Austin, USA
- Markus Puschel, ETH Zurich, Switzerland
- Xipeng Shen, College of William & Mary, USA
- Allan Snavely, San Diego Supercomputer Center, USA
- Felix Wolf, Aachen University, Germany
- Chengyong Wu, ICT, China
==== Paper Submission Guidelines ====
We invite papers in two categories:
- Full papers should be at most 12 pages long including bibliography and appendices. Papers in this category are expected to have relatively mature content. Full paper presentations will be 25 minutes each.
- Position papers should be at most 6 pages long including bibliography and appendices. Preliminary and exploratory work are welcome in this category, including wild & crazy ideas. Position paper presentations will be 10 minutes each. Authors submitting papers in this category must prepend the phrase Position Paper: to the title of the submitted paper.
Submissions should be PDF documents typeset in the ACM proceedings format using
10pt fonts. SIGPLAN-approved templates can be found atPaper submission website: