BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE: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.=0A=0AIn 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=0Aon an out-of-core dynamic edge insertion workload.
SUMMARY:Design of a NVRAM Specialized Degree Aware Dynamic Graph Data Structure
PRIORITY:3
END:VEVENT
END:VCALENDAR