Automatic parallel code generation for message passing on distributed memory systems

The availability of a very accurate dependence graph for a scalar code is the basis for the automatic generation of an efficient parallel implementation. The strategy for this task which is encapsulated in a comprehensive data partitioning code generation algorithm is described. This algorithm involves the data partition, calculation of assignment ranges for partitioned arrays, addition of a comprehensive set of execution control masks, altering loop limits, addition and optimisation of communications for all data. In this context, the development and implementation of strategies to merge communications wherever possible has proved an important feature in producing efficient parallel implementations for numerical mesh based codes. The code generation strategies described here are embedded within the Computer Aided Parallelisation tools (CAPTools) software as a key part of a toolkit for automating as much as possible of the parallelisation process for mesh based numerical codes. The algorithms used enables parallelisation of real computational mechanics codes with only minor user interaction and without any prior manual customisation of the serial code to suit the parallelisation tool.

A scalable strategy for the parallelization of multiphysics unstructured mesh-iterative codes on distributed-memory systems

Realizing scalable performance on high performance computing systems is not straightforward for single-phenomenon codes (such as computational fluid dynamics [CFD]). This task is magnified considerably when the target software involves the interactions of a range of phenomena that have distinctive solution procedures involving different discretization methods. The problems of addressing the key issues of retaining data integrity and the ordering of the calculation procedures are significant. A strategy for parallelizing this multiphysics family of codes is described for software exploiting finite-volume discretization methods on unstructured meshes using iterative solution procedures. A mesh partitioning-based SPMD approach is used. However, since different variables use distinct discretization schemes, this means that distinct partitions are required; techniques for addressing this issue are described using the mesh-partitioning tool, JOSTLE. In this contribution, the strategy is tested for a variety of test cases under a wide range of conditions (e.g., problem size, number of processors, asynchronous / synchronous communications, etc.) using a variety of strategies for mapping the mesh partition onto the processor topology.

The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in-house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block-structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.

CAPLib - A 'thin layer' message passing library to support computational mechanics codes on distributed memory parallel systems

The Computer Aided Parallelisation Tools (CAPTools) [Ierotheou, C, Johnson SP, Cross M, Leggett PF, Computer aided parallelisation tools (CAPTools)-conceptual overview and performance on the parallelisation of structured mesh codes, Parallel Computing, 1996;22:163±195] is a set of interactive tools aimed to provide automatic parallelisation of serial FORTRAN Computational Mechanics (CM) programs. CAPTools analyses the user's serial code and then through stages of array partitioning, mask and communication calculation, generates parallel SPMD (Single Program Multiple Data) messages passing FORTRAN. The parallel code generated by CAPTools contains calls to a collection of routines that form the CAPTools communications Library (CAPLib). The library provides a portable layer and user friendly abstraction over the underlying parallel environment. CAPLib contains optimised message passing routines for data exchange between parallel processes and other utility routines for parallel execution control, initialisation and debugging. By compiling and linking with different implementations of the library, the user is able to run on many different parallel environments. Even with today's parallel systems the concept of a single version of a parallel application code is more of an aspiration than a reality. However for CM codes the data partitioning SPMD paradigm requires a relatively small set of message-passing communication calls. This set can be implemented as an intermediate `thin layer' library of message-passing calls that enables the parallel code (especially that generated automatically by a parallelisation tool such as CAPTools) to be as generic as possible. CAPLib is just such a `thin layer' message passing library that supports parallel CM codes, by mapping generic calls onto machine specific libraries (such as CRAY SHMEM) and portable general purpose libraries (such as PVM an MPI). This paper describe CAPLib together with its three perceived advantages over other routes: - as a high level abstraction, it is both easy to understand (especially when generated automatically by tools) and to implement by hand, for the CM community (who are not generally parallel computing specialists); - the one parallel version of the application code is truly generic and portable; - the parallel application can readily utilise whatever message passing libraries on a given machine yield optimum performance.

The Shared Memory Parallelisation of an Ocean Modelling Code using an Interactive Parallelisation Toolkit

This paper briefly describes an interactive parallelisation toolkit that can be used to generate parallel code suitable for either a distributed memory system (using message passing) or a shared memory system (using OpenMP). This study focuses on how the toolkit is used to parallelise a complex heterogeneous ocean modelling code within a few hours for use on a shared memory parallel system. The generated parallel code is essentially the serial code with OpenMP directives added to express the parallelism. The results show that substantial gains in performance can be achieved over the single thread version with very little effort.

