sponsored byIEEEACMThe International Conference for High Performance 
Computing, Networking, Storage and Analysis
FacebookTwitterGoogle PlusLinkedInYouTubeFlickr

SCHEDULE: NOV 16-21, 2014

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.

Employing Machine Learning for the Selection of Robust Algorithms for the Dynamic Scheduling of Scientific Applications

SESSION: Poster Reception

EVENT TYPE: Posters

TIME: 5:15PM - 7:00PM

AUTHOR(S):Nitin Sukhija, Srishti Srivastava, Florina M. Ciorba, Ioana Banicescu, Brandon Malone

ROOM:New Orleans Theater Lobby

ABSTRACT:

Scheduling scientific applications with large, computationally intensive, and data parallel loops, which have irregular iteration execution times, on heterogeneous computing systems with unpredictably fluctuating load requires highly efficient and robust scheduling algorithms. State-of-the-art dynamic loop scheduling (DLS) techniques provide a solution for achieving the best performance for these applications executing in dynamic computing environments. Selecting the most robust of the state-of-the-art DLS algorithms remains, however, challenging.

In this work we propose a methodology for solving this selection problem. We employ machine learning to obtain an empirical robustness prediction model that enables algorithm selection from a portfolio of DLS algorithms on a per-instance basis. An instance consists of the given application and current system characteristics, including workload conditions. Through discrete event simulations, we show that the proposed portfolio-based approach offers higher performance guarantees with respect to the robust execution of the application when compared to the simpler winner-take-all approach.

Chair/Author Details:

Nitin Sukhija - Mississippi State University

Srishti Srivastava - Mississippi State University

Florina M. Ciorba - Technical University Dresden

Ioana Banicescu - Mississippi State University

Brandon Malone - Helsinki Institute for Information Technology

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