• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Fast shared-memory streaming multilevel graph partitioning

      Thumbnail
      Embargo Lift Date: 2022-08-12
      View / Download
      1.0 Mb
      Author(s)
      Jafari, N.
      Selvitopi, O.
      Aykanat, Cevdet
      Date
      2020-09-12
      Source Title
      Journal of Parallel and Distributed Computing
      Print ISSN
      0743-7315
      Electronic ISSN
      1096-0848
      Publisher
      Elsevier
      Volume
      147
      Pages
      140 - 151
      Language
      English
      Type
      Article
      Item Usage Stats
      48
      views
      2
      downloads
      Abstract
      A fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved algorithms and the most successful methods in this category belong to the multilevel approaches. In this work, we assess the feasibility of using streaming graph partitioning algorithms within the multilevel framework. Our end goal is to come up with a fast parallel offline multilevel partitioner that can produce competitive cutsize quality. We rely on a simple but fast and flexible streaming algorithm throughout the entire multilevel framework. This streaming algorithm serves multiple purposes in the partitioning process: a clustering algorithm in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Its simple nature also lends itself easily for parallelization. The experiments on various graphs show that our approach is on the average up to 5.1x faster than the multi-threaded MeTiS, which comes at the expense of only 2x worse cutsize.
      Keywords
      Streaming algorithms
      Graph partitioning
      Multilevel graph partitioning
      Parallel graph partitioning
      Permalink
      http://hdl.handle.net/11693/77618
      Published Version (Please cite this version)
      https://doi.org/10.1016/j.jpdc.2020.09.004
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy