Parallel Software framework for time-critical many-core systems

The recent technological advancements and market trends are causing an interesting phenomenon towards the convergence of High-Performance Computing (HPC) and Embedded Computing (EC) domains. On one side, new kinds of HPC applications are being required by markets needing huge amounts of information to be processed within a bounded amount of time. On the other side, EC systems are increasingly concerned with providing higher performance in real-time, challenging the performance capabilities of current architectures. The advent of next-generation many-core embedded platforms has the chance of intercepting this converging need for predictable high-performance, allowing HPC and EC applications to be executed on efficient and powerful heterogeneous architectures integrating general-purpose processors with many-core computing fabrics. To this end, it is of paramount importance to develop new techniques for exploiting the massively parallel computation capabilities of such platforms in a predictable way. P-SOCRATES will tackle this important challenge by merging leading research groups from the HPC and EC communities. The time-criticality and parallelisation challenges common to both areas will be addressed by proposing an integrated framework for executing workload-intensive applications with real-time requirements on top of next-generation commercial-off-the-shelf (COTS) platforms based on many-core accelerated architectures. The project will investigate new HPC techniques that fulfil real-time requirements. The main sources of indeterminism will be identified, proposing efficient mapping and scheduling algorithms, along with the associated timing and schedulability analysis, to guarantee the real-time and performance requirements of the applications.

Key-CRDT stores

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

Parallel run-time for CO-OPN

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

Design of switched-capacitor filters using low gain amplifiers

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Parallel programming in biomedical signal processing

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

TWO NEW RECORDS OF Isomyia paurogonita FANG AND FAN, 1986 AND Sumatria latifrons Malloch, 1926 (DIPTERA: CALLIPHORIDAE) FROM NORTHERN THAILAND, WITH REVISED KEY TO THE SPECIES OF Isomyia

During the annual fly survey at Doi Nang Kaew in Doi Saket District, Chiang Mai Province of Thailand in 2011, Isomyia paurogonitaFang & Fan, 1986 (Diptera: Calliphoridae) and Sumatria latifrons Malloch, 1926 (Diptera: Calliphoridae) were collected for the first time in Thailand. They are the rare species of the subfamily Rhiniinae (tribe Cosminini). Prior to this finding, fifteen species of Isomyia and two species of Sumatriawere recorded from Thailand. Therefore, 96 blow fly species have been found in this country. These new locality records of both flies are very important for further research on their biology and ecology in Thailand.

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.

Structural and functional studies of PpcA: a key protein in the electron transfer pathways of Geobacter sulfurreducens

Dissertação para obtenção do Grau de Doutor em Bioquímica, ramo de Biotecnologia

Auditoria a Key Plastics Portugal

Dissertação para a obtenção do grau de Mestre em Engenharia Mecânica

A key for identifying faecal smears to detect domestic infestations of triatomine bugs

Early detection of residual populations of domestic triatomine bugs that survive insecticide treatment is a key component of successful evaluation and vigilance for Chagas disease control. We have recently demonstrated that sheets of paper, tacked on to the walls of infested houses, can become streaked with the faeces of triatomine bugs and thus reveal thepresence of an infestation. In thispaper, wepresent a simple key to differentiate the faecal streaks of triatomine bugs from those of other domestic arthropods such as cockroaches, ticks and cimicid bedbugs.

Key success factors of replicated social businesses

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Interplay of Exoribonucleases, Hfq and Small RNAs Structural Determinants in the Control of Gene Expression

Dissertation presented to obtain the Ph.D degree in Biology

A system’s approach to cache hierarchy-aware decomposition of data-parallel computations

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

Optimization of breast tomosynthesis image reconstruction using parallel computing

Breast cancer is the most common cancer among women, being a major public health problem. Worldwide, X-ray mammography is the current gold-standard for medical imaging of breast cancer. However, it has associated some well-known limitations. The false-negative rates, up to 66% in symptomatic women, and the false-positive rates, up to 60%, are a continued source of concern and debate. These drawbacks prompt the development of other imaging techniques for breast cancer detection, in which Digital Breast Tomosynthesis (DBT) is included. DBT is a 3D radiographic technique that reduces the obscuring effect of tissue overlap and appears to address both issues of false-negative and false-positive rates. The 3D images in DBT are only achieved through image reconstruction methods. These methods play an important role in a clinical setting since there is a need to implement a reconstruction process that is both accurate and fast. This dissertation deals with the optimization of iterative algorithms, with parallel computing through an implementation on Graphics Processing Units (GPUs) to make the 3D reconstruction faster using Compute Unified Device Architecture (CUDA). Iterative algorithms have shown to produce the highest quality DBT images, but since they are computationally intensive, their clinical use is currently rejected. These algorithms have the potential to reduce patient dose in DBT scans. A method of integrating CUDA in Interactive Data Language (IDL) is proposed in order to accelerate the DBT image reconstructions. This method has never been attempted before for DBT. In this work the system matrix calculation, the most computationally expensive part of iterative algorithms, is accelerated. A speedup of 1.6 is achieved proving the fact that GPUs can accelerate the IDL implementation.

Assessment of Notch1 ligands production - key protein targets in breast cancer

Cell-to-cell communication is required for many biological processes in development and adult life. One of the most common systems utilized by a wide range of eukaryotes is the Notch signalling pathway. Four Notch receptors and five ligands have been identified in mammals that interact via their extracellular domains leading to transcription activation. Studies have shown that the Notch ligands expression is undetectable in normal breast tissues, but moderate to high expression has been detected in breast cancer. Thus, any of the Notch1 ligands can be studied as possible therapeutic targets for breast cancer. To study Notch pathway proteins there is the need to obtain stable protein solutions. E. coli is the host of excellence for recombinant proteins for the ease of use, fast growth and high cell densities. However, the expression of mammalian proteins in such systems may overwhelm the bacterial cellular machinery, which does not possess the ability for post-translational modifications, or dedicated compartments for protein synthesis. Mammalian cells are therefore preferred, despite their technical and financial increased demands. We aim to determine the best expression and purification conditions for the different ligand protein constructs, to develop specific function-blocking antibodies using the Phage Display technology. Moreover, we propose to crystallize the Notch1 ligands alone and in complex with the phage display selected antibodies, unveiling molecular details. hJag2DE3 and hDll1DE6 proteins were purified from refolded inclusion bodies or mammalian cell culture supernatants, respectively, and purity was confirmed by SDS-PAGE (>95%). Protein produced in mammalian cells showed to be more stable, apparently with the physiological disulfide pattern, contrary to what was observed in the refolded protein. Several nano-scale crystallization experiments were set up in 96-well plates, but no positive result was obtained. We will continue to pursue for the best expression for the Notch ligand constructs in both expression systems.