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.
You can also create your personal schedule on the SC11 app (Boopsie) on your smartphone. Simply select a session you want to attend and "add" it to your plan. Continue in this manner until you have created your own personal schedule. All your events will appear under "My Event Planner" on your smartphone.
Co-Allocation Based Scheduling for Parallel Systems
SESSION: Research Poster Reception
EVENT TYPE: ACM Student Research Competition Poster, Poster, Electronic Poster
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Bernd Mohr
AUTHOR(S):Seren Soner, Can Ozturan, Oguz Tosun
ROOM:WSCC North Galleria 2nd/3rd Floors
ABSTRACT: State-of-the-art supercomputers are made up of multiple types of resources. User jobs also have wide spectrum of resource requirements. Hence, a supercomputer can be thought of as a collection of heterogeneous resources with heterogeneous usage requirements from the users. Schedulers for such systems are challenged by several issues like scalability, GPU, topology and energy awareness. We view each scheduling step as solving a co-allocation problem, i.e. the problem of allocating multiple resources simultaneously to jobs. Collection of jobs can be repeatedly taken from the front of the job queue (i.e. a window of jobs) and a co-allocation problem formulated as an (integer) linear program (ILP/LP) can be solved. ILP formulations for single-type and multiple instances, a CPU-GPU and generalized systems are provided. Co-allocation solver is applied to both the window of jobs and the backfilled jobs. Simulation results show effectiveness of our approaches when compared with pure first-come-first-served schedulers.
Chair/Author Details:
Bernd Mohr (Chair) - Juelich Supercomputing Centre