Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency

Graph-based structures are being increasingly used to model data and relations among data in a number of fields. Graph-based databases are becoming more popular as a means to better represent such data. Graph traversal is a key component in graph algorithms such as reachability and graph matching. S...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2012 IEEE 26th International Parallel and Distributed Processing Symposium s. 378 - 389
Hlavní autori:	Chhugani, J., Satish, N., Changkyu Kim, Sewall, J., Dubey, P.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2012
Predmet:	Arrays Bandwidth efficient Graph traversal Instruction sets multi-socket Partitioning algorithms single node Sockets
ISBN:	1467309753, 9781467309752
ISSN:	1530-2075
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!