Parallel mesh partitioning on distributed memory systems

The problem of deriving parallel mesh partitioning algorithms for mapping unstructured meshes to parallel computers is discussed in this chapter. In itself this raises a paradox - we seek to find a high quality partition of the mesh, but to compute it in parallel we require a partition of the mesh. In fact, we overcome this difficulty by deriving an optimisation strategy which can find a high quality partition even if the quality of the initial partition is very poor and then use a crude distribution scheme for the initial partition. The basis of this strategy is to use a multilevel approach combined with local refinement algorithms. Three such refinement algorithms are outlined and some example results presented which show that they can produce very high global quality partitions, very rapidly. The results are also compared with a similar multilevel serial partitioner and shown to be almost identical in quality. Finally we consider the impact of the initial partition on the results and demonstrate that the final partition quality is, modulo a certain amount of noise, independent of the initial partition.

[Book review] "Memory and Suggestibility in the Forensic Interview"

Book review of: Eisen, M.L., Quas, J.A. & Goodman, G.S. (Eds.) (2002). Memory and suggestibility in the forensic interview. Mahwah, NJ: Lawrence Erlbaum Associates. ISBN: 0-8058-3080-4/$55.00 Special Prepaid Price

A new poetics of exile and belonging: the place of memory in the new media environment

This paper explores how new media environments represent and create collective memories of trauma; how creative digital practice can be a key methodology for memory studies and the potential of digital interfaces for representing and reconciling collective memories of trauma, particularly in the context of Cyprus. My project MemoryBank will be used as a model to discuss the potential role of creative digital media practice in both community arts and the formal education process in order to enable participants to engage with the process of peace and reconciliation in Cyprus and circumvent and negotiate politically ossified collective memory narratives and chauvinistic histories. [From the Author]

Venus infers

These poems mark the fault lines of myth, dream and memory, of a doubled identity emerging from the clash of war, desire and the cacophony of the city. 1974/Dead Sister , a narrative poem with a cast that includes Lewis Carroll’s Alice, Freud’s Dora, the Lady of Shalott, Ophelia, Esther, female cowboys and other deposed goddesses is ‘an autobiography’ of an imaginary dead twin. Alev Adil delineates the traces of a sense of displacement, but while the poems mark those frenetic uncertainties and erasures they celebrate the plenitude of new stories, epistemologies and possibilities born out of falling into fracture (the fracture of memory, gender, identity, culture) more than they mourn any loss. Venus Infers is haunted by the deities of ancient Greek myths and their contemporary manifestations. Eurydice is hiding out in Hackney, sometimes glimpsed on the Jubilee Line; Ariadne remembers her ancient palace as she prowls the endless corridors of a London hotel; Penelope still waits for peace in the ruins of Marash/Varosha. Cyprus often features in these poems, both as a landscape for myth and as a site for contemporary, and contested, memories. [From the Author]

Reality-experiential history documentaries: the Trench (BBC, 2002) and Britain's modern memory of the First World War

Culloden (BBC, 1964) The Great War (BBC, 1964) 1914-18 (BBC/KCET, 1996) Haig: the Unknown Soldier (BBC, 1996) Veterans: the Last Survivors of the Great War (BBC, 1998) 1900s House (Channel 4, 1999) The Western Front (BBC, 1999) History of Britain (BBC, 2000) 1940s House (Channel 4, 2001) The Ship (BBC, 2002) Surviving the Iron Age (BBC, 2001) The Trench (BBC, 2002) Frontier House (Channel 4, 2002) Lad's Army (BBC, 2002) Edwardian Country House (Channel 4, 2002) Spitfire Ace (Channel 4, 2003) World War One in Colour (Channel 5, 2003) 1914: the War Revolution (BBC, 2003) The First World War (Channel 4, 2003) Dunkirk (BBC, 2004) Dunkirk: The Soldier's Story (BBC, 2004) D-Day to Berlin (BBC, 2004) Bad Lad's Army (ITV, 2004) Destination D-Day: Raw Recruits (BBC, 2004) Bomber Crew (Channel 4, 2004) Battlefield Britain (BBC, 2004) The Last Battle (ARTE/ZDF, 2005) Who Do You Think You Are? (BBC, 2004, 2006) The Somme (Channel 4, 2005) [From the Publisher]

Nine traces in a circle

Nine contemporary stories set in a border town that capture the modern Greek psyche with sharp realism and often a satirical, humorous mood. [From the Author]