Volumetric diffusers : pseudorandom cylinder arrays on a periodic lattice

Most conventional diffusers take the form of a surface based treatment, and as a result can only operate in hemispherical space. Placing a diffuser in the volume of a room might provide greater efficiency by allowing scattering into the whole space. A periodic cylinder array (or sonic crystal) produces periodicity lobes and uneven scattering. Introducing defects into an array, by removing or varying the size of some of the cylinders, can enhance their diffusing abilities. This paper applies number theoretic concepts to create cylinder arrays that have more even scattering. Predictions using a Boundary Element Method are compared to measurements to verify the model, and suitable metrics are adopted to evaluate performance. Arrangements with good aperiodic autocorrelation properties tend to produce the best results. At low frequency power is controlled by object size and at high frequency diffusion is dominated by lattice spacing and structural similarity. Consequently the operational bandwidth is rather small. By using sparse arrays and varying cylinder sizes, a wider bandwidth can be achieved

Randomized cache placement for eliminating conflicts

Applications with regular patterns of memory access can experience high levels of cache conflict misses. In shared-memory multiprocessors conflict misses can be increased significantly by the data transpositions required for parallelization. Techniques such as blocking which are introduced within a single thread to improve locality, can result in yet more conflict misses. The tension between minimizing cache conflicts and the other transformations needed for efficient parallelization leads to complex optimization problems for parallelizing compilers. This paper shows how the introduction of a pseudorandom element into the cache index function can effectively eliminate repetitive conflict misses and produce a cache where miss ratio depends solely on working set behavior. We examine the impact of pseudorandom cache indexing on processor cycle times and present practical solutions to some of the major implementation issues for this type of cache. Our conclusions are supported by simulations of a superscalar out-of-order processor executing the SPEC95 benchmarks, as well as from cache simulations of individual loop kernels to illustrate specific effects. We present measurements of instructions committed per cycle (IPC) when comparing the performance of different cache architectures on whole-program benchmarks such as the SPEC95 suite.Peer ReviewedPostprint (published version

Use of scanned detection in optical position encoders

Published versio