Asynchronous Graph Pattern Matching on Multiprocessor Systems
Publikation: Vorabdruck/Dokumentation/Bericht › Vorabdruck (Preprint)
Beitragende
Abstract
Pattern matching on large graphs is the foundation for a variety of application domains. Strict latency requirements and continuously increasing graph sizes demand the usage of highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, graph partitioning becomes increasingly important. Hence, we present a technique to process graph pattern matching on NUMA systems in this paper. As a scalable pattern matching processing infrastructure, we leverage a data-oriented architecture that preserves data locality and minimizes concurrency-related bottlenecks on NUMA systems. We show in detail, how graph pattern matching can be asynchronously processed on a multiprocessor system.
Details
Originalsprache | Englisch |
---|---|
Seitenumfang | 14 |
Publikationsstatus | Veröffentlicht - 13 Juni 2017 |
No renderer: customAssociatesEventsRenderPortal,dk.atira.pure.api.shared.model.researchoutput.WorkingPaper
Externe IDs
ORCID | /0000-0001-8107-2775/work/142660524 |
---|
Schlagworte
Schlagwörter
- cs.DB, cs.DC