Numerical ‘health check’ for scientific codes: the CADNA approach

Scientific computation has unavoidable approximations built into its very fabric. One important source of error that is difficult to detect and control is round-off error propagation which originates from the use of finite precision arithmetic. We propose that there is a need to perform regular numerical `health checks' on scientific codes in order to detect the cancerous effect of round-off error propagation. This is particularly important in scientific codes that are built on legacy software. We advocate the use of the CADNA library as a suitable numerical screening tool. We present a case study to illustrate the practical use of CADNA in scientific codes that are of interest to the Computer Physics Communications readership. In doing so we hope to stimulate a greater awareness of round-off error propagation and present a practical means by which it can be analyzed and managed.

Cloud Benchmarking For Maximising Performance of Scientific Applications

How can applications be deployed on the cloud to achieve maximum performance? This question is challenging to address with the availability of a wide variety of cloud Virtual Machines (VMs) with different performance capabilities. The research reported in this paper addresses the above question by proposing a six step benchmarking methodology in which a user provides a set of weights that indicate how important memory, local communication, computation and storage related operations are to an application. The user can either provide a set of four abstract weights or eight fine grain weights based on the knowledge of the application. The weights along with benchmarking data collected from the cloud are used to generate a set of two rankings - one based only on the performance of the VMs and the other takes both performance and costs into account. The rankings are validated on three case study applications using two validation techniques. The case studies on a set of experimental VMs highlight that maximum performance can be achieved by the three top ranked VMs and maximum performance in a cost-effective manner is achieved by at least one of the top three ranked VMs produced by the methodology.

Outposts of Empire: Scientific Discovery and Colonial Displacement in Gaskell's Wives and Daughters

This article offers a fresh consideration of Elizabeth Gaskell's unfinished Wives and Daughters (1864–6), in terms of what this metropolitan novelist knew about contemporary scientific debates and imperial exploration of Africa, and how her familiarity with these discourses was incorporated into her imaginative work. Her focus for these two related themes is the naturalist Roger Hamley, whose character and exploits are meant to parallel those of the young Charles Darwin. Roger's direct involvement in the historical Geoffroy–Cuvier debate allows Gaskell to offer a sophisticated examination of how discussions about evolutionary biology (about which she learned from personal acquaintances and printed sources) contributed to political and social change in the era of the first Reform Bill. Roger's subsequent journey to Abyssinia to gather specimens allows Gaskell to form a link between science and imperial exploration, which demonstrates how, when carried to its conclusion, the development of classificatory knowledge systems was never innocent; rather, it facilitated colonial exploitation and intervention, which allowed for the ‘opening up of Africa’. Gaskell's pronouncements about science in the novel are far more explicit than her brief references to empire; the article ponders why this should be so, and offers some suggestions about how her reliance on imaginative and discursive constructs concerning the ‘Dark Continent’ may be interpreted as tacit complicity with the imperial project, or at least an interest in its more imaginative aspects.

BSP -Style Computation: A Semantic Investigation

A BSP (Bulk Synchronous Parallelism) computation is characterized by the generation of asynchronous messages in packages during independent execution of a number of processes and their subsequent delivery at synchronization points. Bundling messages together represents a significant departure from the traditional ‘one communication at a time’ approach. In this paper the semantic consequences of communication packaging are explored. In particular, the BSP communication structure is identified with a general form of substitution—predicate substitution. Predicate substitution provides a means of reasoning about the synchronized delivery of asynchronous communications when the immediate programming context does not explicitly refer to the variables that are to be updated (unlike traditional operations, such as the assignment $x := e$, where the names of the updated variables can be extracted from the context). Proofs of implementations of Newton's root finding method and prefix sum are used to illustrate the practical application of the proposed approach.

Efficient quantum computation using coherent states

We study universal quantum computation using optical coherent states. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.