Adaptive planning for distributed systems using goal accomplishment tracking

Goal accomplishment tracking is the process of monitoring the progress of a task or series of tasks towards completing a goal. Goal accomplishment tracking is used to monitor goal progress in a variety of domains, including workflow processing, teleoperation and industrial manufacturing. Practically, it involves the constant monitoring of task execution, analysis of this data to determine the task progress and notification of interested parties. This information is usually used in a passive way to observe goal progress. However, responding to this information may prevent goal failures. In addition, responding proactively in an opportunistic way can also lead to goals being completed faster. This paper proposes an architecture to support the adaptive planning of tasks for fault tolerance or opportunistic task execution based on goal accomplishment tracking. It argues that dramatically increased performance can be gained by monitoring task execution and altering plans dynamically

Toward Contention Analysis for Parallel Executing Real-Time Tasks

In measurement-based probabilistic timing analysis, the execution conditions imposed to tasks as measurement scenarios, have a strong impact to the worst-case execution time estimates. The scenarios and their effects on the task execution behavior have to be deeply investigated. The aim has to be to identify and to guarantee the scenarios that lead to the maximum measurements, i.e. the worst-case scenarios, and use them to assure the worst-case execution time estimates. We propose a contention analysis in order to identify the worst contentions that a task can suffer from concurrent executions. The work focuses on the interferences on shared resources (cache memories and memory buses) from parallel executions in multi-core real-time systems. Our approach consists of searching for possible task contenders for parallel executions, modeling their contentiousness, and classifying the measurement scenarios accordingly. We identify the most contentious ones and their worst-case effects on task execution times. The measurement-based probabilistic timing analysis is then used to verify the analysis proposed, qualify the scenarios with contentiousness, and compare them. A parallel execution simulator for multi-core real-time system is developed and used for validating our framework. The framework applies heuristics and assumptions that simplify the system behavior. It represents a first step for developing a complete approach which would be able to guarantee the worst-case behavior

Task-Related modulations of BOLD low-frequency fluctuations within the default mode Network

Spontaneous low-frequency Blood-Oxygenation Level-Dependent (BOLD) signals acquired during resting state are characterized by spatial patterns of synchronous fluctuations, ultimately leading to the identification of robust brain networks. The resting-state brain networks, including the Default Mode Network (DMN), are demonstrated to persist during sustained task execution, but the exact features of task-related changes of network properties are still not well characterized. In this work we sought to examine in a group of 20 healthy volunteers (age 33 ± 6 years, 8 F/12 M) the relationship between changes of spectral and spatiotemporal features of one prominent resting-state network, namely the DMN, during the continuous execution of a working memory n-back task. We found that task execution impacted on both functional connectivity and amplitude of BOLD fluctuations within large parts of the DMN, but these changes correlated between each other only in a small area of the posterior cingulate. We conclude that combined analysis of multiple parameters related to connectivity, and their changes during the transition from resting state to continuous task execution, can contribute to a better understanding of how brain networks rearrange themselves in response to a task

Analysis of checkpointing schemes for multiprocessor systems

Parallel computing systems provide hardware redundancy that helps to achieve low cost fault-tolerance, by duplicating the task into more than a single processor, and comparing the states of the processors at checkpoints. This paper suggests a novel technique, based on a Markov Reward Model (MRM), for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. Our analytical results match well the values we obtained using a simulation program. We compare the average task execution time and total work of four checkpointing schemes, and show that generally increasing the number of processors reduces the average execution time, but increases the total work done by the processors. However, in cases where there is a big difference between the time it takes to perform different operations, those results can change

Suppressing visual feedback in written composition: Effects on processing demands and coordination of the writing processes

The goal of this experiment was to investigate the role of visual feedback during written composition. Effects of suppression of visual feedback were analysed both on processing demands and on on-line coordination of low-level execution processes and of high-level conceptual and linguistic processes. Writers composed a text and copied it either with or without visual feedback. Processing demands of the writing processes were evaluated with reaction times to secondary auditory probes that were analysed according to whether participants were handwriting (in a composing and a copying tasks) or engaged in high level processes (when pausing in a composing task). Suppression of visual feedback increased reaction times interference (secondary reaction time minus baseline reaction time) during handwriting in the copying task and not during pauses in the composing task. This suggests that suppression of visual feedback affected processing demands of only execution processes and not those of high-level conceptual and linguistic processes. This is confirmed by analysis of quality of the texts produced by participants that were little, if any, affected by the suppression of visual feedback. Results also indicate that the increase in processing demands of execution related to suppression of visual feedback affected on-line coordination of the writing processes. Indeed, when visual feedback was suppressed, reaction time interferences associated to handwriting were not reliable different in the copying task and in the composing task but were significantly different in the composition task, RT interference associated to handwriting being lower in the copying task than in the composition task. When visual feedback was suppressed, writers activated step-by-step execution processes and high-level writing processes, whereas they concurrently activated these writing processes when composing with visual feedback

Grid Task Execution

IPG Execution Service is a framework that reliably executes complex jobs on a computational grid, and is part of the IPG service architecture designed to support location-independent computing. The new grid service enables users to describe the platform on which they need a job to run, which allows the service to locate the desired platform, configure it for the required application, and execute the job. After a job is submitted, users can monitor it through periodic notifications, or through queries. Each job consists of a set of tasks that performs actions such as executing applications and managing data. Each task is executed based on a starting condition that is an expression of the states of other tasks. This formulation allows tasks to be executed in parallel, and also allows a user to specify tasks to execute when other tasks succeed, fail, or are canceled. The two core components of the Execution Service are the Task Database, which stores tasks that have been submitted for execution, and the Task Manager, which executes tasks in the proper order, based on the user-specified starting conditions, and avoids overloading local and remote resources while executing tasks