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.

ENTIRE WEEK SUNDAY MONDAY TUESDAY WEDNESDAY THURSDAY FRIDAY

Parallel Complex Network Partitioning

SESSION: ACM Student Research Competition Poster Reception

EVENT TYPE: ACM Student Research Competition

TIME: 5:15PM - 7:00PM

AUTHOR(S):George M. Slota

ROOM:New Orleans Theater Lobby

ABSTRACT:

A large number parallel graph analytics follow a bulk synchronous parallel (BSP) model: periods of parallel computation followed by periods of parallel communication. To maximize parallel efficiency when a graph is distributed across a cluster, we want a partitioning of the input graph that balances both work and memory (proportional to number of vertices and edges per process) and communication (proportional to total edge cut and maximal edge cut per process). Traditional multi-level partitioners are unable to satisfy all of these requirements and are heavy-weight in terms of computational and memory requirements. This work introduces PULP, an iterative partitioning methodology for small-world graphs that can simultaneously handle multiple constraints and multiple objectives. Partitions produced by PULP are equal to or better than state-of-the-art partitioners in terms of edge cut. PULP also runs very fast, being capable of partitioning multi-billion edge graphs in minutes on a single compute node.