Prototyping Concurrent Systems in Cw

Software architecture is currently recognized as one of the most critical design steps in Software Engineering. The specification of the overall system structure, on the one hand, and of the interactions patterns between its components, on the other, became a major concern for the working developer. Although a number of formalisms to express behaviour and supply the indispensable calculational power to reason about designs, are available, the task of deriving architectural designs on top of popular component platforms has remained largely informal. This paper introduces a systematic approach to derive, from behavioural specifications written in Cw, the corresponding architectural skeletons in the Microsoft .NET framework in the form of executable code

Concurrent Planning in the U.K.

O Planeamento Concomitante teve a sua origem no Reino Unido. É um método radical de intervenção social, baseado na Teoria de Afecto (Attachment Theory). O Planeamento Concomitante procura garantir que as crianças vulneráveis nas casas de acolhimento do Estado sejam adoptadas mais rapidamente possível. As crianças são acolhidas no âmbito deste Planeamento durante o período em que está em curso a avaliação da capacidade acolhedora dos pais adoptivos. As crianças sem condições de retorno para as suas famílias são desta forma legalmente adoptadas pelos pais adoptivos com quem as crianças já conseguiram desenvolver laços afectivos.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Distributed process execution in collaborative networks

Processes are a central entity in enterprise collaboration. Collaborative processes need to be executed and coordinated in a distributed Computational platform where computers are connected through heterogeneous networks and systems. Life cycle management of such collaborative processes requires a framework able to handle their diversity based on different computational and communication requirements. This paper proposes a rational for such framework, points out key requirements and proposes it strategy for a supporting technological infrastructure. Beyond the portability of collaborative process definitions among different technological bindings, a framework to handle different life cycle phases of those definitions is presented and discussed. (c) 2007 Elsevier Ltd. All rights reserved.

Inter-application redundancy elimination in sensor networks with compiler-assisted scheduling

Most current-generation Wireless Sensor Network (WSN) nodes are equipped with multiple sensors of various types, and therefore support for multi-tasking and multiple concurrent applications is becoming increasingly common. This trend has been fostering the design of WSNs allowing several concurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (called REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-level optimization, we model each user application as a linear sequence of executable instructions. We show how well-known string-matching algorithms such as the Longest Common Subsequence (LCS) and the Shortest Common Super-sequence (SCS) can be used to produce an optimal merged monolithic sequence of the deployed applications that takes into account embedded scheduling information. We show that our approach can help in achieving about 60% average energy savings in processor usage compared to the normal execution of concurrent applications.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

The Gap Between Knowledge and Action: Obstacles, Restraints and Deficits During the Execution of Refurbishments

This article outlines the initial draft of a PhD project which investigates refurbishment or rehabilitation projects in two German cities. The study focuses on obstacles, restraints and deficits as well as factors of success, which can be identified during the execution of the refurbishments. Moreover the study examines the process of the refurbishment itself, the general conditions under which the refurbishments are being executed as well as the implementation of sustainability criteria. First the article gives a short summary of the theoretical considerations of the study. In this respect it shortly outlines the global conditions of urban development and conducting challenges for cities in the 21st century, guiding principles of a sustainable urban development as well as goals of sustainable refurbishments. Finally the article shortly describes the case studies and presents the initial results of the empirical work.

Speculative execution by using software transactional memory

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.

Autonomic Activities in the Execution of Scientific Workflows: Evaluation of the AWARD Framework

Workflows have been successfully applied to express the decomposition of complex scientific applications. However the existing tools still lack adequate support to important aspects namely, decoupling the enactment engine from tasks specification, decentralizing the control of workflow activities allowing their tasks to run in distributed infrastructures, and supporting dynamic workflow reconfigurations. We present the AWARD (Autonomic Workflow Activities Reconfigurable and Dynamic) model of computation, based on Process Networks, where the workflow activities (AWA) are autonomic processes with independent control that can run in parallel on distributed infrastructures. Each AWA executes a task developed as a Java class with a generic interface allowing end-users to code their applications without low-level details. The data-driven coordination of AWA interactions is based on a shared tuple space that also enables dynamic workflow reconfiguration. For evaluation we describe experimental results of AWARD workflow executions in several application scenarios, mapped to the Amazon (Elastic Computing EC2) Cloud.

Part I : Comparing derivatization methods for amino acids – one and two-step procedures using gas chromatography – flame ion detector (GC-FID) Part II: Story of an icon from its execution until its conservation

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Conservação e Restauro

The interrogation of witnesses abroad in execution of a european investigation order: an examination from eyes of the defence

European Master Human Rights and Democratisation

Molecular characterization of Dengue viruses type 1 and 2 isolated from a concurrent human infection

In 2001, an autochthonous case of dual viremia, resulting from naturally acquired dengue virus DEN-1 and DEN-2 infections was detected during the dengue outbreak that occurred in Barretos, a city with about 105,000 inhabitants in the North region of São Paulo State. Serotype identification was based on virus isolation to C6/36 mosquito cells culture and immunofluorescence assays using type-specific monoclonal antibodies. The double infection was also confirmed by reverse transcriptase polymerase chain reaction (RT-PCR). Comparative analysis of the 240-nucleotide sequences of E/NS1 gene junction region between the genome of DEN-1 and DEN-2 isolates of the corresponding reference Nauru and PR 159S1 strains, respectively, showed some nucleotide differences, mainly silent mutations in the third codon position. Results of maximum likelihood phylogenetic analysis of E/NS1 gene sequences indicated that both genotypes of DEN-1 and DEN-2 viruses recovered from double infection in Barretos belonged to genotypes I and III, respectively.

An Execution Model for Fine-Grained Parallelism in Ada

20th International Conference on Reliable Software Technologies - Ada-Europe 2015 (Ada-Europe 2015), 25 to 29, Jun, 2015. Madrid, Spain. Best Paper Award.

A Multi-DAG Model for Real-Time Parallel Applications with Conditional Execution

The 30th ACM/SIGAPP Symposium On Applied Computing (SAC 2015). 13 to 17, Apr, 2015, Embedded Systems. Salamanca, Spain.

Non-preemptive and SRP-based fullypreemptive scheduling of real-time Software Transactional Memory

Recent embedded processor architectures containing multiple heterogeneous cores and non-coherent caches renewed attention to the use of Software Transactional Memory (STM) as a building block for developing parallel applications. STM promises to ease concurrent and parallel software development, but relies on the possibility of abort conflicting transactions to maintain data consistency, which in turns affects the execution time of tasks carrying transactions. Because of this fact the timing behaviour of the task set may not be predictable, thus it is crucial to limit the execution time overheads resulting from aborts. In this paper we formalise a FIFO-based algorithm to order the sequence of commits of concurrent transactions. Then, we propose and evaluate two non-preemptive and one SRP-based fully-preemptive scheduling strategies, in order to avoid transaction starvation.