SC is the International Conference for
 High Performnance Computing, Networking, Storage and Analysis

SCHEDULE: NOV 13-19, 2010

Functional Partitioning to Optimize End-to-End Performance on Many-Core Architectures

SESSION: Runtime Resource Allocation and Scheduling


TIME: 4:30PM - 5:00PM


AUTHOR(S):Min Li, Sudharshan S. Vazhkudai, Ali R. Butt, Fei Meng, Xiaosong Ma, Youngjae Kim, Christian Engelmann, Galen Shipman


Scaling computations on emerging massive-core supercomputers is a daunting task, which coupled with the significantly lagging system I/O capabilities exacerbates applications’ end-to-end performance. The I/O bottleneck often negates potential performance benefits of assigning additional compute cores to an application. In this paper, we address this issue via a novel functional partitioning (FP) runtime environment that allocates cores to specific application tasks — checkpointing, de-duplication, and scientific data format transformation — so that the deluge of cores can be brought to bear on the entire gamut of application activities. The focus is on utilizing the extra cores to support HPC application I/O activities and also leverage solid-state disks in this context. For example, our evaluation shows that dedicating 1 core on an oct-core machine for checkpointing and its assist tasks using FP can improve overall execution time of a FLASH benchmark on 80 and 160 cores by 43.95% and 41.34%, respectively.

Chair/Author Details:

Joel Saltz (Chair) - Emory University

Min Li - Virginia Tech

Sudharshan S. Vazhkudai - Oak Ridge National Laboratory

Ali R. Butt - Virginia Tech

Fei Meng - North Carolina State University

Xiaosong Ma - North Carolina State University

Youngjae Kim - Oak Ridge National Laboratory

Christian Engelmann - Oak Ridge National Laboratory

Galen Shipman - Oak Ridge National Laboratory

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar

The full paper can be found in the ACM Digital Library and IEEE Computer Society

   Sponsors    IEEE    ACM