#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1976

2013

- This year (0)
- Last 5 years (5)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Chris Walshaw, Mark Cross
- SIAM J. Scientific Computing
- 2000

Multilevel algorithms are a successful class of optimisation techniqueswhich address themeshpartitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality… (More)

- Chris Walshaw, Mark Cross, Martin G. Everett
- J. Parallel Distrib. Comput.
- 1997

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the… (More)

- Alan J. Soper, Chris Walshaw, Mark Cross
- J. Global Optimization
- 2004

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the… (More)

- Chris Walshaw, Mark Cross
- Parallel Computing
- 2000

Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the problem to a set of independent problems in interface regions. Alternating optimisation is restriction of this technique in which mesh entities are only allowed to migrate between… (More)

- Chris Walshaw, Mark Cross, Martin G. Everett
- PPSC
- 1997

A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refinedmeshes indicate that the algorithmprovides partitions of an equivalent or… (More)

- Chris Walshaw, Mark Cross
- Future Generation Comp. Syst.
- 2001

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used… (More)

- Chris Walshaw, Mark Cross, Martin G. Everett
- IJHPCA
- 1995

- Cos S. Ierotheou, S. P. Johnson, Mark Cross, P. F. Leggett
- Parallel Computing
- 1996

- Chris Walshaw, Mark Cross
- 2008

In this chapter we look at JOSTLE, the multilevel graph-partitioning software package, and highlight some of the key research issues that it addresses. We first outline the core algorithms and place it in the context of the multilevel refinement paradigm. We then look at issues relating to its use as a tool for parallel processing and, in particular,… (More)

- S. P. Johnson, Cos S. Ierotheou, Mark Cross
- Parallel Computing
- 1996