A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth- first search (BFS) scheme that scales for random graphs with up to three billion vertices and 30 billion edges. Scalabili...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings of the 2005 ACM/IEEE conference on Supercomputing s. 25
Hlavní autori:	Yoo, Andy, Chow, Edmond, Henderson, Keith, McLendon, William, Hendrickson, Bruce, Catalyurek, Umit
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Washington, DC, USA IEEE Computer Society 2005 IEEE
Edícia:	ACM Conferences
Predmet:	Area measurement Computer systems organization > Architectures > Distributed architectures > Grid computing Computer systems organization > Architectures > Parallel architectures > Multicore architectures Computer systems organization > Architectures > Serial architectures > Superscalar architectures Computing methodologies > Artificial intelligence > Search methodologies Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search Computing methodologies > Artificial intelligence > Search methodologies > Game tree search Computing methodologies > Modeling and simulation > Simulation types and techniques > Massively parallel and high-performance simulations Extraterrestrial measurements Gain measurement Government Laboratories Large-scale systems Partitioning algorithms Research and development Scalability Software and its engineering > Software organization and properties > Software system structures > Distributed systems organizing principles > Grid computing Testing Theory of computation > Design and analysis of algorithms > Data structures design and analysis > Sorting and searching
ISBN:	1595930612, 9781595930613
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!