Tools for regularizing Array Designs

This paper makes a contribution in bridging the theory and practice of the polyhedral model for designing parallel algorithms. Although the theory of polyhedral model is well developed, designers of massively parallel algorithms are unable to benefit from the theory due to the lack of software tools that incorporate the wide range of transformations that are possible in the model. The Uniformization tool that we developed was the first to integrate a number of techniques and to completely automate the transformation step allowing designers to explore a wide range of feasible designs from high-level specifications.

Towards self-ware via swarm-array computing

The work reported in this paper proposes Swarm-Array computing, a novel technique inspired by swarm robotics, and built on the foundations of autonomic and parallel computing. The approach aims to apply autonomic computing constructs to parallel computing systems and in effect achieve the self-ware objectives that describe self-managing systems. The constitution of swarm-array computing comprising four constituents, namely the computing system, the problem/task, the swarm and the landscape is considered. Approaches that bind these constituents together are proposed. Space applications employing FPGAs are identified as a potential area for applying swarm-array computing for building reliable systems. The feasibility of a proposed approach is validated on the SeSAm multi-agent simulator and landscapes are generated using the MATLAB toolkit.

Achieving intelligent agents and its feasibility in swarm-array computing

The work reported in this paper proposes ‘Intelligent Agents’, a Swarm-Array computing approach focused to apply autonomic computing concepts to parallel computing systems and build reliable systems for space applications. Swarm-array computing is a robotics a swarm robotics inspired novel computing approach considered as a path to achieve autonomy in parallel computing systems. In the intelligent agent approach, a task to be executed on parallel computing cores is considered as a swarm of autonomous agents. A task is carried to a computing core by carrier agents and can be seamlessly transferred between cores in the event of a predicted failure, thereby achieving self-* objectives of autonomic computing. The approach is validated on a multi-agent simulator.

Fast and accurate SCFT calculations for periodic block-copolymer morphologies using the spectral method with Anderson mixing

We study the numerical efficiency of solving the self-consistent field theory (SCFT) for periodic block-copolymer morphologies by combining the spectral method with Anderson mixing. Using AB diblock-copolymer melts as an example, we demonstrate that this approach can be orders of magnitude faster than competing methods, permitting precise calculations with relatively little computational cost. Moreover, our results raise significant doubts that the gyroid (G) phase extends to infinite $\chi N$. With the increased precision, we are also able to resolve subtle free-energy differences, allowing us to investigate the layer stacking in the perforated-lamellar (PL) phase and the lattice arrangement of the close-packed spherical (S$_{cp}$) phase. Furthermore, our study sheds light on the existence of the newly discovered Fddd (O$^{70}$) morphology, showing that conformational asymmetry has a significant effect on its stability.

Melt brushes of diblock copolymer

Using self-consistent field theory (SCFT), we investigate the morphologies formed by a melt brush of AB diblock copolymers grafted to a flat substrate by their B ends. In addition to a laterally uniform morphology, SCFT predicts three ordered morphologies exhibiting different periodic patterns at the air surface: a hexagonal array of A-rich dots, an alternating sequence of A- and B-rich stripes, and a hexagonal pattern of B-rich dots. When the phase diagram of the tethered film is plotted as a function of A/B incompatibility, $\chi N$, and diblock composition, $f$, it resembles the bulk phase diagram with the periodic phases converging to a mean-field critical point at weak segregation. The periodic-phase region in the phase diagram shrinks with increasing grafting density and expands when the air surface acquires an affinity for the grafted B blocks.

On a class of non-self-adjoint periodic eigenproblems with boundary and interior singularities

We prove that all the eigenvalues of a certain highly non-self-adjoint Sturm–Liouville differential operator are real. The results presented are motivated by and extend those recently found by various authors (Benilov et al. (2003) [3], Davies (2007) [7] and Weir (2008) [18]) on the stability of a model describing small oscillations of a thin layer of fluid inside a rotating cylinder.

On a class of nonselfadjoint periodic boundary value problems with discrete real spectrum

In a previous paper (J. of Differential Equations, Vol. 249 (2010), 3081-3098) we examined a family of periodic Sturm-Liouville problems with boundary and interior singularities which are highly non-self-adjoint but have only real eigenvalues. We now establish Schatten class properties of the associated resolvent operator.

Uniformization tool for systolic array designs

The paper is concerned with the uniformization of a system of affine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). We present and implement an automatic system to achieve uniformization of systems of affine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations.

Exploring carrier agents in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried onto a computing core by carrier agents that can seamlessly transfer between processing cores in the event of a predicted failure. The cognitive capabilities of the carrier agents on a parallel processing core serves in achieving the self-ware objectives of autonomic computing, hence applying autonomic computing concepts for the benefit of parallel computing systems. The feasibility of the proposed approach is validated by simulation studies using a multi-agent simulator on an FPGA (Field-Programmable Gate Array) and experimental studies using MPI (Message Passing Interface) on a computer cluster. Preliminary results confirm that applying autonomic computing principles to parallel computing systems is beneficial.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Steady periodic water waves with constant vorticity: regularity and local bifurcation

This paper studies periodic traveling gravity waves at the free surface of water in a flow of constant vorticity over a flat bed. Using conformal mappings the free-boundary problem is transformed into a quasilinear pseudodifferential equation for a periodic function of one variable. The new formulation leads to a regularity result and, by use of bifurcation theory, to the existence of waves of small amplitude even in the presence of stagnation points in the flow.

Infrared filters for space-flight focal plane array applications

Infrared filters and coatings have been employed on many sensing radiometer instruments to measure the thermal emission profiles and concentrations of certian chemical constituents found in planetary atmospheres. The High Resolution Dynamics Limb Sounder ( HIRDLS) is an example of the most recent developments in limb-viewing radiometry by employing a cooled focal plane detector array to provide simultaneous multi-channel monitoring of emission from gas and aerosols over an altitude range between 8 - 70 km. The use of spectrally selective cooled detectors in focal plane arrays has simplified the optical layout of radiometers, greatly reducing the number of components in the optical train. this has inevitably led to increased demands for the enviromnetal durability of the focal plane filters because of the need to cut sub-millimeter sizes, whilst maintaining an optimal spectral performance. Additionally the remaining refractive optical elements require antireflection coatings which must cover the entire spectral range of the focal plane array channels, in this case 6 to 18µm, with a minimum of reflection and absorption. This paper describes the optical layout and spectral design requirements for filteriong in the HIRDLS instrument, and reports progress on the manufacturing and testing of the sub-millimetre sized cooled filters. We also report on the spectral and environmental performance of prototype wideband antireflection coatings which satisfy the requirements above.