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.
Large-Scale Energy-Efficient Graph Traversal - A Path to Efficient Data-Intensive Supercomputing
SESSION: Breadth First Search
EVENT TYPE: Papers
TIME: 11:30AM - 12:00PM
SESSION CHAIR: Umit Catalyurek
AUTHOR(S):Nadathur Satish, Changkyu Kim, Jatin Chhugani, Pradeep Dubey
ROOM:255-EF
ABSTRACT:
Graph-traversal is used in many fields including social-networks, bioinformatics and HPC. The push for HPC machines to be rated in ``GigaTEPS" (billions-of-traversed-edges-per-second) has led to the Graph500 benchmark.
Graph-traversal is well-optimized for single-node CPUs. However, current cluster implementations suffer from high-latency and large-volume inter-node communication, with low performance and energy-efficiency. In this work, we use novel low-overhead data-compression techniques to reduce communication-volumes along with new latency-hiding techniques. Keeping the same optimized single-node algorithm, we obtain 6.6X performance improvement and order-of-magnitude energy savings over state-of-the-art techniques.
Our Graph500 implementation achieves 115 GigaTEPS on 320-node Intel-Endeavor cluster with E5-2700 Sandybridge nodes, matching the second-ranked result in the November-2011 Graph500 list with 5.6X fewer nodes. Our per-node performance only drops 1.8X over optimized single-node implementations, and is highest in the top 10 of the list. We obtain near-linear scaling with node count. On 1024 Westmere-nodes of the NASA-Pleiadas system, we obtain 195 GigaTEPS.
Chair/Author Details:
Umit Catalyurek (Chair) - Ohio State University
Nadathur Satish - Intel Corporation
Changkyu Kim - Intel Corporation
Jatin Chhugani - Intel Corporation
Pradeep Dubey - Intel Corporation
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
Large-Scale Energy-Efficient Graph Traversal - A Path to Efficient Data-Intensive Supercomputing
SESSION: Breadth First Search
EVENT TYPE:
TIME: 11:30AM - 12:00PM
SESSION CHAIR: Umit Catalyurek
AUTHOR(S):Nadathur Satish, Changkyu Kim, Jatin Chhugani, Pradeep Dubey
ROOM:255-EF
ABSTRACT:
Graph-traversal is used in many fields including social-networks, bioinformatics and HPC. The push for HPC machines to be rated in ``GigaTEPS" (billions-of-traversed-edges-per-second) has led to the Graph500 benchmark.
Graph-traversal is well-optimized for single-node CPUs. However, current cluster implementations suffer from high-latency and large-volume inter-node communication, with low performance and energy-efficiency. In this work, we use novel low-overhead data-compression techniques to reduce communication-volumes along with new latency-hiding techniques. Keeping the same optimized single-node algorithm, we obtain 6.6X performance improvement and order-of-magnitude energy savings over state-of-the-art techniques.
Our Graph500 implementation achieves 115 GigaTEPS on 320-node Intel-Endeavor cluster with E5-2700 Sandybridge nodes, matching the second-ranked result in the November-2011 Graph500 list with 5.6X fewer nodes. Our per-node performance only drops 1.8X over optimized single-node implementations, and is highest in the top 10 of the list. We obtain near-linear scaling with node count. On 1024 Westmere-nodes of the NASA-Pleiadas system, we obtain 195 GigaTEPS.
Chair/Author Details:
Umit Catalyurek (Chair) - Ohio State University
Nadathur Satish - Intel Corporation
Changkyu Kim - Intel Corporation
Jatin Chhugani - Intel Corporation
Pradeep Dubey - Intel Corporation
Click here to download .ics calendar file