Parallel dynamic graph-partitioning for unstructured meshes

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 algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

A multilevel algorithm for force-directed graph drawing

We describe a heuristic method for drawing graphs which uses a multilevel technique combined with a force-directed placement algorithm. The multilevel process groups vertices to form clusters, uses the clusters to define a new graph and is repeated until the graph size falls below some threshold. The coarsest graph is then given an initial layout and the layout is successively refined on all the graphs starting with the coarsest and ending with the original. In this way the multilevel algorithm both accelerates and gives a more global quality to the force- directed placement. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on a number of examples ranging from 500 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 30 seconds for a 10,000 vertex graph to around 10 minutes for the largest graph. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

A multilevel algorithm for force-directed graph-drawing

We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated recursively to create a hierarchy of increasingly coarse graphs, G0, G1, …, GL. The coarsest graph, GL, is then given an initial layout and the layout is refined and extended to all the graphs starting with the coarsest and ending with the original. At each successive change of level, l, the initial layout for Gl is taken from its coarser and smaller child graph, Gl+1, and refined using force-directed placement. In this way the multilevel framework both accelerates and appears to give a more global quality to the drawing. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on examples ranging in size from 10 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 12 seconds for a 10,000 vertex graph to around 5-7 minutes for the largest graphs. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

A combined evolutionary search and multilevel optimisation approach to graph-partitioning

The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.

JOSTLE: multilevel graph partitioning software: an overview

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, partitioning in parallel. Since its first release in 1995, JOSTLE has been used for many mesh-based parallel scientific computing applications and so we also outline some enhancements such as multiphase mesh-partitioning, heterogeneous mapping and partitioning to optimise subdomain shape

A critical examination of node-similarity based graph matching algorithms

In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.

Measuring similarity of software designs using graph matching for CBR

This paper examines different ways of measuring similarity between software design models for Case Based Reasoning (CBR) to facilitate reuse of software design and code. The paper considers structural and behavioural aspects of similarity between software design models. Similarity metrics for comparing static class structures are defined and discussed. A Graph representation of UML class diagrams and corresponding similarity measures for UML class diagrams are defined. A full search graph matching algorithm for measuring structural similarity diagrams based on the identification of the Maximum Common Sub-graph (MCS) is presented. Finally, a simple evaluation of the approach is presented and discussed.

Scalable and efficient graph colouring in 3 dimensions using emergence engineering principles

This paper describes ways in which emergence engineering principles can be applied to the development of distributed applications. A distributed solution to the graph-colouring problem is used as a vehicle to illustrate some novel techniques. Each node acts autonomously to colour itself based only on its local view of its neighbourhood, and following a simple set of carefully tuned rules. Randomness breaks symmetry and thus enhances stability. The algorithm has been developed to enable self-configuration in wireless sensor networks, and to reflect real-world configurations the algorithm operates with 3 dimensional topologies (reflecting the propagation of radio waves and the placement of sensors in buildings, bridge structures etc.). The algorithm’s performance is evaluated and results presented. It is shown to be simultaneously highly stable and scalable whilst achieving low convergence times. The use of eavesdropping gives rise to low interaction complexity and high efficiency in terms of the communication overheads.

Trust, leadership and economic necessity in post-compulsory education

Trust is a complex concept that has increasingly been debated in academic research (Kramer and Tyler, 1996). Research on 'trust and leadership' (Caldwell and Hayes, 2007) has suggested, unsurprisingly, that leadership behaviours influence 'follower' perceptions of leaders' trustworthiness. The development of 'ethical stewardship' amongst leaders may foster high trust situations (Caldwell, Hayes, Karri and Bernal, 2008), yet studies on the erosion of teacher professionalism in UK post-compulsory education have highlighted the distrust that arguably accompanies 'new managerialism', performativity and surveillance within a climate of economic rationalisation established by recent deterministic skills-focused government agendas for education (Avis, 2003; Codd, 1999, Deem, 2004, DFES, 2006). Given the shift from community to commercialism identified by Collinson and Collinson (2005) in a global economic environment characterised by uncertainty and rapid change, trust is, simultaneously, increasingly important and progressively both more fragile and limited in a post compulsory education sector dominated by skills-based targets and inspection demands. Building on such prior studies, this conference paper reports on the analysis of findings from a 2007-8 funded research study on 'trust and leadership' carried out in post-compulsory education. The research project collected and analysed case study interview and survey data from the lifelong learning sector, including selected tertiary, further and higher education (FE and HE) institutions. We interviewed 18 UK respondents from HE and FE, including principals, middle managers, first line managers, lecturers and researchers, supplementing and cross-checking this with a small number of survey responses (11) on 'trust and leadership' and a larger number (241) of survey responses on more generalised leadership issues in post-compulsory education. A range of facilitators and enablers of trust and their relationship to leadership were identified and investigated. The research analysed the ways in which interviewees defined the concept of 'trust' and the extent to which they identified that trust was a mediating factor affecting leadership and organisational performance. Prior literature indicates that trust involves a psychological state in which, despite dependency, risk and vulnerability, trustors have some degree of confident expectation that trustees will behave in benevolent rather than detrimental ways. The project confirmed the views of prior researchers (Mayer, Davis and Schoorman, 1995) that, since trust inevitably involves potential betrayal, estimations of leadership 'trustworthiness' are based on followers' cognitive and affective perceptions of the reliability, competence, benevolence and reputation of leaders. During the course of the interviews it also became clear that some interviewees were being managed in more or less transaction-focused, performative, audit-dominated cultures in which trust was not regarded as particularly important: while 'cautious trust' existed, collegiality flourished only marginally in small teams. Economic necessity and survival were key factors influencing leadership and employee behaviours, while an increasing distance was reported between senior managers and their staff. The paper reflects on the nature of the public sector leadership and management environment in post-compulsory education reported by interviewees and survey respondents. Leadership behaviours to build trust are recommended, including effective communication, honesty, integrity, authenticity, reliability and openness. It was generally felt that building trust was difficult in an educational environment largely determined by economic necessity and performativity. Yet, despite this, the researchers did identify a number of examples of high trust leadership situations that are worthy of emulation.

Cross-cultural partnerships must talk to build trust

Academic partnerships bring knowledge and drive economic growth, but success depends on good communications that build trust, says Tim Gore.