A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other proposed parallel formulations of multilevel algorithms) is that it partitions the vertices of the gr...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 48; číslo 1; s. 71 - 95
Hlavní autori:	Karypis, George, Kumar, Vipin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 10.01.1998 Elsevier
Predmet:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology fill reducing ordering Information retrieval. Graph multilevel partitioning methods numerical linear algebra parallel graph partitioning Software Theoretical computing numerical linear algebra parallel graph partitioning fill reducing ordering multilevel partitioning methods Partition Parallel algorithm Distributed memory multiprocessor system Numerical computation Algorithm performance Linear algebra Sparse matrix Graph theory Distributed system Experimental study
ISSN:	0743-7315, 1096-0848
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!