scholarly journals Hypergraph Partitioning for Faster Parallel PageRank Computation

2005 ◽  
pp. 155-171 ◽  
Author(s):  
Jeremy T. Bradley ◽  
Douglas V. de Jager ◽  
William J. Knottenbelt ◽  
Aleksandar Trifunović
Keyword(s):  
Hypergraph Partitioning

scholarly journals Pair Wise Swapping Based Hypergraph Partitioning Algorithms for VLSI Design

2019 ◽  
Vol 8 (2) ◽  
pp. 5589-5593
Keyword(s):  
Integrated Circuit ◽  
Digital Camera ◽  
Vlsi Design ◽  
Electronic Systems ◽  
Circuit Partitioning ◽  
Computing Device ◽  
Hypergraph Partitioning ◽  
Vlsi Physical Design ◽  
Portable Computing ◽  
Partitioning Algorithms

A VLSI integrated circuit is the most significant part of electronic systems such as personal computer or workstation, digital camera, cell phone or a portable computing device, and automobile. So development within the field of electronic space depends on the design planning of VLSI integrated circuit. Circuit partitioning is most important step in VLSI physical design process. Many heuristic partitioning algorithms are proposed for this problem. The first heuristic algorithm for hypergraph partitioning in the domain of VLSI is FM algorithm. In this paper, I have proposed three variations of FM algorithm by utilizing pair insightful swapping strategies. I have played out a relative investigation of FM and my proposed algorithms utilizing two datasets for example ISPD98 and ISPD99. Test results demonstrate that my proposed calculations outflank the FM algorithm.

Fragment Re-Allocation Strategy Based on Hypergraph for NoSQL Database Systems

2016 ◽  
Vol 8 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Zhikun Chen ◽  
Shuqiang Yang ◽  
Yunfei Shang ◽  
Yong Liu ◽  
Feng Wang ◽  
...  
Keyword(s):  
Database Systems ◽  
Communication Cost ◽  
Allocation Strategy ◽  
Hypergraph Partitioning ◽  
Computing Model ◽  
Operation Pattern ◽  
Nosql Database ◽  
High Scalability ◽  
Weighted Hypergraph ◽  
Allocation Strategies

NoSQL database is famed for the characteristics of high scalability, high availability, and high fault-tolerance. It is used to manage data for a lot of applications. The computing model has been transferred to “computing close to data”. Therefore, the location of fragment directly affects system's performance. Every site's load dynamical changes because of the increasing data and the ever-changing operation pattern. So system has to re-allocate fragment to improve system's performance. The general fragment re-allocation strategies of NoSQL database scatter the related fragments as possible to improve the operations' parallel degree. But those fragments may interact with each other in some application's operations. So the high parallel degree of operation may increase system's communication cost such as data are transferred by network. In this paper, the authors propose a fragment re-allocation strategy based on hypergraph. This strategy uses a weighted hypergraph to represent the fragments' access pattern of operations. A hypergraph partitioning algorithm is used to cluster fragments in the strategy. This strategy can improve system's performance according to reducing the communication cost while guaranteeing the parallel degree of operations. Experimental results confirm that the strategy will effectively contribute in solving fragment re-allocation problem in specific application environment of NoSQL database system, and it can improve system's performance.

scholarly journals Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication

2016 ◽  
Vol 3 (3) ◽  
pp. 1-34 ◽  
Author(s):  
Grey Ballard ◽  
Alex Druinsky ◽  
Nicholas Knight ◽  
Oded Schwartz
Keyword(s):  
Sparse Matrix ◽  
Matrix Multiplication ◽  
Hypergraph Partitioning

scholarly journals k-way Hypergraph Partitioning via n-Level Recursive Bisection

2015 ◽  
Author(s):  
Sebastian Schlag ◽  
Vitali Henne ◽  
Tobias Heuer ◽  
Henning Meyerhenke ◽  
Peter Sanders ◽  
...  
Keyword(s):  
Hypergraph Partitioning ◽  
N Level
Sign in / Sign up

Export Citation Format

Share Document