A Significance-Driven Programming Framework for Energy-Constrained Approximate Computing

Approximate execution is a viable technique for energy-con\-strained environments, provided that applications have the mechanisms to produce outputs of the highest possible quality within the given energy budget.
We introduce a framework for energy-constrained execution with controlled and graceful quality loss. A simple programming model allows users to express the relative importance of computations for the quality of the end result, as well as minimum quality requirements. The significance-aware runtime system uses an application-specific analytical energy model to identify the degree of concurrency and approximation that maximizes quality while meeting user-specified energy constraints. Evaluation on a dual-socket 8-core server shows that the proposed
framework predicts the optimal configuration with high accuracy, enabling energy-constrained executions that result in significantly higher quality compared to loop perforation, a compiler approximation technique.

A Programming Model and Runtime System for Significance-Aware Energy-Efficient Computing.

We introduce a task-based programming model and runtime system that exploit the observation that not all parts of a program are equally significant for the accuracy of the end-result, in order to trade off the quality of program outputs for increased energy-efficiency. This is done in a structured and flexible way, allowing for easy exploitation of different points in the quality/energy space, without adversely affecting application performance. The runtime system can apply a number of different policies to decide whether it will execute less-significant tasks accurately or approximately.

The experimental evaluation indicates that our system can achieve an energy reduction of up to 83% compared with a fully accurate execution and up to 35% compared with an approximate version employing loop perforation. At the same time, our approach always results in graceful quality degradation.

Computing lower and upper expectations under epistemic independence

This paper investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic independence. New algorithms, based on multilinear programming, are presented, both for independence among events and among random variables. Separation properties of graphical models are also investigated.

Pool Evolution: A Parallel Pattern for Evolutionary and Symbolic Computing

We introduce a new parallel pattern derived from a specific application domain and show how it turns out to have application beyond its domain of origin. The pool evolution pattern models the parallel evolution of a population subject to mutations and evolving in such a way that a given fitness function is optimized. The pattern has been demonstrated to be suitable for capturing and modeling the parallel patterns underpinning various evolutionary algorithms, as well as other parallel patterns typical of symbolic computation. In this paper we introduce the pattern, we discuss its implementation on modern multi/many core architectures and finally present experimental results obtained with FastFlow and Erlang implementations to assess its feasibility and scalability.

A predatory patchwork:membrane and surface structures of Bdellovibrio bacteriovorus

Predatory Bdellovibrio bacteriovorus bacteria are remarkable in that they attach to, penetrate and digest other Gram-negative bacteria, living and replicating within them until all resources are exhausted, when they escape the prey ghost to invade fresh prey. Remarkable remodeling of both predator and prey cell occurs during this process to allow the Bdellovibrio to exploit the intracellular niche they have worked so hard to enter, keeping the prey "bdelloplast" intact until the end of predatory growth. If one views motile non-predatory bacteria in a light microscope, one is immediately struck by how rare it is for bacteria to collide. This highlights how the cell surface of Bdellovibrio must be specialized and adapted to allow productive collisions and further to allow entry into the prey periplasm and subsequent secretion of hydrolytic enzymes to digest it. Bdellovibrio can, however, also be made to grow artificially without prey; thus, they have a large genome containing both predatory genes and genes for saprophytic heterotrophic growth. Thus, the membrane and outer surface layers are a patchwork of proteins encompassing not only those that have a sole purpose in heterotrophic growth but also many more that are specialized or employed to attach to, enter, remodel, kill and ultimately digest prey cells. There is much that is as yet not understood, but molecular genetic and post-genomic approaches to microbial physiology have enhanced the pioneering biochemical work of four decades ago in characterizing some of the key events and surface protein requirements for prey attack.