Using Quicktrace to collect runtime execution traces easily and automatically

IEEE Real-Time Systems Symposium (RTSS 2015). 1 to 4, Dec, 2015. U.S.A.

Parallel run-time for CO-OPN

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Multicore Scheduling of Real-Time Irregular Parallel Algorithms in Linux

Face à estagnação da tecnologia uniprocessador registada na passada década, aos principais fabricantes de microprocessadores encontraram na tecnologia multi-core a resposta `as crescentes necessidades de processamento do mercado. Durante anos, os desenvolvedores de software viram as suas aplicações acompanhar os ganhos de performance conferidos por cada nova geração de processadores sequenciais, mas `a medida que a capacidade de processamento escala em função do número de processadores, a computação sequencial tem de ser decomposta em várias partes concorrentes que possam executar em paralelo, para que possam utilizar as unidades de processamento adicionais e completar mais rapidamente. A programação paralela implica um paradigma completamente distinto da programação sequencial. Ao contrário dos computadores sequenciais tipificados no modelo de Von Neumann, a heterogeneidade de arquiteturas paralelas requer modelos de programação paralela que abstraiam os programadores dos detalhes da arquitectura e simplifiquem o desenvolvimento de aplicações concorrentes. Os modelos de programação paralela mais populares incitam os programadores a identificar instruções concorrentes na sua lógica de programação, e a especificá-las sob a forma de tarefas que possam ser atribuídas a processadores distintos para executarem em simultâneo. Estas tarefas são tipicamente lançadas durante a execução, e atribuídas aos processadores pelo motor de execução subjacente. Como os requisitos de processamento costumam ser variáveis, e não são conhecidos a priori, o mapeamento de tarefas para processadores tem de ser determinado dinamicamente, em resposta a alterações imprevisíveis dos requisitos de execução. `A medida que o volume da computação cresce, torna-se cada vez menos viável garantir as suas restrições temporais em plataformas uniprocessador. Enquanto os sistemas de tempo real se começam a adaptar ao paradigma de computação paralela, há uma crescente aposta em integrar execuções de tempo real com aplicações interativas no mesmo hardware, num mundo em que a tecnologia se torna cada vez mais pequena, leve, ubíqua, e portável. Esta integração requer soluções de escalonamento que simultaneamente garantam os requisitos temporais das tarefas de tempo real e mantenham um nível aceitável de QoS para as restantes execuções. Para tal, torna-se imperativo que as aplicações de tempo real paralelizem, de forma a minimizar os seus tempos de resposta e maximizar a utilização dos recursos de processamento. Isto introduz uma nova dimensão ao problema do escalonamento, que tem de responder de forma correcta a novos requisitos de execução imprevisíveis e rapidamente conjeturar o mapeamento de tarefas que melhor beneficie os critérios de performance do sistema. A técnica de escalonamento baseado em servidores permite reservar uma fração da capacidade de processamento para a execução de tarefas de tempo real, e assegurar que os efeitos de latência na sua execução não afectam as reservas estipuladas para outras execuções. No caso de tarefas escalonadas pelo tempo de execução máximo, ou tarefas com tempos de execução variáveis, torna-se provável que a largura de banda estipulada não seja consumida por completo. Para melhorar a utilização do sistema, os algoritmos de partilha de largura de banda (capacity-sharing) doam a capacidade não utilizada para a execução de outras tarefas, mantendo as garantias de isolamento entre servidores. Com eficiência comprovada em termos de espaço, tempo, e comunicação, o mecanismo de work-stealing tem vindo a ganhar popularidade como metodologia para o escalonamento de tarefas com paralelismo dinâmico e irregular. O algoritmo p-CSWS combina escalonamento baseado em servidores com capacity-sharing e work-stealing para cobrir as necessidades de escalonamento dos sistemas abertos de tempo real. Enquanto o escalonamento em servidores permite partilhar os recursos de processamento sem interferências a nível dos atrasos, uma nova política de work-stealing que opera sobre o mecanismo de capacity-sharing aplica uma exploração de paralelismo que melhora os tempos de resposta das aplicações e melhora a utilização do sistema. Esta tese propõe uma implementação do algoritmo p-CSWS para o Linux. Em concordância com a estrutura modular do escalonador do Linux, ´e definida uma nova classe de escalonamento que visa avaliar a aplicabilidade da heurística p-CSWS em circunstâncias reais. Ultrapassados os obstáculos intrínsecos `a programação da kernel do Linux, os extensos testes experimentais provam que o p-CSWS ´e mais do que um conceito teórico atrativo, e que a exploração heurística de paralelismo proposta pelo algoritmo beneficia os tempos de resposta das aplicações de tempo real, bem como a performance e eficiência da plataforma multiprocessador.

