Fault-tolerant and transactional mobile agent execution

Mobile agents constitute a computing paradigm of a more general nature than the widely used client/server computing paradigm. A mobile agent is essentially a computer program that acts autonomously on behalf of a user and travels through a network of heterogeneous machines. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at additional costs. These costs include, among others, the additional complexity of developing and managing mobile agent-based applications. This additional complexity comprises such issues as reliability. Before mobile agent technology can appear at the core of tomorrow's business applications, reliability mechanisms for mobile agents must be established. In this context, fault tolerance and transaction support are mechanisms of considerable importance. Various approaches to fault tolerance and transaction support exist. They have different strengths and weaknesses, and address different environments. Because of this variety, it is often difficult for the application programmer to choose the approach best suited to an application. This thesis introduces a classification of current approaches to fault-tolerant and transactional mobile agent execution. The classification, which focuses on algorithmic aspects, aims at structuring the field of fault-tolerant and transactional mobile agent execution and facilitates an understanding of the properties and weaknesses of particular approaches. In a distributed system, any software or hardware component may be subject to failures. A single failing component (e.g., agent or machine) may prevent the agent from proceeding with its execution. Worse yet, the current state of the agent and even its code may be lost. We say that the agent execution is blocked. For the agent owner, i.e., the person or application that has configured the agent, the agent does not return. To achieve fault-tolerance, the agent owner can try to detect the failure of the agent, and upon such an event launch a new agent. However, this requires the ability to correctly detect the crash of the agent, i.e., to distinguish between a failed agent and an agent that is delayed by slow processors or slow communication links. Unfortunately, this cannot be achieved in systems such as the Internet. An agent owner who tries to detect the failure of the agent thus cannot prevent the case in which the agent is mistakenly assumed to have crashed. In this case, launching a new agent leads to multiple executions of the agent, i.e., to the violation of the desired exactly-once property of agent execution. Although this may be acceptable for certain applications (e.g., applications whose operations do not have side-effects), others clearly forbid it. In this context, launching a new agent is a form of replication. In general, replication prevents blocking, but may lead to multiple executions of the agent, i.e., to a violation of the exactly-once execution property. This thesis presents an approach that ensures the exactly-once execution property using a simple principle: the mobile agent execution is modeled as a sequence of agreement problems. This model leads to an approach based on two well-known building blocks: consensus and reliable broadcast. We validate this approach with the implementation of FATOMAS, a Java-based FAult-TOlerant Mobile Agent System, and measure its overhead. Transactional mobile agents execute the mobile agent as a transaction. Assume, for instance, an agent whose task is to buy an airline ticket, book a hotel room, and rent a car at the flight destination. The agent owner naturally wants all three operations to succeed or none at all. Clearly, the rental car at the destination is of no use if no flight to the destination is available. On the other hand, the airline ticket may be useless if no rental car is available. The mobile agent's operations thus need to execute atomically, i.e., either all of them or none at all. Execution atomicity also needs to be ensured in the event of failures of hardware or software components. The approach presented in this thesis is non-blocking. A non-blocking transactional mobile agent execution has the important advantage that it can make progress despite failures. In a blocking transactional mobile agent execution, by contrast, progress is only possible when the failed component has recovered. Until then, the acquired locks generally cannot be freed. As no other transactional mobile agents can acquire the lock, overall system throughput is dramatically reduced. The present approach reuses the work on fault-tolerant mobile agent execution to prevent blocking. We have implemented the proposed approach and present the evaluation results

Five-year outcome in immune-mediated scleritis

Background: Immune-mediated scleritis is a rare condition, and the information on the clinical course and complications is scarce. The aim of this study was to identify prognostic factors, complications, and therapeutic effects in patients with immune-mediated scleritis. Methods: Patients with diagnosis of scleritis and a follow-up time of 5years were identified. Systemic disease, laboratory investigations, type of scleritis, disease activity, therapy, and complications were recorded. The study design was a retrospective, non-comparative, interventional case series. Results: Systemic disease was identified in 15 (37%) patients at presentation and in 18 (45%) after 5years. Rheumatoid arthritis (15%), granulomatosis with polyangiitis (7.5%), and polychondritis (7.5%) were the most predominant disorders. Persistent scleritis (>5years) was associated with systemic disease (66 vs. 6%; p < 0.05) and positive auto-antibodies (48 vs. 23%; p = 0.18). Control of ocular inflammation was achieved in 38 of 40 (95%). Prednisone (14 patients) and/or methotrexate (8) were the predominant drugs to control persistent disease. Complications included interstitial keratitis (2), inflammatory astigmatism (2), corneal melt (3), macular edema (6), and severe systemic disease (5). Conclusion: The presence of systemic disease and positive auto-antibodies are associated with persistent scleritis. Immunosuppressive agents allow control of scleritis, but may contribute to severe systemic complications

Developmental Trajectories of Letter and Speech Sound Integration During Reading Acquisition

