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.
Hybrid Breadth First Search Implementation for Hybrid-Core Computers
SESSION: Research Poster Reception
EVENT TYPE: Posters and Electronic Posters
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Kevin Wadleigh
ROOM:East Entrance
ABSTRACT:
The Graph500 benchmark is designed to evaluate the suitability of supercomputing systems on graph algorithms, which are increasingly important in HPC. The timed Graph500 kernel, Breadth First Search, exhibits memory access patterns typical of these types of applications, with poor spatial locality and synchronization between multiple streams of execution.
The Graph500 benchmark was ported to a Convey HC-2ex, a hybrid-core computer with an Intel host system and a coprocessor incorporating four reprogrammable Xilinx FPGAs. The computer incorporates a unique memory system designed to sustain high bandwidth for random memory accesses. The BFS kernel was implemented as a hybrid algorithm with concurrent processing on both the host and coprocessor. The early steps use a top-down algorithm on the host with results copied to coprocessor memory for use in a bottom-up algorithm. The coprocessor uses thousands of threads to traverse the graph. The resulting implementation runs at over 11 billion TEPS.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Kevin Wadleigh - Convey Computer
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
Hybrid Breadth First Search Implementation for Hybrid-Core Computers
SESSION: Research Poster Reception
EVENT TYPE:
TIME: 5:15PM - 7:00PM
SESSION CHAIR: Torsten Hoefler
AUTHOR(S):Kevin Wadleigh
ROOM:East Entrance
ABSTRACT:
The Graph500 benchmark is designed to evaluate the suitability of supercomputing systems on graph algorithms, which are increasingly important in HPC. The timed Graph500 kernel, Breadth First Search, exhibits memory access patterns typical of these types of applications, with poor spatial locality and synchronization between multiple streams of execution.
The Graph500 benchmark was ported to a Convey HC-2ex, a hybrid-core computer with an Intel host system and a coprocessor incorporating four reprogrammable Xilinx FPGAs. The computer incorporates a unique memory system designed to sustain high bandwidth for random memory accesses. The BFS kernel was implemented as a hybrid algorithm with concurrent processing on both the host and coprocessor. The early steps use a top-down algorithm on the host with results copied to coprocessor memory for use in a bottom-up algorithm. The coprocessor uses thousands of threads to traverse the graph. The resulting implementation runs at over 11 billion TEPS.
Chair/Author Details:
Torsten Hoefler (Chair) - ETH Zurich
Kevin Wadleigh - Convey Computer
Click here to download .ics calendar file