Maintaining the correctness of transactional memory programs

Dissertação para obtenção do Grau de Doutor em Engenharia Informática

Lightweight monitoring of transactional memory programs

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Preventing atomicity violations with contracts

Concurrent programming is a difficult and error-prone task because the programmer must reason about multiple threads of execution and their possible interleavings. A concurrent program must synchronize the concurrent accesses to shared memory regions, but this is not enough to prevent all anomalies that can arise in a concurrent setting. The programmer can misidentify the scope of the regions of code that need to be atomic, resulting in atomicity violations and failing to ensure the correct behavior of the program. Executing a sequence of atomic operations may lead to incorrect results when these operations are co-related. In this case, the programmer may be required to enforce the sequential execution of those operations as a whole to avoid atomicity violations. This situation is specially common when the developer makes use of services from third-party packages or modules. This thesis proposes a methodology, based on the design by contract methodology, to specify which sequences of operations must be executed atomically. We developed an analysis that statically verifies that a client of a module is respecting its contract, allowing the programmer to identify the source of possible atomicity violations.

A distributed platform for the volunteer execution of workflows on a local area network

Thesis submitted in fulfilment of the requirements for the Degree of Master of Science in Computer Science

Concurrent dengue and malaria in the Amazon region

INTRODUCTION: The Amazon region has extensive forested areas and natural ecosystems, providing favorable conditions for the existence of innumerous arboviruses. Over 200 arboviruses have been isolated in Brazil and about 40 are associated with human disease. Four out of 40 are considered to be of public health importance in Brazil: Dengue viruses (1-4), Oropouche, Mayaro and Yellow Fever. Along with these viruses, about 98% of the malaria cases are restricted to the Legal Amazon region. METHODS: This study aimed to investigate the presence of arboviruses in 111 clinical serum samples from patients living in Novo Repartimento (Pará), Plácido de Castro (Acre), Porto Velho (Rondônia) and Oiapoque (Amapá). The viral RNA was extracted and RT-PCR was performed followed by a Multiplex-Nested-PCR, using Flavivirus, Alphavirus and Orthobunyavirus generic and species-specific primers. RESULTS: Dengue virus serotype 2 was detected in two patients living in Novo Repartimento (Pará) that also presented active Plasmodium vivax infection. CONCLUSIONS: Despite scant data, this situation is likely to occur more frequently than detected in the Amazon region. Finally, it is important to remember that both diseases have similar clinical findings, thus the diagnosis could be made concomitantly for dengue and malaria in patients living or returning from areas where both diseases are endemic or during dengue outbreaks.

A logical foundation for session-based concurrent computation

Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made in this regard, a Curry-Howard correspondence between linear logic and concurrent computation was only found recently, bridging the proof theory of linear logic and session-typed process calculus. Building upon this work, we have developed a theory of intuitionistic linear logic as a logical foundation for session-based concurrent computation, exploring several concurrency related phenomena such as value-dependent session types and polymorphic sessions within our logical framework in an arguably clean and elegant way, establishing with relative ease strong typing guarantees due to the logical basis, which ensure the fundamental properties of type preservation and global progress, entailing the absence of deadlocks in communication. We develop a general purpose concurrent programming language based on the logical interpretation, combining functional programming with a concurrent, session-based process layer through the form of a contextual monad, preserving our strong typing guarantees of type preservation and deadlock-freedom in the presence of general recursion and higher-order process communication. We introduce a notion of linear logical relations for session typed concurrent processes, developing an arguably uniform technique for reasoning about sophisticated properties of session-based concurrent computation such as termination or equivalence based on our logical approach, further supporting our goal of establishing intuitionistic linear logic as a logical foundation for sessionbased concurrency.

What do broadband consumers want? Design and execution of a questionnaire on demand for bundled services on the Portuguese telecomunications market

The report addresses the question of what are the preferences of broadband consumers on the Portuguese telecommunication market. A triple play bundle is being investigated. The discrete choice analysis, adopted in the study, base on 110 responses, mainly from NOVA students. The data for the analysis was collected via manually designed on-line survey. The results show that the price attribute is relatively the most important one while the television attribute is being overlooked in the decision making process. Main effects examined in the research are robust. In addition, "extras" components are being tested in terms of users' preferences.

An effective on-the-job training model-to facilitate strategy execution

Strategy execution has been a heated topic in the management world in recent years. However, according to a survey done by the Conference Board (2014), the chief executives are so concerned about the execution in their companies and have rated it as the No.1 or No.2 most challenging issue. Many of them choose to invest in training with a purpose to harvest the most for strategy execution. Therefore, this research is trying to find out a model to design training programs that can at most contribute to the success of strategy execution with three real-life training cases done by BTS Consulting Service. It was found that strategy execution could be greatly supported by training programs that take into consideration the four factors, namely Alignment, Mindset to Change, Capability and Organization Support. Main implications of the findings are presented and discussed. Key

