A Study of Several Matrix-Clustering Vertical Partitioning Algorithms in a Disk-Based Environment

2017 ◽  
pp. 163-177 ◽  
Author(s):  
Viacheslav Galaktionov ◽  
George Chernishev ◽  
Kirill Smirnov ◽  
Boris Novikov ◽  
Dmitry A. Grigoriev
Keyword(s):  
Vertical Partitioning ◽  
Partitioning Algorithms

Vertical partitioning algorithms for database design

1984 ◽  
Vol 9 (4) ◽  
pp. 680-710 ◽  
Author(s):  
Shamkant Navathe ◽  
Stefano Ceri ◽  
Gio Wiederhold ◽  
Jinglie Dou
Keyword(s):  
Database Design ◽  
Vertical Partitioning ◽  
Partitioning Algorithms

scholarly journals Vertical partitioning of CO2 production within a temperate forest soil

2007 ◽  
Vol 13 (4) ◽  
pp. 922-922 ◽  
Author(s):  
ERIC A. DAVIDSON ◽  
KATHLEEN E. SAVAGE ◽  
SUSAN E. TRUMBORE ◽  
WERNER BORKEN
Keyword(s):  
Forest Soil ◽  
Temperate Forest ◽  
Co2 Production ◽  
Vertical Partitioning

Vertical partitioning of nitrogen-loss processes across the oxic-anoxic interface of an oceanic oxygen minimum zone

2013 ◽  
Vol 16 (10) ◽  
pp. 3041-3054 ◽  
Author(s):  
Loreto De Brabandere ◽  
Don E. Canfield ◽  
Tage Dalsgaard ◽  
Gernot E. Friederich ◽  
Niels Peter Revsbech ◽  
...  
Keyword(s):  
Nitrogen Loss ◽  
Oxygen Minimum Zone ◽  
Vertical Partitioning ◽  
Minimum Zone ◽  
Oxygen Minimum

scholarly journals A Contraction-based Ratio-cut Partitioning Algorithm

VLSI Design ◽  
2002 ◽  
Vol 15 (2) ◽  
pp. 485-489
Author(s):  
Youssef Saab
Keyword(s):  
Linear Time ◽  
Fundamental Problem ◽  
Cluster Formation ◽  
Vlsi Circuits ◽  
Iterative Improvement ◽  
Partitioning Algorithm ◽  
Partitioning Algorithms ◽  
Simple Ratio ◽  
Iterative Partitioning

Partitioning is a fundamental problem in the design of VLSI circuits. In recent years, ratio-cut partitioning has received attention due to its tendency to partition circuits into their natural clusters. Node contraction has also been shown to enhance the performance of iterative partitioning algorithms. This paper describes a new simple ratio-cut partitioning algorithm using node contraction. This new algorithm combines iterative improvement with progressive cluster formation. Under suitably mild assumptions, the new algorithm runs in linear time. It is also shown that the new algorithm compares favorably with previous approaches.

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.

Sign in / Sign up

Export Citation Format

Share Document