Meerkat: A Framework for Dynamic Graph Algorithms on GPUs

Graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions. Typical examples of dynamic graphs are social networks, collaboration networks, a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of parallel programming 2024-12, Vol.52 (5-6), p.400-453
Hauptverfasser:	Concessao, Kevin Jude, Cheramangalath, Unnikrishnan, Dev, Ricky, Nasre, Rupesh
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Computer Science Cooperative work Data structures Graph representations Graph theory Graphical representations Graphics processing units Parallel processing Processor Architectures Search algorithms Search engines Shortest-path problems Social networks Software Engineering/Programming and Operating Systems Structured data Theory of Computation Topology Unstructured data
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!