Filters








6,456 Hits in 4.2 sec

Factorization-Based Graph Repartitionings [chapter]

Kateřina Jurková, Miroslav Tůma
2010 Lecture Notes in Computer Science  
The paper deals with the parallel computation of matrix factorization using graph partitioning-based domain decomposition.  ...  In this paper we propose to enhance the iterative strategy for balancing the decompositions from [13] by graph-theoretical tools. We propose the whole framework for the graph repartitioning.  ...  Framework for the graph-based repartitioning In this section we will split the problem of repartitioning into several simpler tasks.  ... 
doi:10.1007/978-3-642-12535-5_92 fatcat:xyoiayjaongshil2rsgay6ttqa

A Unified Algorithm for Load-balancing Adaptive Scientific Simulations

K. Schloegel, G. Karypis, V. Kumar
2000 ACM/IEEE SC 2000 Conference (SC'00)  
The repartitionings should be computed so as to minimize both the inter-processor communications incurred during the iterative mesh-based computation and the data redistribution costs required to balance  ...  We show that the Unified Repartitioning Algorithm is able to reduce the precise overheads associated with repartitioning as well as or better than other repartitioning schemes for a variety of problems  ...  of scratch-remap and diffusion-based repartitioning schemes.  ... 
doi:10.1109/sc.2000.10035 dblp:conf/sc/SchloegelKK00 fatcat:s3pi3ldtwvgwdkb3yvfp2f5fi4

Dynamic load-balancing with variable number of processors based on graph repartitioning

Clement Vuchener, Aurelien Esnard
2012 2012 19th International Conference on High Performance Computing  
In this paper, we present a new graph repartitioning algorithm which accepts to dynamically change the number of processors, assuming the load is already balanced.  ...  This algorithm is based on a theoretical result, that constructs optimal communication patterns with both a minimum migration volume and a minimum number of communications.  ...  We briefly review the most popular methods based on graph (or hypergraph) repartitioning techniques.  ... 
doi:10.1109/hipc.2012.6507501 dblp:conf/hipc/VuchenerE12 fatcat:x4fgmwaxbjhgnnktcj2k6kmldy

Optimizing equijoin queries in distributed databases where relations are hash partitioned

Dennis Shasha, Tsong-Li Wang
1991 ACM Transactions on Database Systems  
We study the optimization problem that arises when the query processor must repartition the relations and intermediate results participating in a multijoin query.  ...  Using estimates of the sizes of intermediate relations, we show (1) optimum solutions for closed chain queries; (2) the NP-completeness of the optimization problem for star, tree, and general graph queries  ...  Figure 12 shows the application of algorithm HKH to the query graph in Figure 9 . Notice also that algorithm PH deteriorates significantly as the selectivity factors increase.  ... 
doi:10.1145/114325.103713 fatcat:lkgrmnrm4zarjc4sbkgjw7aqdq

Dynamic Repartitioning of Adaptively Refined Meshes

K. Schloegel, G. Karypis, V. Kumar
1998 Proceedings of the IEEE/ACM SC98 Conference  
On the other hand, diffusion-based schemes work well for slightly imbalanced graphs and for those in which imbalance occurs globally throughout the graph.  ...  Recently, parallel multilevel graph repartitioning techniques have been developed that can quickly compute high-quality repartitions for adaptive and dynamic meshes while minimizing the amount of data  ...  Recently, repartitioning schemes were presented based on both of these strategies [1, 9, 11, 10, 12, 13, 14] .  ... 
doi:10.1109/sc.1998.10025 dblp:conf/sc/SchloegelKK98 fatcat:4bpvwto5cbcutgozjlgbnqukia

Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes

Kirk Schloegel, George Karypis, Vipin Kumar
1997 Journal of Parallel and Distributed Computing  
If this new graph is partitioned from scratch, it may lead to an excessive migration of data among processors.  ...  Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance.  ...  In this paper, we present repartitioning algorithms based upon multilevel diffusion.  ... 
doi:10.1006/jpdc.1997.1410 fatcat:x3e4pha4ufc23obhsokrfkkbye

Wavefront diffusion and LMSR: algorithms for dynamic repartitioning of adaptive meshes

K. Schloegel, G. Karypis, V. Kumar
2001 IEEE Transactions on Parallel and Distributed Systems  
For example, both are capable of repartitioning a seven million vertex graph in under three seconds on 128 processors of a Cray T3E.  ...  Our schemes obtained relative speedups of between nine and 12 when the number of processors was increased by a factor of 16 on a Cray T3E.  ...  Our Contributions This paper focuses on areas of improvement for scratchremap and diffusion-based repartitioning schemes.  ... 
doi:10.1109/71.926167 fatcat:htjbzpe2trhjzdpexqgum2lwai

A distributed multi-GPU system for fast graph processing

Zhihao Jia, Yongkee Kwon, Galen Shipman, Pat McCormick, Mattan Erez, Alex Aiken
2017 Proceedings of the VLDB Endowment  
We present Lux, a distributed multi-GPU system that achieves fast graph processing by exploiting the aggregate memory bandwidth of multiple GPUs and taking advantage of locality in the memory hierarchy  ...  A dynamic graph repartitioning mechanism achieves good load balancing among multiple GPUs, while the performance model provides insight into improving Lux's performance.  ...  Lux provides two execution models that are beneficial for different graph applications.  ... 
doi:10.14778/3157794.3157799 fatcat:zug24lgxfzda3ccqllnzmraqbm

Partitioning dynamic graph asynchronously with distributed FENNEL

Zhan Shi, Junhao Li, Pengfei Guo, Shuangshuang Li, Dan Feng, Yi Su
2017 Future generations computer systems  
Social networks are large graphs that require multiple graph database servers to store and manage them.  ...  In contrast to the existing repartitioning algorithms, our lightweight repartitioner is e cient, making it suitable for use in a real system.  ...  e↵ective method to dynamically repartition the graph using only local views.  ... 
doi:10.1016/j.future.2017.01.014 fatcat:gjeipjig6fbsbm4b364ibwhxli

A repartitioning hypergraph model for dynamic load balancing

Umit V. Catalyurek, Erik G. Boman, Karen D. Devine, Doruk Bozdağ, Robert T. Heaphy, Lee Ann Riesen
2009 Journal of Parallel and Distributed Computing  
Use of a hypergraph-based model allows us to accurately model communication costs rather than approximate them with graph-based models.  ...  The results show that, in terms of reducing total cost, our new model compares favorably to the graph-based dynamic load balancing approaches, and multilevel approaches improve the repartitioning quality  ...  than the graph-based repartitioning.  ... 
doi:10.1016/j.jpdc.2009.04.011 fatcat:ogrycndn3rhsrgoxrkzfkpkuf4

Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion

Henning Meyerhenke
2009 2009 15th International Conference on Parallel and Distributed Systems  
State-of-the-art libraries for this problem are based on graph repartitioning.  ...  They demonstrate the applicability and high quality of DIBAP for load balancing by repartitioning.  ...  In the field of graph-based image segmentation similar arguments based on the isoperimetric constant are used to find well-shaped segments [24] . III.  ... 
doi:10.1109/icpads.2009.114 dblp:conf/icpads/Meyerhenke09 fatcat:cf4fwyzhhzdpvmdi3sbhjovayy

Workload-aware incremental repartitioning of shared-nothing distributed databases for scalable OLTP applications

Joarder Kamal, Manzur Murshed, Rajkumar Buyya
2016 Future generations computer systems  
The k-way min-cut graph clustering based database repartitioning algorithms can be used to reduce the number of DTs with acceptable level of load balancing.  ...  In each repartitioning cycle, DT profile is learnt online and k-way min-cut clustering algorithm is applied on a special sub-graph representing all DTs as well as those non-DTs that have at least one tuple  ...  Transaction Generation Model In order to evaluate the performance of the proposed graph min-cut based repartitioning algorithms, we need to be careful to avoid any undue influence of the external graph  ... 
doi:10.1016/j.future.2015.09.024 fatcat:zggcctuadjhuvbjjnticreqjri

LogGP

Ning Xu, Lei Chen, Bin Cui
2014 Proceedings of the VLDB Endowment  
Moreover, LogGP can dynamically repartition the massive graphs in accordance with the structural changes.  ...  In this paper, we present LogGP, a log-based graph partitioning system that records, analyzes and reuses the historical statistical information to refine the partitioning result.  ...  The traditional graph partitioning algorithms target at minimizing edge cuts not the running time, and thus ignore these factors.  ... 
doi:10.14778/2733085.2733097 fatcat:cmxl6rr5xffqxk75zx4agws6gu

iGiraph: A Cost-Efficient Framework for Processing Large-Scale Graphs on Public Clouds

Safiollah Heidari, Rodrigo N. Calheiros, Rajkumar Buyya
2016 2016 16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)  
In this paper, we present iGiraph, a cost-efficient Pregel-like graph processing framework for processing large-scale graphs on public clouds. iGiraph uses a new dynamic re-partitioning approach based  ...  Many graph processing frameworks have been developed to process these large graphs since Google introduced its graph processing framework called Pregel in 2010.  ...  On the other hand, some frameworks such as GPS use dynamic repartitioning approach that allows them to repartition the graph multiple times during the computation based on some pre-defined features to  ... 
doi:10.1109/ccgrid.2016.38 dblp:conf/ccgrid/HeidariCB16 fatcat:kz54nadl25bqxknff2535gk7oe

A Multi-Objective Partition Method for Marine Sensor Networks Based on Degree of Event Correlation

Dongmei Huang, Chenyixuan Xu, Danfeng Zhao, Wei Song, Qi He
2017 Sensors  
marine sensor network as a graph.  ...  In this study, in order to provide a fast data retrieval service for a marine sensor network, we use all the marine sensors as the vertices, establish the edge based on marine events, and abstract the  ...  Thirdly, we constructed the various operators for AB-Graph based on NSGA-II and partition the AB-Graph.  ... 
doi:10.3390/s17102168 pmid:28934126 pmcid:PMC5677375 fatcat:p5bscamx7jcl3fea7tnpaxswdu
« Previous Showing results 1 — 15 out of 6,456 results