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.

A cluster computing implementation of a Monte Carlo simulation of a particle growth mechanism

Clusters of computers can be used together to provide a powerful computing resource. Large Monte Carlo simulations, such as those used to model particle growth, are computationally intensive and take considerable time to execute on conventional workstations. By spreading the work of the simulation across a cluster of computers, the elapsed execution time can be greatly reduced. Thus a user has apparently the performance of a supercomputer by using the spare cycles on other workstations.

Application of interpolymer complexation to coat solid and soft surfaces

Water-soluble polymers are often capable of forming interpolymer complexes in solutions and at interfaces, which offers an excellent opportunity for surface modification. The complex formation may be driven by H-bonding between poly(carboxylic acids) and non-ionic polymers or by electrostatic attraction between oppositely-charged polyelectrolytes. In the present communication the following applications of interpolymer complexation in coating technologies will be considered: (1) Complexation between poly(acrylic acid) and non-ionic polymers via H-bonding was used to coat glass surfaces. It was realised using layer-by-layer deposition of IPC on glass surfaces with subsequent cross-linking of dry multilayers by thermal treatment. Depending on the glass surface functionality this complexation resulted in detachable and non-detachable hydrogel films; (2) Electrostatic layer-by-layer self-assembly between glycol chitosan and bovine serum albumin (BSA) was used to coat magnetic nanoparticles. It was demonstrated that the native structure of BSA remains unaffected by the self-assembling process.

Goal-refinement appraisal of soft projects (GRASP)

Industrial projects are often complex and burdened with time pressures and a lack of information. The term 'soft-project' used here stands for projects where the ‘what’ and/or the ‘how’ is uncertain, which is often the experience in projects involving software intensive systems developments. This thesis intertwines the disciplines of project management and requirements engineering in a goal-oriented application of the maxim ‘keep all objectives satisfied’. It thus proposes a method for appraising projects. In this method, a goal-oriented analysis establishes a framework with which expert judgements are collected so as to construct a confidence profile in regard to the feasibility and adequacy of the project's planned outputs. It is hoped that this appraisal method will contribute to the activities of project ‘shaping’ and aligning stakeholders’ expectations whilst helping project managers appreciate what parts of their project can be progressed and what parts should be held pending further analysis. This thesis offers the following original contribution: an appreciation of appraisal in the project context; a goal-oriented confidence profiling technique; and: a technique to produce goal-refinement diagrams – referred to as Goal Sketching. Collectively these amount to a method for the ‘Goal Refinement Appraisal of Soft-Projects’ (GRASP). The validity of the GRASP method is shown for two projects. In the first it is used for shaping a business investigation project. This is done in real-time in the project. The second case is a retrospective study of an enterprise IT project. This case tests the effectiveness of forecasting project difficulty from an initial confidence profile.

The chaos machine: analogue computing rediscovered (1)

Analogue computers provide actual rather than virtual representations of model systems. They are powerful and engaging computing machines that are cheap and simple to build. This two-part Retronics article helps you build (and understand!) your own analogue computer to simulate the Lorenz butterfly that's become iconic for Chaos theory.