SC13 Home > SC13 Schedule > SC13 Presentation - Active-Testing and Large Scale Non-determinism Control Studies with Programmable Schedulers

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.

Active-Testing and Large Scale Non-determinism Control Studies with Programmable Schedulers

SESSION: ACM Student Research Competition Poster Reception

EVENT TYPE: ACM Student Research Competition Posters, ACM Student Research Competition

TIME: 5:15PM - 7:00PM

AUTHOR(S):Bruce Bolick

ROOM:Mile High Pre-Function

ABSTRACT:
Active-testing methods for hybrid concurrency models are essential, but poorly understood, and not yet demonstrated at scale. Today's active-testing approaches run tests on specific platforms for specific configurations. They are hard to modify once they have been written, and offer little flexibility. This research investigates how active-testing approaches can be created to be effective in the modern setting of hybrid concurrency. We are reimplementing a scheduler for a relatively mature active-tester for MPI in Scheme/Racket, a modern higher order functional language, in order to provide elegance, simplicity and extensibility. In the poster session, I will demonstrate how such a scheduler empowers large scale non-determinism control studies, facilitates search-bounding, and provides flexibility in formal verification of HPC systems.

Chair/Author Details:

Bruce Bolick - University of Utah School

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