HEP-Frame: A software engineered framework to aid the development and efficient multicore execution of scientific code

This work was supported by FCT (Fundação para a Ciência e Tecnologia) within Project Scope (UID/CEC/00319/2013), by LIP (Laboratório de Instrumentação e Física Experimental de Partículas) and by Project Search-ON2 (NORTE-07-0162- FEDER-000086), co-funded by the North Portugal Regional Operational Programme (ON.2 - O Novo Norte), under the National Strategic Reference Framework, through the European Regional Development Fund.

Entre la ejecución y la representación: intersecciones de lo real en la construcción escénica. Between the execution and the representation: intersections of the real thing in the scenic construction.

Esta propuesta de investigación se enmarca en los encuentros y discusiones que se están realizando en la Escuela de Artes de la Facultad de Filosofía y Humanidades (CEPIA, CIFFyH y SeCyT, de la U.N.C), en relación a las problemáticas de la investigación en Artes. Los encuentros llevados a cabo en diversas ocasiones y a lo largo de 2009, demuestran la necesidad de establecer un campo particular de la investigación y su relación con la práctica artística. Este proyecto nace de estas inquietudes y establece ciertos ejes de trabajo que permiten poner en práctica ciertos esbozos imaginados. En este sentido, nuestra propuesta se centra en definir la misma construcción escénica como objeto de estudio, delimitando sobre éste la problemática de lo real en el trabajo de la ficción, proponiendo además un equipo que permita investigar en su propio desarrollo creativo las diversas variables que entran en juego. De este modo, se trabajará en una propuesta de laboratorio escénico donde los planteos de orden teórico atraviesen la práctica y, a su vez, la observación de ésta permita una reelaboración y profundización del pensamiento contemporáneo sobre la problemática ejecución/representación, desde los diversos órdenes en que ésta interviene. La idea de representación teatral que planteaba Aristóteles señala que las acciones devienen necesariamente en la definición del carácter de los personajes. Este concepto es clave en el desarrollo del teatro occidental y por ende en las diferentes concepciones de actor. La definición de acción dada por Aristóteles es problemática para parte del teatro contemporáneo ya que supone que toda acción es mimética. También da por supuesto que en el teatro se conforman personajes, y que la unidad narrativa está dada por una programática, que es definida por la acción.La presente investigación se propone indagar en la relación entre la ejecución de la acción y su representación en el desarrollo de un laboratorio teatral. Esto implica que necesariamente es aplicada al trabajo escénico. Nuestra hipótesis de partida es que la relación conflictiva entre acción, ejecución de la misma y representación, se produce a partir de la operación material sobre lo real . Estas intersecciones podrían ser pensadas como una teoría del montaje donde la corporalidad es el principio necesario e irreductible de la construcción. La intersección de lo real es una problemática que permite ahondar sobre los procedimientos por los cuales se construye la escena. La idea de un teatro material, obliga a pensar con qué procedimientos se construye ficción. Un teatro que intenta recalar en lo “real” como modo de señalar la cosa misma, se propone, desde la perspectiva de la realización, indagar en los mecanismos de su construcción (procedimientos), por lo cual supone que la actividad teatral puede dar cuenta de los procesos por los cuales se realiza. La realización de una acción, puede remitir a sí misma y genera una relación “extraña” y ambigua con el mundo de referencia. La acción en sí misma, pone en cuestión la idea de modelo y da cuenta de una crisis en la representación. La teoría ha intentado dividir y sistematizar de manera binaria la manifestación teatral: Teatro de Representación/ Teatro Performático, para distinguir un teatro vinculado a la creación de personajes o para relacionarlo a un teatro de ejecución. Sin embargo, pensamos que es posible encontrar en la producción escénica, intersecciones de lo real que median el mundo de la representación y el de la performance para la construcción de ficción. Nuestra hipótesis de base es que si intervenimos el plano de la ejecución en el actor, la representación varía sustancialmente sus mecanismos de producción de sentido. Este primer planteo no es conflictivo hasta que se pone de manifiesto lo real. This research’s proposal is framed into the meetings and discussions that have been taking place in the School of Arts of the Faculty of Philosophy and Humanities (CEPIA, CIFFyH y SeCyT, of the National University of Cordoba), concerning the difficulties of research in Arts. The meetings carried out along 2009, demonstrate the need to establish a particular field of research and its relation to the practice of arts. This project is born from these concerns and it establishes central axis for the work, that enables us to put on practice some sketches imagined. In this regard, our proposal focuses on defining the construction of the scene as object of study, in itself, delimiting the issue of “the real” in the work of fiction. Proposing, furthermore, a team for researching the many variables that comes into play, in their own creative development. Consequently, the work will be developed in the method of a scenic laboratory, where the theoretical proposals cross over the practice and, in turn, these observations allow a reworking and deepen of contemporary thinking about the problematic of performance / representation, from the diverse orders in which it intervene. The idea of theatrical performance proposed by Aristotle, indicate that actions necessarily turn into the definition of the nature of the characters. This concept is key to the development of Western theaterand consequently on the different conceptions of actor. The definition of action given by Aristotle is problematic for a part of the contemporary theater, because it assumes that every action is mimetic. Also presumes that in the theatre the characters are formed, and narrative unit is given by a programmatic, which is defined by the action. This research proposes to explore the relationship between implementation of the action and its representation in the development of a theatrical laboratory. This implies that it is applied necessarily to the scenic practice. Our preliminary hypothesis is that the co.

