A Dynamically Scheduled Architecture for the Synthesis of Graph Database Queries

Abstract

Data analytics applications, such as graph databases, exibit irregular behaviors that make their acceleration non-trivial. These applications expose a significant amount of Task Level Parallelism (TLP), but they present fine grained memory accesses.