A Comparison of Programming Models for Multiprocessors with Explicitly Managed Memory Hierarchies

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet speci?c enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The ?rst programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.

Deconstructing Victim and offender Identities in Discourses on Child Sexual Abuse: Hierarchies, Blame and the Good/Evil Dialectic

Contemporary social and political constructions of victimhood and offending behaviour lie at the heart of regulatory policies on child sexual abuse. Legislation is named after specific child victims of high profile cases, and a burgeoning range of pre-emptive measures are enacted to protect an amorphous class of ‘all potential victims’ from the risk sex offenders are seen as posing. Such policies are also heavily premised on the omnipresent predatory stranger. These constructed identities, however, are at odds with the actual identities of victims and offenders of such crimes. Drawing on a range of literatures, the core task of this article is to confront some of the complexities and tensions surrounding constructions of the victim/offender dyad within the specific context of sexual offending against children. In particular, the article argues that discourses on ‘blame’ – and the polarised notions of ‘innocence’ and ‘guilt’ – inform respective hierarchies of victimhood and offending concerning ‘legitimate’ victim and offender status. Based on these insights, the article argues for the need to move beyond such monochromatic understandings of victims and offenders of sexual crime and to reframe the politics of risk accordingly.

Scales and Hierarchies: A Cross-Disciplinary Perspective

The volume advances our understanding of the role of scales and hierarchies across the linguistic sciences. Although scales and hierarchies are widely assumed to play a role in the modelling of linguistic phenomena, their status remains controversial, and it is these controversies that the present volume tackles head-on.

Energy-Efficient In-Memory Data Stores on Hybrid Memory Hierarchies

Increasingly large amounts of data are stored in main memory of data center servers. However, DRAM-based memory is an important consumer of energy and is unlikely to scale in the future. Various byte-addressable non-volatile memory (NVM) technologies promise high density and near-zero static energy, however they suffer from increased latency and increased dynamic energy consumption.

This paper proposes to leverage a hybrid memory architecture, consisting of both DRAM and NVM, by novel, application-level data management policies that decide to place data on DRAM vs. NVM. We analyze modern column-oriented and key-value data stores and demonstrate the feasibility of application-level data management. Cycle-accurate simulation confirms that our methodology reduces the energy with least performance degradation as compared to the current state-of-the-art hardware or OS approaches. Moreover, we utilize our techniques to apportion DRAM and NVM memory sizes for these workloads.

Parasite mediated predation between native and invasive amphipods.

Parasites can structure biological communities directly through population regulation and indirectly by processes such as apparent competition. However, the role of parasites in the process of biological invasion is less well understood and mechanisms of parasite mediation of predation among hosts are unclear. Mutual predation between native and invading species is an important factor in determining the outcome of invasions in freshwater amphipod communities. Here, we show that parasites mediate mutual intraguild predation among native and invading species and may thereby facilitate the invasion process. We find that the native amphipod Gammarus duebeni celticus is host to a microsporidian parasite, Pleistophora sp. (new species), with a frequency of infection of 0-90%. However, the parasite does not infect three invading species, G. tigrinus, G. pulex and Crangonyx pseudogracilis. In field and laboratory manipulations, we show that the parasite exhibits cryptic virulence: the parasite does not affect host fitness in single-species populations, but virulence becomes apparent when the native and invading species interact. That is, infection has no direct effect on G. d. celticus survivorship, size or fecundity; however, in mixed-species experiments, parasitized natives show a reduced capacity to prey on the smaller invading species and are more likely to be preyed upon by the largest invading species. Thus, by altering dominance relationships and hierarchies of mutual predation, parasitism strongly influences, and has the potential to change, the outcome of biological invasions.

Integral completeness of locally convex spaces

A locally convex space X is said to be integrally complete if each continuous mapping f: [0, 1] --> X is Riemann integrable. A criterion for integral completeness is established. Readily verifiable sufficient conditions of integral completeness are proved.

How parasites affect interactions between competitors and predators

We present a synthesis of empirical and theoretical work investigating how parasites influence competitive and predatory interactions between other species. We examine the direct and indirect effects of parasitism and discuss examples of density and parasite-induced trait-mediated effects. Recent work reveals previously unrecognized complexity in parasite-mediated interactions. In addition to parasite-modified and apparent competition leading to species exclusion or enabling coexistence, parasites and predators interact in different ways to regulate or destablize the population dynamics of their joint prey. An emerging area is the impact of parasites on intraguild predation (IGP). Parasites can increase vulnerability of infected individuals to cannibalism or predation resulting in reversed species dominance in IGP hierarchies. We discuss the potential significance of parasites for community structure and biodiversity, in particular their role in promoting species exclusion or coexistence and the impact of emerging diseases. Ongoing invasions provide examples where parasites mediate native/invader interactions and play a key role in determining the outcome of invasions. We highlight the need for more quantitative data to assess the impact of parasites on communities, and the combination of theoretical and empirical studies to examine how the effects of parasitism scale up to community-level processes.

SoC memory hierarchy derivation from dataflow graphs

Hardware synthesis from dataflow graphs of signal processing systems is a growing research area as focus shifts to high level design methodologies. For data intensive systems, dataflow based synthesis can lead to an inefficient usage of memory due to the restrictive nature of synchronous dataflow and its inability to easily model data reuse. This paper explores how dataflow graph changes can be used to drive both the on-chip and off-chip memory organisation and how these memory architectures can be mapped to a hardware implementation. By exploiting the data reuse inherent to many image processing algorithms and by creating memory hierarchies, off-chip memory bandwidth can be reduced by a factor of a thousand from the original dataflow graph level specification of a motion estimation algorithm, with a minimal increase in memory size. This analysis is verified using results gathered from implementation of the motion estimation algorithm on a Xilinx Virtex-4 FPGA, where the delay between the memories and processing elements drops from 14.2 ns down to 1.878 ns through the refinement of the memory architecture. Care must be taken when modeling these algorithms however, as inefficiencies in these models can be easily translated into overuse of hardware resources.