• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations (1998)

Cached

  • Download as a PDF

Download Links

  • [www.cs.washington.edu]
  • [www.masters.donntu.edu.ua]
  • [masters.donntu.edu.ua]
  • [www.cs.washington.edu]
  • [masters.donntu.edu.ua]
  • [homes.cs.washington.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bradford L. Chamberlain
Citations:20 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Chamberlain98graphpartitioning,
    author = {Bradford L. Chamberlain},
    title = {Graph Partitioning Algorithms for Distributing Workloads of Parallel Computations},
    institution = {},
    year = {1998}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on the problem of distributing workloads for parallel computations. Geometric, structural, and refinementbased algorithms are described and contrasted. In addition, multilevel partitioning techniques and issues related to parallel partitioning are addressed. All algorithms are evaluated qualitatively in terms of their execution speed and ability to generate partitions with small separators. 1 Introduction In its most general form, the graph partitioning problem asks how best to divide a graph's vertices into a specified number of subsets such that: (i) the number of vertices per subset is equal and (ii) the number of edges straddling the subsets is minimized. Graph partitioning has several important applications in Computer Science, including VLSI circuit layout [8], image processing [43], solving sparse linear systems, computing fill-reducing orderings for sparse matrices, and distribu...

Keyphrases

parallel computation    distributing workload    graph partitioning algorithm    graph partitioning    several important application    parallel computing    image processing    execution speed    specified number    sparse linear system    fill-reducing ordering    computer science    general form    small separator    vlsi circuit layout    sparse matrix   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University