Intelligent agents: are they feasible 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.

Intelligent cores and intelligent agents: two approaches to achieve autonomy in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? How can autonomic computing approaches be extended towards building reliable systems? How can existing technologies be merged to provide a solution for self-managing systems? The work reported in this paper aims to answer these questions by proposing Swarm-Array Computing, a novel technique inspired from swarm robotics and built on the foundations of autonomic and parallel computing paradigms. Two approaches based on intelligent cores and intelligent agents are proposed to achieve autonomy in parallel computing systems. The feasibility of the proposed approaches is validated on a multi-agent simulator.

Building reliable systems for space applications using swarm-array computing

Space applications demand the need for building reliable systems. Autonomic computing defines such reliable systems as self-managing systems. The work reported in this paper combines agent-based and swarm robotic approaches leading to swarm-array computing, a novel technique to achieve self-managing distributed parallel computing systems. Two swarm-array computing approaches based on swarms of computational resources and swarms of tasks are explored. FPGA is considered as the computing system. The feasibility of the two proposed approaches that binds the computing system and the task together is simulated on the SeSAm multi-agent simulator.

Building reliable systems for space applications using swarm-array computing

Space applications demand the need for building reliable systems. Autonomic computing defines such reliable systems as self-managing systems. The work reported in this paper combines agent-based and swarm robotic approaches leading to swarm-array computing, a novel technique to achieve self-managing distributed parallel computing systems. Two swarm-array computing approaches based on swarms of computational resources and swarms of tasks are explored. FPGA is considered as the computing system. The feasibility of the two proposed approaches that binds the computing system and the task together is simulated on the SeSAm multi-agent simulator.

Radio frequency energy harvesting in wireless sensor networks

As a vital factor affecting system cost and lifetime, energy consumption in wireless sensor networks (WSNs) has been paid much attention to. This article presents a new approach to making use of electromagnetic energy from useless radio frequency (RF) signals transmitted in WSNs, with a quantitative analysis showing its feasibility. A mechanism to harvest the energy either passively or actively is proposed.

Investigating the feasibility of a swarm-array computing approach

The work reported in this paper proposes a novel synergy between parallel computing and swarm robotics to offer a new computing paradigm, 'swarm-array computing' that can harness and apply autonomic computing for parallel computing systems. One approach among three proposed approaches in swarm-array computing based on landscapes of intelligent cores, in which the cores of a parallel computing system are abstracted to swarm agents, is investigated. A task is executed and transferred seamlessly between cores in the proposed approach thereby achieving self-ware properties that characterize autonomic computing. FPGAs are considered as an experimental platform taking into account its application in space robotics. The feasibility of the proposed approach is validated on the SeSAm multi-agent simulator.

An autonomic approach in swarm-array computing

Can autonomic computing concepts be applied to traditional multi-core systems found in high performance computing environments? In this paper, we propose a novel synergy between parallel computing and swarm robotics to offer a new computing paradigm, `Swarm-Array Computing' that can harness and apply autonomic computing for parallel computing systems. One approach among three proposed approaches in swarm-array computing based on landscapes of intelligent cores, in which the cores of a parallel computing system are abstracted to swarm agents, is investigated. A task gets executed and transferred seamlessly between cores in the proposed approach thereby achieving self-ware properties that characterize autonomic computing. FPGAs are considered as an experimental platform taking into account its application in space robotics. The feasibility of the proposed approach is validated on the SeSAm multi-agent simulator.

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.

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.

Ribose 2′-O-methylation provides a molecular signature for the distinction of self and non-self mRNA dependent on the RNA sensor Mda5

The 5'-cap-structures of higher eukaryote mRNAs are ribose 2'-O-methylated. Likewise, a number of viruses replicating in the cytoplasm of eukayotes have evolved 2'-O-methyltransferases to modify autonomously their mRNAs. However, a defined biological role of mRNA 2'-O-methylation remains elusive. Here we show that viral mRNA 2'-O-methylation is critically involved in subversion of type-I-interferon (IFN-I) induction. We demonstrate that human and murine coronavirus 2'-O-methyltransferase mutants induce increased IFN-I expression, and are highly IFN-I sensitive. Importantly, IFN-I induction by 2'-O-methyltransferase-deficient viruses is dependent on the cytoplasmic RNA sensor melanoma differentiation-associated gene 5 (MDA5). This link between MDA5-mediated sensing of viral RNA and mRNA 2'-O-methylation suggests that RNA modifications, such as 2'-O-methylation, provide a molecular signature for the discrimination of self and non-self mRNA.

Differential recognition of Staphylococcus aureus quorum-sensing signals depends on both extracellular loops 1 and 2 of the transmembrane sensor AgrC.

Virulence in Staphylococcus aureus is regulated via agr-dependent quorum sensing in which an autoinducing peptide (AIP) activates AgrC, a histidine protein kinase. AIPs are usually thiolactones containing seven to nine amino acid residues in which the thiol of the central cysteine is linked to the alpha-carboxyl of the C-terminal amino acid residue. The staphylococcal agr locus has diverged such that the AIPs of the four different S. aureus agr groups self-activate but cross-inhibit. Consequently, although the agr system is conserved among the staphylococci, it has undergone significant evolutionary divergence whereby to retain functionality, any changes in the AIP-encoding gene (agrD) that modifies AIP structure must be accompanied by corresponding changes in the AgrC receptor. Since AIP-1 and AIP-4 only differ by a single amino acid, we compared the transmembrane topology of AgrC1 and AgrC4 to identify amino acid residues involved in AIP recognition. As only two of the three predicted extracellular loops exhibited amino acid differences, site-specific mutagenesis was used to exchange the key AgrC1 and AgrC4 amino acid residues in each loop either singly or in combination. A novel lux-based agrP3 reporter gene fusion was constructed to evaluate the response of the mutated AgrC receptors. The data obtained revealed that while differential recognition of AIP-1 and AIP-4 depends primarily on three amino acid residues in loop 2, loop 1 is essential for receptor activation by the cognate AIP. Furthermore, a single mutation in the AgrC1 loop 2 resulted in conversion of (Ala5)AIP-1 from a potent antagonist to an activator, essentially resulting in the forced evolution of a new AIP group. Taken together, our data indicate that loop 2 constitutes the predicted hydrophobic pocket that binds the AIP thiolactone ring while the exocyclic amino acid tail interacts with loop 1 to facilitate receptor activation.