Browsing by Subject "Partitioning algorithms"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Graph and hypergraph partitioning
    (1993) Daşdan, Ali
    Graph and hypergraph partitioning have many important applications in various areas such as VLSI layout, mapping, and graph theory. For graph and hypergraph partitioning, there are very successful heuristics mainly based on Kernighan-Lin’s minimization technique. We propose two novel approaches for multiple-way graph and hypergraph partitioning. The proposed algorithms drastically outperform the best multiple-way partitioning algorithm both on randomly generated graph instances and on benchmark circuits. The proposed algorithms convey all the advantages of the algorithms based on KernighanLin’s minimization technique such as their robustness. However, they do not convey many disadvantages of those algorithms such as their poor performance on sparse test cases. The proposed algorithms introduce very interesting ideas that are also applicable to the existing algorithms without very much effort.
  • Thumbnail Image
    ItemOpen Access
    Scalable parallelization of the sparse-approximate-inverse (SAl) preconditioner for the solution of large-scale integral-equation problems
    (IEEE, 2009-06) Malas, Tahir; Gürel, Levent
    In this paper, we consider efficient parallelization of the sparse approximate inverse (SAI) preconditioner in the context of the multilevel fast multipole algorithm (MLFMA). Then, we report the use of SAI in the solution of very large EFIE problems. The SAI preconditioner is important not only because it is a robust preconditioner that renders many difficult and large problems solvable, but also it can be utilized for the construction of more effective preconditioners.