SCHEDULE: NOV 10-16, 2012
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.
Evaluating Topology Mapping via Graph Partitioning
SESSION: Research Poster Reception
EVENT TYPE: Posters and Electronic Posters
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Anshu Arya, Todd Gamblin, Bronis R. de Supinski, Laxmikant V. Kale
ROOM:East Entrance
ABSTRACT:
Intelligently mapping applications to machine network topologies has been shown to improve performance, but considerable developer effort is required to find good mappings. Techniques from graph partitioning have the potential to automate topology mapping and relieve the developer burden. Graph partitioning is already used for load balancing parallel applications, but can be applied to topology mapping as well. We show performance gains by using a topology-targeting graph partitioner to map sparse matrix-vector and volumetric 3-D FFT kernels onto a 3-D torus network.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Anshu Arya - University of Illinois at Urbana-Champaign
Todd Gamblin - Lawrence Livermore National Laboratory
Bronis R. de Supinski - Lawrence Livermore National Laboratory
Laxmikant V. Kale - University of Illinois at Urbana-Champaign
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
Evaluating Topology Mapping via Graph Partitioning
SESSION: Research Poster Reception
EVENT TYPE:
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Anshu Arya, Todd Gamblin, Bronis R. de Supinski, Laxmikant V. Kale
ROOM:East Entrance
ABSTRACT:
Intelligently mapping applications to machine network topologies has been shown to improve performance, but considerable developer effort is required to find good mappings. Techniques from graph partitioning have the potential to automate topology mapping and relieve the developer burden. Graph partitioning is already used for load balancing parallel applications, but can be applied to topology mapping as well. We show performance gains by using a topology-targeting graph partitioner to map sparse matrix-vector and volumetric 3-D FFT kernels onto a 3-D torus network.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Anshu Arya - University of Illinois at Urbana-Champaign
Todd Gamblin - Lawrence Livermore National Laboratory
Bronis R. de Supinski - Lawrence Livermore National Laboratory
Laxmikant V. Kale - University of Illinois at Urbana-Champaign
Click here to download .ics calendar file