22,821 research outputs found
Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms
We introduce a new programming language for expressing reversibility,
Energy-Efficient Language (Eel), geared toward algorithm design and
implementation. Eel is the first language to take advantage of a partially
reversible computation model, where programs can be composed of both reversible
and irreversible operations. In this model, irreversible operations cost energy
for every bit of information created or destroyed. To handle programs of
varying degrees of reversibility, Eel supports a log stack to automatically
trade energy costs for space costs, and introduces many powerful control logic
operators including protected conditional, general conditional, protected
loops, and general loops. In this paper, we present the design and compiler for
the three language levels of Eel along with an interpreter to simulate and
annotate incurred energy costs of a program.Comment: 17 pages, 0 additional figures, pre-print to be published in The 8th
Conference on Reversible Computing (RC2016
Using Automatic Differentiation for Adjoint CFD Code Development
This paper addresses the concerns of CFD code developers who are facing the task of creating a discrete adjoint CFD code for design optimisation. It discusses how the development of such a code can be greatly eased through the selective use of Automatic Differentiation, and how the software development can be subjected to a sequence of checks to ensure the correctness of the final software
Polly's Polyhedral Scheduling in the Presence of Reductions
The polyhedral model provides a powerful mathematical abstraction to enable
effective optimization of loop nests with respect to a given optimization goal,
e.g., exploiting parallelism. Unexploited reduction properties are a frequent
reason for polyhedral optimizers to assume parallelism prohibiting dependences.
To our knowledge, no polyhedral loop optimizer available in any production
compiler provides support for reductions. In this paper, we show that
leveraging the parallelism of reductions can lead to a significant performance
increase. We give a precise, dependence based, definition of reductions and
discuss ways to extend polyhedral optimization to exploit the associativity and
commutativity of reduction computations. We have implemented a
reduction-enabled scheduling approach in the Polly polyhedral optimizer and
evaluate it on the standard Polybench 3.2 benchmark suite. We were able to
detect and model all 52 arithmetic reductions and achieve speedups up to
2.21 on a quad core machine by exploiting the multidimensional
reduction in the BiCG benchmark.Comment: Presented at the IMPACT15 worksho
Anyonic interferometry and protected memories in atomic spin lattices
Strongly correlated quantum systems can exhibit exotic behavior called
topological order which is characterized by non-local correlations that depend
on the system topology. Such systems can exhibit remarkable phenomena such as
quasi-particles with anyonic statistics and have been proposed as candidates
for naturally fault-tolerant quantum computation. Despite these remarkable
properties, anyons have never been observed in nature directly. Here we
describe how to unambiguously detect and characterize such states in recently
proposed spin lattice realizations using ultra-cold atoms or molecules trapped
in an optical lattice. We propose an experimentally feasible technique to
access non-local degrees of freedom by performing global operations on trapped
spins mediated by an optical cavity mode. We show how to reliably read and
write topologically protected quantum memory using an atomic or photonic qubit.
Furthermore, our technique can be used to probe statistics and dynamics of
anyonic excitations.Comment: 14 pages, 6 figure
Analysis of strong-interaction dynamic stall for laminar flow on airfoils
A compressible Navier-Stokes solution procedure is applied to the flow about an isolated airfoil. Two major problem areas were investigated. The first area is that of developing a coordinate system and an initial step in this direction has been taken. An airfoil coordinate system obtained from specification of discrete data points developed and the heat conduction equation has been solved in this system. Efforts required to allow the Navier-Stokes equations to be solved in this system are discussed. The second problem area is that of obtaining flow field solutions. Solutions for the flow about a circular cylinder and an isolated airfoil are presented. In the former case, the prediction is shown to be in good agreement with data
- …