Migration with local public goods and the gains from changing places

Without public goods and under fairly standard assumptions, in Hammond and Sempere (J Pub Econ Theory, 8: 145–170, 2006) we show that freeing migration enhances the potential Pareto gains from free trade. Here, we present a generalization allowing local public goods subject to congestion. Unlike the standard literature on fiscal externalities, our result relies on fixing both local public goods and congestion levels at their status quo values. This allows constrained efficient and potentially Pareto improving population exchanges regulated only through appropriate residence charges, which can be regarded as Pigouvian congestion taxes

The AFGL absolute gravity program

A brief discussion of the AFGL's (Air Force Geophysics Laboratory) program in absolute gravity is presented. Support of outside work and in-house studies relating to gravity instrumentation are discussed. A description of the current transportable system is included and the latest results are presented. These results show good agreement with measurements at the AFGL site by an Italian system. The accuracy obtained by the transportable apparatus is better than 0.1 microns sq sec 10 microgal and agreement with previous measurements is within the combined uncertainties of the measurements

Strings in gravity with torsion

A theory of gravitation in 4D is presented with strings used in the material action in $U_4$ spacetime. It is shown that the string naturally gives rise to torsion. It is also shown that the equation of motion a string follows from the Bianchi identity, gives the identical result as the Noether conservation laws, and follows a geodesic only in the lowest order approximation. In addition, the conservation laws show that strings naturally have spin, which arises not from their motion but from their one dimensional structure.Comment: 16 page

Establishing a support service for educational technology within a university

This paper covers some of the issues associated with the support of learning technology within an institution. It describes the activities of a working support service, and highlights approaches to some of the academic, technological, political and management issues that have helped it perform effectively over a four‐year period

WMTrace : a lightweight memory allocation tracker and analysis framework

The diverging gap between processor and memory performance has been a well discussed aspect of computer architecture literature for some years. The use of multi-core processor designs has, however, brought new problems to the design of memory architectures - increased core density without matched improvement in memory capacity is reduc- ing the available memory per parallel process. Multiple cores accessing memory simultaneously degrades performance as a result of resource con- tention for memory channels and physical DIMMs. These issues combine to ensure that memory remains an on-going challenge in the design of parallel algorithms which scale. In this paper we present WMTrace, a lightweight tool to trace and analyse memory allocation events in parallel applications. This tool is able to dynamically link to pre-existing application binaries requiring no source code modification or recompilation. A post-execution analysis stage enables in-depth analysis of traces to be performed allowing memory allocations to be analysed by time, size or function. The second half of this paper features a case study in which we apply WMTrace to five parallel scientific applications and benchmarks, demonstrating its effectiveness at recording high-water mark memory consumption as well as memory use per-function over time. An in-depth analysis is provided for an unstructured mesh benchmark which reveals significant memory allocation imbalance across its participating processes

An investigation of the performance portability of OpenCL

This paper reports on the development of an MPI/OpenCL implementation of LU, an application-level benchmark from the NAS Parallel Benchmark Suite. An account of the design decisions addressed during the development of this code is presented, demonstrating the importance of memory arrangement and work-item/work-group distribution strategies when applications are deployed on different device types. The resulting platform-agnostic, single source application is benchmarked on a number of different architectures, and is shown to be 1.3–1.5× slower than native FORTRAN 77 or CUDA implementations on a single node and 1.3–3.1× slower on multiple nodes. We also explore the potential performance gains of OpenCL’s device fissioning capability, demonstrating up to a 3× speed-up over our original OpenCL implementation

The generating function for a particular class of characters of SU(n)

We compute the generating function for the characters of the irreducible representations of SU(n) whose associated Young diagrams have only two rows with the same number of boxes. The result is a rational determinantal expression in which both the numerator and the denominator have a simple structure when expressed in terms of Schur polynomials.Comment: 7 pages, no figure

Parallelising wavefront applications on general-purpose GPU devices

Pipelined wavefront applications form a large portion of the high performance scientific computing workloads at supercomputing centres. This paper investigates the viability of graphics processing units (GPUs) for the acceleration of these codes, using NVIDIA's Compute Unified Device Architecture (CUDA). We identify the optimisations suitable for this new architecture and quantify the characteristics of those wavefront codes that are likely to experience speedups