SC13 Home > SC13 Schedule > SC13 Presentation - Task Mapping for Non-Contiguous Allocations

SCHEDULE: NOV 16-22, 2013

When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.

Task Mapping for Non-Contiguous Allocations

SESSION: Research Poster Reception

EVENT TYPE: Posters, Electronic Posters, and Education Posters

TIME: 5:15PM - 7:00PM

AUTHOR(S):David P. Bunde, Johnathan Ebbers, Stefan P. Feer, Vitus J. Leung, Nickolas W. Price, Zachary D. Rhodes, Matthew Swank

ROOM:Mile High Pre-Function

We examine task mapping algorithms for systems that allocate jobs non-contiguously, such as the Cray X series. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Our focus is on jobs with a stencil communication pattern. We use experiments on a Cray XE to evaluate novel task mapping algorithms as well as some adapted to this setting. This is done with the miniGhost miniApp which mimics the performance of CTH, a shock physics application. Our strategies improve average running time by as much as 28% over a baseline strategy.

Chair/Author Details:

David P. Bunde - Knox College

Johnathan Ebbers - Knox College

Stefan P. Feer - 3M Health Information Systems

Vitus J. Leung - Sandia National Laboratories

Nickolas W. Price - Knox College

Zachary D. Rhodes - Allstate Corporation

Matthew Swank - Knox College

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