Show simple item record

dc.contributor.advisorConte, Tom
dc.contributor.authorHein, Eric Robert
dc.date.accessioned2018-08-20T15:35:32Z
dc.date.available2018-08-20T15:35:32Z
dc.date.created2018-08
dc.date.issued2018-05-22
dc.date.submittedAugust 2018
dc.identifier.urihttp://hdl.handle.net/1853/60228
dc.description.abstractMassive data rates in cybersecurity, simulation, and social media analysis applications are driving rapid advances in the field of streaming graph analytics. The data structures that enable streaming graph analytics pose unique challenges for high-performance computing system designers. When the sorted, contiguous arrays of static graphs are replaced with the fragmented, linked data structures of dynamic graphs, these systems struggle to reach the memory bandwidth saturation point. Behaviors such as pointer-chasing and poor spatial locality expose the true latency of modern memory devices, which has not kept up with processor clock rates. This dissertation develops a streaming graph benchmark, DynoGraph, which is distinguished from static graph benchmarks by the use of realistic streaming graph inputs and dynamic graph data structures. The benchmark is used to expose performance pitfalls in existing implementations. These insights flow into the design of near-memory accelerators for streaming graph analytics, as well as software improvements. The Emu architecture is identified as a promising solution for accelerating algorithms with low spatial locality, unbalanced parallelism, and fine-grained memory accesses, since it is able to maintain high memory bandwidth utilization in a worst-case pointer-chasing scenario. The work culminates in a characterization of the Emu Chick hardware prototype, proposing efficient programming primitives, highlighting necessary system improvements, and demonstrating the potential for greatly improved performance on this important class of workloads.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectComputer architecture
dc.subjectStreaming graph analytics
dc.subjectGraph algorithms
dc.subjectHigh-performance computing
dc.subjectNear-data processing
dc.titleNear-data processing for dynamic graph analytics
dc.typeDissertation
dc.description.degreePh.D.
dc.contributor.departmentElectrical and Computer Engineering
thesis.degree.levelDoctoral
dc.contributor.committeeMemberBader, David
dc.contributor.committeeMemberYalamanchili, Sudhakar
dc.contributor.committeeMemberVuduc, Richard
dc.contributor.committeeMemberPrvulovic, Milos
dc.date.updated2018-08-20T15:35:32Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record