Reading acquisition in alphabetic languages starts with learning the associations between speech sounds and letters. This learning process is related to crucial developmental changes of brain regions that serve visual, auditory, multisensory integration, and higher cognitive processes. Here, we studied the development of audiovisual processing and integration of letter-speech sound pairs with an audiovisual target detection functional MRI paradigm. Using a longitudinal approach, we tested children with varying reading outcomes before the start of reading acquisition (T1, 6.5 yo), in first grade (T2, 7.5 yo), and in second grade (T3, 8.5 yo). Early audiovisual integration effects were characterized by higher activation for incongruent than congruent letter-speech sound pairs in the inferior frontal gyrus and ventral occipitotemporal cortex. Audiovisual processing in the left superior temporal gyrus significantly increased from the prereading (T1) to early reading stages (T2, T3). Region of interest analyses revealed that activation in left superior temporal gyrus (STG), inferior frontal gyrus and ventral occipitotemporal cortex increased in children with typical reading fluency skills, while poor readers did not show the same development in these regions. The incongruency effect bilaterally in parts of the STG and insular cortex at T1 was significantly associated with reading fluency skills at T3. These findings provide new insights into the development of the brain circuitry involved in audiovisual processing of letters, the building blocks of words, and reveal early markers of audiovisual integration that may be predictive of reading outcomes

Replicated Invocation

In today's systems, application are composed from various components that may be located on different machines. The components may have to collaborate in order to service a client request. More specifically, a client request to one component may trigger a request to another component. Moreover, to ensure fault-tolerance, components are generally replicated. This poses the problem of a replicated server invoking another replicated server. We call it the problem of replicated invocation. Replicated invocation has been considered in the context of deterministic servers. However, the problem is more difficult to address when servers are non-deterministic. In this context, work has been done to enforce deterministic execution. In the paper we consider a different approach. Instead of preventing non-deterministic execution of servers, we discuss how to handle it. The paper first discusses the problem of non-deterministic replicated invocation. Then the paper proposes a different solution to solve these problems

DRIFT: Efficient message ordering in ad hoc networks using virtual flooding

We present DRIFT --- a total order multicast algorithm for ad hoc networks with mobile or static nodes. Due to the ad hoc nature of the network, DRIFT uses flooding for message propagation. The key idea of DRIFT is virtual flooding --- a way of using unrelated message streams to propagate message causality information in order to accelerate message delivery. We describe DRIFT in detail. We evaluate its performance in a simulator and in a wireless sensor network. In both cases our results demonstrate that the performance of DRIFT exceeds that of the simple total order multicast algorithm designed for wired networks, on which it is based. In simulation at scale, for certain experiment settings, DRIFT achieved speedup of several orders of magnitude

Towards JMS-Compliant Group Communication

Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays confined to small niches and academic prototypes. In contrast, message-oriented middleware such as the Java Messaging Service (JMS) is widely used, and has become a de-facto standard. We believe that the lack of standard interfaces is the reason that hinders the deployment of group communication systems. Since JMS is well-established, an interesting solution is to map group communication primitives onto the JMS API. This requires to adapt the traditional specifications of group communication in order to take into account the features of JMS. The resulting group communication API, together with corresponding specifications, defines group communication primitives compatible with the JMS syntax and semantics

Towards JMS Compliant Group Communication - a Semantic Mapping

Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays confined to small niches and academic prototypes. In contrast, message-oriented middleware such as the Java Message Service (JMS) is widely used, and has become a de-facto standard. We believe that the lack of a well-defined and easily understandable standard is the reason that hinders the deployment of group communication systems. Since JMS is a well-established technology, an interesting solution is to extend JMS adding group communication primitives to it. Foremost, this requires to extend the traditional semantics of group communication in order to take into account various features of JMS, e.g., durable/non-durable subscriptions and persistent/non-persistent messages. The resulting new group communication specification, together with the corresponding API, defines group communication primitives compatible with JMS. As such, it facilitates the acceptance of group communication by a larger community and provides a powerful environment for building fault-tolerant applications

Visual Occipito-Temporal N1 Sensitivity to Digits Across Elementary School

Number processing abilities are important for academic and personal development. The course of initial specialization of ventral occipito-temporal cortex (vOTC) sensitivity to visual number processing is crucial for the acquisition of numeric and arithmetic skills. We examined the visual N1, the electrophysiological correlate of vOTC activation across five time points in kindergarten (T1, mean age 6.60 years), middle and end of first grade (T2, 7.38 years; T3, 7.68 years), second grade (T4, 8.28 years), and fifth grade (T5, 11.40 years). A combination of cross-sectional and longitudinal EEG data of a total of 62 children (35 female) at varying familial risk for dyslexia were available to form groups of 23, 22, 27, 27, and 42 participants for each of the five time points. The children performed a target detection task which included visual presentation of single digits (DIG), false fonts (FF), and letters (LET) to derive measures for coarse (DIG vs. FF) and fine (DIG vs. LET) digit sensitive processing across development. The N1 amplitude analyses indicated coarse and fine sensitivity characterized by a stronger N1 to digits than false fonts across all five time points, and stronger N1 to digits than letters at all but the second (T2) time point. In addition, lower arithmetic skills were associated with stronger coarse N1 digit sensitivity over the left hemisphere in second grade (T4), possibly reflecting allocation of more attentional resources or stronger reliance on the verbal system in children with poorer arithmetic skills. To summarize, our results show persistent visual N1 sensitivity to digits that is already present early on in pre-school and remains stable until fifth grade. This pattern of digit sensitivity development clearly differs from the relatively sharp rise and fall of the visual N1 sensitivity to words or letters between kindergarten and middle of elementary school and suggests unique developmental trajectories for visual processing of written characters that are relevant to numeracy and literacy