Fast iterative graph computation a path centric approach

Large scale graph processing represents an interesting challenge due to the lack of locality. This paper presents PathGraph for improving iterative graph computation on graphs with billions of edges. Our system design has three unique features: First, we model a large graph using a collection of tre...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis s. 401 - 412
Hlavní autoři:	Yuan, Pingpeng, Zhang, Wenya, Xie, Changfeng, Jin, Hai, Liu, Ling, Lee, Kisung
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Piscataway, NJ, USA IEEE Press 16.11.2014 IEEE
Edice:	ACM Conferences
Témata:	Analytical models Computational efficiency Computational modeling Computer systems organization > Dependable and fault-tolerant systems and networks Computing model Convergence General and reference > Cross-computing tools and techniques > Performance Graph Iterative algorithms Iterative computation Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms Mathematics of computing > Discrete mathematics > Graph theory > Paths and connectivity problems Media Networks > Network performance evaluation Partitioning algorithms Path Programming Storage Storage management System analysis and design path computing model iterative computation storage graph
ISBN:	1479955000, 9781479955008
ISSN:	2167-4329
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!