Skewed graph partitioning

Conference · Fri Jan 31 23:00:00 EST 1997

OSTI ID:448061

Hendrickson, B; Leland, R ^[1]; Van Driessche, R ^[2]

---

1. Sandia National Labs., Albuquerque, NM (United States)
2. Alcatel Telecom, Antwerp (Belgium)

Graph partitioning is an important abstraction used in solving many scientific computing problems. Unfortunately, the standard partitioning model does not incorporate considerations that are important in many settings. We address this by describing a generalized partitioning model which incorporates the notion of partition skew and is applicable to a variety of problems. We then develop enhancements to several important partitioning algorithms necessary to solve the generalized partitioning problem. Finally we demonstrate the benefit of employing several of these generalized methods to static decomposition of parallel computing problems.

• Research Organization: Sandia National Labs., Albuquerque, NM (United States)
• Sponsoring Organization: USDOE Office of Energy Research, Washington, DC (United States)
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 448061
• Report Number(s): SAND--97-0217C; CONF-970342--2; ON: DE97002645
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPUTER CALCULATIONS
DIAGRAMS
PARALLEL PROCESSING
PARTITION