#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (14)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Jonathan E. Atkins, Erik G. Boman, Bruce Hendrickson
- SIAM J. Comput.
- 1998

In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire for each pair of elements to be near each other, find all… (More)

- Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Bruce Hendrickson, Courtenay T. Vaughan
- Computing in Science and Engineering
- 2002

movement, unstructured-communication, and memory usage difficulties that arise in dynamic applications such as adaptive finite-element methods, particle methods, and crash simulations. Zoltan’s data-structure-neutral design also lets a wide range of applications use it without imposing restrictions on application data structures. Its objectbased interface… (More)

- Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Rob H. Bisseling, Ümit V. Çatalyürek
- Proceedings 20th IEEE International Parallel…
- 2006

Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and can better represent nonsymmetric problems. Hypergraph partitioning is particularly suited to parallel sparse… (More)

- Erik G. Boman, Bruce Hendrickson
- SIAM J. Matrix Analysis Applications
- 2003

We present support theory, a set of techniques for bounding extreme eigenvalues and condition numbers for matrix pencils. Our intended application of support theory is to enable proving condition number bounds for preconditioners for symmetric, positive definite systems. One key feature sets our approach apart from most other works: We use support numbers… (More)

The design of general-purpose dynamic load-balancing tools for parallel applications is more challenging than the design of static partitioning tools. Both algorithmic and software engineering issues arise. We have addressed many of these issues in the design of the Zoltan dynamic load-balancing library. Zoltan has an object-oriented interface that makes it… (More)

- Karen D. Devine, Erik G. Boman, +5 authors Luis G. Gervasio
- 2004

Data partitioning and load balancing are important components of parallel computations. Many different partitioning strategies have been developed, with great effectiveness in parallel applications. But the load-balancing problem is not yet solved completely; new applications and architectures require new partitioning features. Existing algorithms must be… (More)

- Erik G. Boman, Ümit V. Çatalyürek, Cédric Chevalier, Karen D. Devine
- Scientific Programming
- 2012

Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs. The Zoltan toolkit was developed primarily for partitioning and load balancing to support dynamic parallel applications, but has expanded to support other problems in combinatorial scientific computing,… (More)

- Ümit V. Çatalyürek, Erik G. Boman, Karen D. Devine, Doruk Bozdag, Robert T. Heaphy, Lee Ann Riesen
- 2007 IEEE International Parallel and Distributed…
- 2007

Adaptive scientific computations require that periodic repartitioning (load balancing) occur dynamically to maintain load balance. Hypergraph partitioning is a successful model for minimizing communication volume in scientific computations, and partitioning software for the static case is widely available. In this paper, we present a new hypergraph model… (More)

- Ümit V. Çatalyürek, Erik G. Boman, Karen D. Devine, Doruk Bozdag, Robert T. Heaphy, Lee Ann Riesen
- J. Parallel Distrib. Comput.
- 2009

In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. To restore balance and to keep communication volume low in further iterations of the applications, dynamic load balancing (repartitioning) of the changed computational… (More)

- Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G. Boman, Arif M. Khan, Alex Pothen
- 2012 IEEE 26th International Parallel and…
- 2012

We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers. As computers with larger numbers of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent… (More)