A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications
2016
2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)
Preserved Fulltext
In this paper, we propose a new direct k-way greedy graph growing algorithm, called KGGGP, that overcomes this issue and succeeds to produce partition with better quality than RB while respecting the constraint ...
However, in applications where initial fixed vertices are used to model additional constraints of the problem, RB based methods often fail to produce partitions of good quality. ...
More particularly, the KGGGP algorithm is a direct k-way greedy graph growing partitioning algorithm that successfully handles initial fixed vertices and produces partitions of better quality. ...
doi:10.1109/pdp.2016.109
dblp:conf/pdp/PredariE16
fatcat:77s2d6fmtzh3hjv2w4klmuu7iy
Comparison of initial partitioning methods for multilevel direct k -way graph partitioning with fixed vertices
2017
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The first one, called kgggp is a direct k-way greedy graph growing partitioning that properly handles fixed vertices while the second one, introduced in kPaToH, uses RB and a post-processing technique ...
A common approach to solve this problem is to use graph representation and perform a graph partitioning in k-parts using the multilevel framework and the recursive bisection (RB) paradigm. ...
Acknowledgment The authors would like to thank Bora Uçar for his valuable advice for the implementation of the rbbgm method used in this study. ...
doi:10.1016/j.parco.2017.05.002
fatcat:4oscd4cprvhillakcgaswax5om
Hypergraph-based Dynamic Load Balancing for Adaptive Scientific Computations
2007
2007 IEEE International Parallel and Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The new model can be solved using hypergraph partitioning with fixed vertices. ...
Hypergraph partitioning is a successful model for minimizing communication volume in scientific computations, and partitioning software for the static case is widely available. ...
Acknowledgments We thank Bruce Hendrickson and Vitus Leung for their contributions to the Zoltan project. ...
doi:10.1109/ipdps.2007.370258
dblp:conf/ipps/CatalyurekBDBHR07
fatcat:juakmxjherhozp73m7bcmyvvry
Benchmarking of Graph Partitioning Tools and Techniques
2019
International journal of recent technology and engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper the authors have used a systematic literature review to provide benchmarking on influencing parameters for graph partitioning tools, which is the principal contribution of the present paper ...
Also authors have suggested future research directions and anomalies for improvement in tools and techniques for Graph Partitioning. ...
It shows a good partition. For an illustration, in k-way partitioning, graph G is partitioned into k equal components with minimum cut. ...
doi:10.35940/ijrte.d7369.118419
fatcat:hy2qdjhk6zbd5al5up26qce7yy
A repartitioning hypergraph model for dynamic load balancing
2009
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We show that the new model can be realized using hypergraph partitioning with fixed vertices and describe our parallel multilevel implementation within the Zoltan load-balancing toolkit. ...
In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. ...
Acknowledgments We thank Danny Dunlavy for providing the Citeseer data; Richard Drake and Johan Steensland for the adaptive mesh refinement data; and Rich Lee, Mark Shephard, and Xiaojuan Luo for the slac6M ...
doi:10.1016/j.jpdc.2009.04.011
fatcat:ogrycndn3rhsrgoxrkzfkpkuf4
The left greedy Lie algebra basis and star graphs
2016
Involve. A Journal of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our constructions further equip the left-greedy brackets with a dual monomial Lie coalgebra basis of "star" graphs. ...
We construct a basis for free Lie algebras via a "left-greedy" bracketing algorithm on Lyndon-Shirshov words. ...
Acknowledgements We would like to thank the reviewer for a careful and detailed reading of our submission and also for suggesting that we consider an application of Lazard elimination (see Remark 3.4) ...
doi:10.2140/involve.2016.9.783
fatcat:eoyqs2zp7zgvloaf6ibip4ctyu
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. ...
In this paper, we describe a new distributedmemory algorithm for doing the coloring itself in parallel. ...
(i) Initial partitioning. In a parallel application, the graph is usually already distributed among the processors in a reasonable way. ...
doi:10.1007/11549468_29
fatcat:e7spbxffqnc5fju4maar2can7i
Speeding up Parallel Graph Coloring
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Our implementations use OpenMP for parallelization and Metis for graph partitioning. The experiments show that we get up to a 70 % reduction in runtime compared to the previous algorithm. ...
This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. ...
In a parallel application the graph is usually already distributed among the processors in a reasonable way. ...
doi:10.1007/11558958_130
fatcat:fbw7jbcnwvapzb2vixhkfnbjna
Multilevelk-way Partitioning Scheme for Irregular Graphs
1998
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
then we uncoarsen and refine it to construct a k-way partitioning for the original graph. ...
In this paper, we present and study a class of graph partitioning algorithms that reduces the size of the graph by collapsing vertices and edges, we find a k-way partitioning of the smaller graph, and ...
These coarse k vertices can serve as the initial k-way partitioning of the original graph. There are two problems with this approach. ...
doi:10.1006/jpdc.1997.1404
fatcat:gr2wwjixxbfcjfzc3tiasxr3gm
Boosting Vertex-Cut Partitioning for Streaming Graphs
2016
2016 IEEE International Congress on Big Data (BigData Congress)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges. ...
We introduce an efficient platform for boosting streaming graph partitioning algorithms. Our solution, called HoVerCut, is Horizontally and Vertically scalable. ...
ACKNOWLEDGEMENT This work was supported by the End-to-End Clouds project funded by the Swedish Foundations for Strategic Research under the contract RIT10-0043 and the BIDAF project funded by KK-stiffen ...
doi:10.1109/bigdatacongress.2016.10
dblp:conf/bigdata/SajjadPRVH16
fatcat:hqoc7zi755cifl66qwz3sauina
Greedy, prohibition, and reactive heuristics for graph partitioning
1999
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A greedy construction scheme with an appropriate tie-breaking rule (MIN-MAX-GREEDY) produces initial assignments in a very fast time. ...
When the method is not competitive, the initial assignments are used as starting points for a prohibition-based scheme, where the prohibition is chosen in a randomized and reactive way, with a bias towards ...
Diekmann for providing us with benchmark graphs and, indirectly, D.S. Johnson and the other researchers for making the original graphs available. F. Pellegrini and R. ...
doi:10.1109/12.762522
fatcat:m6cpkixrpbco3op5zomszxquea
A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
2012
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining Algorithms, Systems, Programming Models and Applications - BigMine '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A efficient and scalable partitioning algorithm is crucial for large-scale distributed graph mining. In this paper, we propose a novel parallel multi-level stepwise partitioning algorithm. ...
The experimental results show that our algorithm generally outperforms the existing algorithms and has a high efficiency and scalability for large-scale graph partitioning. ...
ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of this paper.This work is supported by the National Natural Science ...
doi:10.1145/2351316.2351325
dblp:conf/kdd/ZengWW12
fatcat:njhkucpffnc4jikyewnmxezysm
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation
2010
SIAM Journal on Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than 2 from each other. ...
Parallel speedup is achieved through graph partitioning, speculative (iterative) coloring, and a bulk synchronous parallel-like organization of parallel computation. ...
We thank the anonymous referees for their valuable comments, which helped us improve the presentation of this paper. ...
doi:10.1137/080732158
fatcat:eukswuqoyzfdpcdfq5b6gbnxhi
Incrementalization of graph partitioning algorithms
2020
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Given a (vertex-cut or edge-cut) partition C(G) of a graph G and updates ∆G to G, it is to compute changes ∆O to C(G), yielding a partition of the updated graph such that (a) the new partition is load-balanced ...
Given graph G, updates ∆G to G and a partition A(G) of G by A, A∆ computes changes ∆O to A(G) such that (1) applying ∆O to A(G) produces a new partition of the updated graph although it may not be exactly ...
As an extension of the greedy graph growing method [26] for bi-partitioning, it computes the k-way partitions directly. ...
doi:10.14778/3389133.3389142
fatcat:itwgevngkfcalng2zn6vf7wlci
Parallel hypergraph partitioning for scientific computing
2006
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. ...
We present a parallel software package for hypergraph (and sparse matrix) partitioning developed at Sandia National Labs. The algorithm is a variation on multilevel partitioning. ...
Acknowledgments We thank Bruce Hendrickson for his advice and guidance in this project, and Robert Preis for his help developing a serial partitioner that preceded the present work. ...
doi:10.1109/ipdps.2006.1639359
dblp:conf/ipps/DevineBHBC06
fatcat:n62wwusbjje5rh57iwfvjr42eq
« Previous
Showing results 1 — 15 out of 7,072 results