Sistemas de Tipos para Verificación de Programas Concurrentes. Type Systems for Concurrent Programs Verification.

La programación concurrente es una tarea difícil aún para los más experimentados programadores. Las investigaciones en concurrencia han dado como resultado una gran cantidad de mecanismos y herramientas para resolver problemas de condiciones de carrera de datos y deadlocks, problemas que surgen por el mal uso de los mecanismos de sincronización. La verificación de propiedades interesantes de programas concurrentes presenta dificultades extras a los programas secuenciales debido al no-determinismo de su ejecución, lo cual resulta en una explosión en el número de posibles estados de programa, haciendo casi imposible un tratamiento manual o aún con la ayuda de computadoras. Algunos enfoques se basan en la creación de lenguajes de programación con construcciones con un alto nivel de abstración para expresar concurrencia y sincronización. Otros enfoques tratan de desarrollar técnicas y métodos de razonamiento para demostrar propiedades, algunos usan demostradores de teoremas generales, model-checking o algortimos específicos sobre un determinado sistema de tipos. Los enfoques basados en análisis estático liviano utilizan técnicas como interpretación abstracta para detectar ciertos tipos de errores, de una manera conservativa. Estas técnicas generalmente escalan lo suficiente para aplicarse en grandes proyectos de software pero los tipos de errores que pueden detectar es limitada. Algunas propiedades interesantes están relacionadas a condiciones de carrera y deadlocks, mientras que otros están interesados en problemas relacionados con la seguridad de los sistemas, como confidencialidad e integridad de datos. Los principales objetivos de esta propuesta es identificar algunas propiedades de interés a verificar en sistemas concurrentes y desarrollar técnicas y herramientas para realizar la verificación en forma automática. Para lograr estos objetivos, se pondrá énfasis en el estudio y desarrollo de sistemas de tipos como tipos dependientes, sistema de tipos y efectos, y tipos de efectos sensibles al flujo de datos y control. Estos sistemas de tipos se aplicarán a algunos modelos de programación concurrente como por ejemplo, en Simple Concurrent Object-Oriented Programming (SCOOP) y Java. Además se abordarán propiedades de seguridad usando sistemas de tipos específicos. Concurrent programming has remained a dificult task even for very experienced programmers. Concurrency research has provided a rich set of tools and mechanisms for dealing with data races and deadlocks that arise of incorrect use of synchronization. Verification of most interesting properties of concurrent programs is a very dificult task due to intrinsic non-deterministic nature of concurrency, resulting in a state explosion which make it almost imposible to be manually treat and it is a serious challenge to do that even with help of computers. Some approaches attempts create programming languages with higher levels of abstraction for expressing concurrency and synchronization. Other approaches try to develop reasoning methods to prove properties, either using general theorem provers, model-checking or specific algorithms on some type systems. The light-weight static analysis approach apply techniques like abstract interpretation to find certain kind of bugs in a conservative way. This techniques scale well to be applied in large software projects but the kind of bugs they may find are limited. Some interesting properties are related to data races and deadlocks, while others are interested in some security problems like confidentiality and integrity of data. The main goals of this proposal is to identify some interesting properties to verify in concurrent systems and develop techniques and tools to do full automatic verification. The main approach will be the application of type systems, as dependent types, type and effect systems, and flow-efect types. Those type systems will be applied to some models for concurrent programming as Simple Concurrent Object-Oriented Programming (SCOOP) and Java. Other goals include the analysis of security properties also using specific type systems.

Cross-frequency coupling tracks motor automization and execution in the human motor system

Magdeburg, Univ., Fak. für Naturwiss., Diss., 2014