Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/8540
Nаziv: | Distributed memory parallel algorithms for minimum spanning trees | Аutоri: | Lončar V. Škrbić, S. Balaž, A. |
Dаtum izdаvаnjа: | 25-нов-2013 | Čаsоpis: | Lecture Notes in Engineering and Computer Science | Sažetak: | Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and Kruskal's algorithm and present their parallelization targeting message passing parallel machine with distributed memory. We consider large graphs that can not fit into memory of one process. Experimental results show that Prim's algorithm is a good choice for dense graphs while Kruskal's algorithm is better for sparse ones. Poor scalability of Prim's algorithm comes from its high communication cost while Kruskal's algorithm showed much better scaling to larger number of processes. | URI: | https://open.uns.ac.rs/handle/123456789/8540 | ISBN: | 9789881925282 | ISSN: | 20780958 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
1
prоvеrеnо 22.02.2020.
Prеglеd/i stаnicа
25
Prоtеklа nеdеljа
10
10
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.