- Home
- Register
- Attend
- Conference Program
- SC15 Schedule
- Technical Program
- Awards
- Students@SC
- Research with SCinet
- HPC Impact Showcase
- HPC Matters Plenary
- Keynote Address
- Support SC
- SC15 Archive
- Exhibits
- Media
- SCinet
- HPC Matters
SCHEDULE: NOV 15-20, 2015
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.
Design of a NVRAM Specialized Degree Aware Dynamic Graph Data Structure
SESSION: Regular & ACM Student Research Competition Poster Reception
EVENT TYPE: Posters, Receptions, ACM Student Research Competition
EVENT TAG(S): HPC Beginner Friendly, Regular Poster
TIME: 5:15PM - 7:00PM
SESSION CHAIR(S): Michela Becchi, Manish Parashar, Dorian C. Arnold
AUTHOR(S):Keita Iwabuchi, Roger A. Pearce, Brian Van Essen, Maya Gokhale, Satoshi Matsuoka
ROOM:Level 4 - Lobby
ABSTRACT:
Large-scale graph processing, where the graph is too large to fit in main-memory, is often required in diverse application fields. Recently, Non-Volatile Random Access Memories (NVRAM) devices, e.g., NAND Flash, have enabled the possibility to extend main-memory capacity without extremely high cost and power consumption. Our previous work demonstrated that NVRAM can be a powerful storage media for graph applications. However, constructing large graphs is expensive especially for NVRAM devices, due to sparse random memory accesses.
In many graph applications, the structure of the graph changes dynamically over time and may require online analysis. We describe a NVRAM specialized degree aware dynamic graph data structure using open addressing compact hash tables in order to minimize the number of page misses. We demonstrate that our dynamic graph structure can scale near-linearly
on an out-of-core dynamic edge insertion workload.
Chair/Author Details:
Michela Becchi, Manish Parashar, Dorian C. Arnold (Chair) - University of Missouri|Rutgers University|University of New Mexico|
Keita Iwabuchi - Tokyo Institute of Technology
Roger A. Pearce - Lawrence Livermore National Laboratory
Brian Van Essen - Lawrence Livermore National Laboratory
Maya Gokhale - Lawrence Livermore National Laboratory
Satoshi Matsuoka - Tokyo Institute of Technology
Click here to download .ics calendar file
