Parallel programming in biomedical signal processing

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

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

Learning about Distributed Systems

This paper presents the "state of the art" about distributed systems and applications and it's focused on teaching about these systems. It presents different platforms where to run distributed applications and describes some development toolkits whose can be used to develop prototypes, practices and distributed applications. It also presents some existing distributed algorithms useful for class practices, and some tools to help managing distributed environments. Finally, the paper presents some teaching experiences with different approaches on how to teach about distributed systems.

Evaluation of MPI collectives for HPC applications on distributed virtualized environments

Through this study, we will measure how the collective MPI operations behaves in virtual and physical clusters, and its impact on the application performance. As we stated before, we will use as a test case the Weather Research and Forecasting simulations.

Characterization of SKI-1/S1P-mediated processing of Arenavirus glycoprotein precursors

Arenaviruses are rodent-born world-wide distributed negative strand RNA viruses that comprise a number of important human pathogens including Lassa virus (LASV) which causes more than 3 00'000 infections annually in Western Africa. Lymphocytic choriomeningitis virus (LCMV) is the prototypic member of the arenavirus family, which is divided in two major subgroups according to serological properties and geographical distribution, the Old World and New World arenaviruses. The envelope glycoprotein precursors (GPCs) of arenaviruses have to undergo proteolytic processing to acquire biological function and to be incorporated into progeny virions. A cellular enzyme is responsible for this processing: the Subtilisin Kexin Isozyme-1 or Site-1 protease (SKI- 1/S1P). In this thesis we have studied the relationship between SKI-1/S1P and the envelope GPs of arenaviruses. In a first project, we investigated the molecular interactions between SKI-1/SIP and arenavirus GPCs. Using SKI-1/SIP mutants, we confirmed previously published observations locating LCMV GPC and LASV GPC processing in the Late Golgi/TGN and ER/cis-Golgi, respectively. A single mutation in the cleavage site of LCMV was sufficient to re-locate SKI- 1/SIP-mediated processing from the late Golgi/TGN to the ER/cis-Golgi. We then demonstrated that the transmembrane domain, the C-terminal tail and the phosphorylation sites of SKI-1/S1P are dispensable for GPC processing. Additionally we identified a SKI- 1/S1P mutant defective for autoprocessing at site Β, B' that was selectively impaired in processing of viral GPCs but not cellular substrates. We also showed that a soluble variant of SKI-1/SIΡ was unable to cleave envelope GPs at the cell surface when added in the culture medium. This study highlighted a new target for small molecule inhibitors that would specifically impair GPC but not cellular substrate processing. In a second project, we identified and characterized two residues: LASV GPC Y253 and SKI-1/S1P Y285 that are important for the SKI-1/SIP-mediated LASV GPC cleavage. An alignment of GPC sequences revealed a conserved aromatic residue in P7 position in the GPCs of Old World and Clade C of New World arenaviruses. Mutations in GPC at position P7 impaired processing efficiency. In SKI-1/S1P, mutating Y285 into A negatively affected processing of substrates containing aromatic residues in P7, without affecting others. This property could be used to develop specific drugs targeting SKI-1/SIP-mediated cleavage of LASV GPC without affecting cellular substrates. As a third project we studied the role of the SKI-1/SIP-mediated processing and the unusual stable signal peptide (SSP) for the folding and secretion of soluble forms of the ectodomain of LASV and LCMV glycoproteins. We provide evidence that the transmembrane domain and the cytosolic tail are crucial for the stability of the prefusion conformation of arenavirus GP and that the SSP is required for transport and processing of full-length GP, but not the soluble ectodomain per se. Taken together, these results will lead to a better understanding of the complex interactions between arenavirus GPCs and SKI-1/S IP, paving the avenue for the development of novel anti-arenaviral therapeutics. - Les Arenavirus sont des virus à ARN négatif distribués mondialement et portés par les rongeurs. Cette famille de virus comprend des virus hautement pathogènes pour l'homme comme le virus de Lassa (LASV) qui cause plus de 300Ό00 infections par année en Afrique de l'Ouest. Le virus de la chorioméningite lymphocytaire (LCMV) est le représentant de cette famille qui est divisée en deux sous-groupes selon des critères sérologiques et de distributions géographiques: arenavirus du Nouveau et de l'Ancien monde. Les glycoprotéines d'enveloppe de ces virus (GPCs) doivent être clivées pour être incorporées dans le virus et ainsi lui permettre d'être infectieux. Une enzyme cellulaire est responsable de ce clivage : la Subtilisin Kexin Isozyme-1 ou protéase Site-1 (SKI-l/SlP). Dans cette thèse, nous avons étudié la relation entre cette enzyme cellulaire et les GPs des arenavirus. Dans un premier temps, nous avons étudié les interactions moléculaires entre SKI- 1/S1P et GPC. A l'aide de mutants de SKI-l/SlP, nous avons confirmé des résultats précédemment publiés montrant que les glycoprotéines d'enveloppe de LASV sont clivés dans le réticulum endoplasmique/cis-Golgi alors que celles de LCMV sont clivées dans le Golgi tardif/TGN. Une seule mutation dans le site de clivage de la glycoprotéine de LCMV est suffisante pour changer le compartiment cellulaire dans lequel est clivée cette glycoprotéine. Ensuite, nous avons démontré que le domaine transmembranaire, la partie cytosolique C-terminale ainsi que les sites de phosphorylations de cette enzyme ne sont pas indispensables pour permettre le clivage de GPC. De plus, nous avons identifié un mutant de SKI-l/SlP dans lequel Γ autoprocessing au site B,B' est impossible, incapable de cliver GPC mais toujours pleinement fonctionnelle envers ses substrats cellulaires. Nous avons également démontré qu'une forme soluble de SKI-l/SlP ajoutée dans le milieu de culture n'est pas capable de couper GPC à la surface de la cellule. Cette étude a défini une nouvelle cible potentielle pour un médicament qui inhiberait le clivage des glycoprotéines des arenavirus sans affecter les processus normaux de la cellule. Dans un second project, nous avons identifié deux acides aminés, LASV GPC Y253 et SKI-l/SlP Y285, qui sont important pour le clivage de LASV GPC. Un alignement des séquences de clivage des GPCs a montré qu'un résidu aromatique est conservé en position P7 du site de clivage chez tous les arenavirus de l'Ancien monde et dans le clade C des arenavirus du Nouveau monde. Une mutation de cet acide aminée dans GPC réduit l'efficacité de clivage par SKI-l/SlP. Mutation de la tyrosine 285 de SKI-l/SlP en alanine affecte négativement le clivage des substrats contenant un résidu aromatique en position P7 sans affecter les autres. Cette propriété pourrait être utilisée pour le développement de médicaments spécifiques ciblant le clivage de GPC. Finalement, nous avons étudié le rôle du processing accomplit par SKI-l/SlP et du signal peptide pour le pliage et la sécrétion de formes solubles des glycoprotéines de LASV et LCMV. Nous avons montré que le domaine transmembranaire et la partie cytosolique de GP sont crucials pour la stabilité de la conformation pre-fusionnelle des GPs et que SSP est nécessaire pour le transport et le processing de GP, mais pas de son ecto-domaine soluble. En conclusion, les résultats obtenus durant cette thèse permettrons de mieux comprendre les interactions complexes entre SKI-l/SlP et les glycoprotéines des arenavirus, ouvrant le chemin pour le développement de nouveaux médicaments anti-arénaviraux.

Distributed all-atom simulations of intrinsically unstructured proteins

The Computational Biophysics Group at the Universitat Pompeu Fabra (GRIB-UPF) hosts two unique computational resources dedicated to the execution of large scale molecular dynamics (MD) simulations: (a) the ACMD molecular-dynamics software, used on standard personal computers with graphical processing units (GPUs); and (b) the GPUGRID. net computing network, supported by users distributed worldwide that volunteer GPUs for biomedical research. We leveraged these resources and developed studies, protocols and open-source software to elucidate energetics and pathways of a number of biomolecular systems, with a special focus on flexible proteins with many degrees of freedom. First, we characterized ion permeation through the bactericidal model protein Gramicidin A conducting one of the largest studies to date with the steered MD biasing methodology. Next, we addressed an open problem in structural biology, the determination of drug-protein association kinetics; we reconstructed the binding free energy, association, and dissaciociation rates of a drug like model system through a spatial decomposition and a Makov-chain analysis. The work was published in the Proceedings of the National Academy of Sciences and become one of the few landmark papers elucidating a ligand-binding pathway. Furthermore, we investigated the unstructured Kinase Inducible Domain (KID), a 28-peptide central to signalling and transcriptional response; the kinetics of this challenging system was modelled with a Markovian approach in collaboration with Frank Noe’s group at the Freie University of Berlin. The impact of the funding includes three peer-reviewed publication on high-impact journals; three more papers under review; four MD analysis components, released as open-source software; MD protocols; didactic material, and code for the hosting group.

@neurIST infrastructure for advanced disease management through integration of heterogeneous data, computing, and complex processing services

The increasing volume of data describing humandisease processes and the growing complexity of understanding, managing, and sharing such data presents a huge challenge for clinicians and medical researchers. This paper presents the@neurIST system, which provides an infrastructure for biomedical research while aiding clinical care, by bringing together heterogeneous data and complex processing and computing services. Although @neurIST targets the investigation and treatment of cerebral aneurysms, the system’s architecture is generic enough that it could be adapted to the treatment of other diseases.Innovations in @neurIST include confining the patient data pertaining to aneurysms inside a single environment that offers cliniciansthe tools to analyze and interpret patient data and make use of knowledge-based guidance in planning their treatment. Medicalresearchers gain access to a critical mass of aneurysm related data due to the system’s ability to federate distributed informationsources. A semantically mediated grid infrastructure ensures that both clinicians and researchers are able to seamlessly access andwork on data that is distributed across multiple sites in a secure way in addition to providing computing resources on demand forperforming computationally intensive simulations for treatment planning and research.

Towards a resolution of conflicting models of illusory contour processing in humans.

Despite myriad studies, neurophysiologic mechanisms mediating illusory contour (IC) sensitivity remain controversial. Among the competing models one favors feed-forward effects within lower-tier cortices (V1/V2). Another situates IC sensitivity first within higher-tier cortices, principally lateral-occipital cortices (LOC), with later feedback effects in V1/V2. Still others postulate that LOC are sensitive to salient regions demarcated by the inducing stimuli, whereas V1/V2 effects specifically support IC sensitivity. We resolved these discordances by using misaligned line gratings, oriented either horizontally or vertically, to induce ICs. Line orientation provides an established assay of V1/V2 modulations independently of IC presence, and gratings lack salient regions. Electrical neuroimaging analyses of visual evoked potentials (VEPs) disambiguated the relative timing and localization of IC sensitivity with respect to that for grating orientation. Millisecond-by-millisecond analyses of VEPs and distributed source estimations revealed a main effect of grating orientation beginning at 65 ms post-stimulus onset within the calcarine sulcus that was followed by a main effect of IC presence beginning at 85 ms post-stimulus onset within the LOC. There was no evidence for differential processing of ICs as a function of the orientation of the grating. These results support models wherein IC sensitivity occurs first within the LOC.

Altered brain mechanisms of emotion processing in pre-manifest Huntington's disease.

Huntington's disease is an inherited neurodegenerative disease that causes motor, cognitive and psychiatric impairment, including an early decline in ability to recognize emotional states in others. The pathophysiology underlying the earliest manifestations of the disease is not fully understood; the objective of our study was to clarify this. We used functional magnetic resonance imaging to investigate changes in brain mechanisms of emotion recognition in pre-manifest carriers of the abnormal Huntington's disease gene (subjects with pre-manifest Huntington's disease): 16 subjects with pre-manifest Huntington's disease and 14 control subjects underwent 1.5 tesla magnetic resonance scanning while viewing pictures of facial expressions from the Ekman and Friesen series. Disgust, anger and happiness were chosen as emotions of interest. Disgust is the emotion in which recognition deficits have most commonly been detected in Huntington's disease; anger is the emotion in which impaired recognition was detected in the largest behavioural study of emotion recognition in pre-manifest Huntington's disease to date; and happiness is a positive emotion to contrast with disgust and anger. Ekman facial expressions were also used to quantify emotion recognition accuracy outside the scanner and structural magnetic resonance imaging with voxel-based morphometry was used to assess the relationship between emotion recognition accuracy and regional grey matter volume. Emotion processing in pre-manifest Huntington's disease was associated with reduced neural activity for all three emotions in partially separable functional networks. Furthermore, the Huntington's disease-associated modulation of disgust and happiness processing was negatively correlated with genetic markers of pre-manifest disease progression in distributed, largely extrastriatal networks. The modulated disgust network included insulae, cingulate cortices, pre- and postcentral gyri, precunei, cunei, bilateral putamena, right pallidum, right thalamus, cerebellum, middle frontal, middle occipital, right superior and left inferior temporal gyri, and left superior parietal lobule. The modulated happiness network included postcentral gyri, left caudate, right cingulate cortex, right superior and inferior parietal lobules, and right superior frontal, middle temporal, middle occipital and precentral gyri. These effects were not driven merely by striatal dysfunction. We did not find equivalent associations between brain structure and emotion recognition, and the pre-manifest Huntington's disease cohort did not have a behavioural deficit in out-of-scanner emotion recognition relative to controls. In addition, we found increased neural activity in the pre-manifest subjects in response to all three emotions in frontal regions, predominantly in the middle frontal gyri. Overall, these findings suggest that pathophysiological effects of Huntington's disease may precede the development of overt clinical symptoms and detectable cerebral atrophy.

Collecting Transaction Data in a Fourth Generation Mobile Network

Tässä diplomityössä on oletettu että neljännen sukupolven mobiiliverkko on saumaton yhdistelmä olemassa olevia toisen ja kolmannen sukupolven langattomia verkkoja sekä lyhyen kantaman WLAN- ja Bluetooth-radiotekniikoita. Näiden tekniikoiden on myös oletettu olevan niin yhteensopivia ettei käyttäjä havaitse saanti verkon muuttumista. Työ esittelee neljännen sukupolven mobiiliverkkoihin liittyvien tärkeimpien langattomien tekniikoiden arkkitehtuurin ja perustoiminta-periaatteet. Työ kuvaa eri tekniikoita ja käytäntöjä tiedon mittaamiseen ja keräämiseen. Saatuja transaktiomittauksia voidaan käyttää tarjottaessa erilaistettuja palvelutasoja sekä verkko- ja palvelukapasiteetin optimoimisessa. Lisäksi työssä esitellään Internet Business Information Manager joka on ohjelmistokehys hajautetun tiedon keräämiseen. Sen keräämää mittaustietoa voidaan käyttää palvelun tason seurannassa j a raportoinnissa sekä laskutuksessa. Työn käytännön osuudessa piti kehittää langattoman verkon liikennettä seuraava agentti joka tarkkailisi palvelun laatua. Agentti sijaitsisi matkapuhelimessa mitaten verkon liikennettä. Agenttia ei kuitenkaan voitu toteuttaa koska ohjelmistoympäristö todettiin vajaaksi. Joka tapauksessa työ osoitti että käyttäjän näkökulmasta tietoa kerääville agenteille on todellinen tarve.

Gridifying IBM's Generic Log Adapter to Speed-Up the Processing of Log Data

Peer-reviewed

Development a distributed simulation environment on a cluster of workstations

Simulation has traditionally been used for analyzing the behavior of complex real world problems. Even though only some features of the problems are considered, simulation time tends to become quite high even for common simulation problems. Parallel and distributed simulation is a viable technique for accelerating the simulations. The success of parallel simulation depends heavily on the combination of the simulation application, algorithm and message population in the simulation is sufficient, no additional delay is caused by this environment. In this thesis a conservative, parallel simulation algorithm is applied to the simulation of a cellular network application in a distributed workstation environment. This thesis presents a distributed simulation environment, Diworse, which is based on the use of networked workstations. The distributed environment is considered especially hard for conservative simulation algorithms due to the high cost of communication. In this thesis, however, the distributed environment is shown to be a viable alternative if the amount of communication is kept reasonable. Novel ideas of multiple message simulation and channel reduction enable efficient use of this environment for the simulation of a cellular network application. The distribution of the simulation is based on a modification of the well known Chandy-Misra deadlock avoidance algorithm with null messages. The basic Chandy Misra algorithm is modified by using the null message cancellation and multiple message simulation techniques. The modifications reduce the amount of null messages and the time required for their execution, thus reducing the simulation time required. The null message cancellation technique reduces the processing time of null messages as the arriving null message cancels other non processed null messages. The multiple message simulation forms groups of messages as it simulates several messages before it releases the new created messages. If the message population in the simulation is suffiecient, no additional delay is caused by this operation A new technique for considering the simulation application is also presented. The performance is improved by establishing a neighborhood for the simulation elements. The neighborhood concept is based on a channel reduction technique, where the properties of the application exclusively determine which connections are necessary when a certain accuracy for simulation results is required. Distributed simulation is also analyzed in order to find out the effect of the different elements in the implemented simulation environment. This analysis is performed by using critical path analysis. Critical path analysis allows determination of a lower bound for the simulation time. In this thesis critical times are computed for sequential and parallel traces. The analysis based on sequential traces reveals the parallel properties of the application whereas the analysis based on parallel traces reveals the properties of the environment and the distribution.

On Dynamic Monitoring Methods for Networks-on-Chip

Rapid ongoing evolution of multiprocessors will lead to systems with hundreds of processing cores integrated in a single chip. An emerging challenge is the implementation of reliable and efficient interconnection between these cores as well as other components in the systems. Network-on-Chip is an interconnection approach which is intended to solve the performance bottleneck caused by traditional, poorly scalable communication structures such as buses. However, a large on-chip network involves issues related to congestion problems and system control, for instance. Additionally, faults can cause problems in multiprocessor systems. These faults can be transient faults, permanent manufacturing faults, or they can appear due to aging. To solve the emerging traffic management, controllability issues and to maintain system operation regardless of faults a monitoring system is needed. The monitoring system should be dynamically applicable to various purposes and it should fully cover the system under observation. In a large multiprocessor the distances between components can be relatively long. Therefore, the system should be designed so that the amount of energy-inefficient long-distance communication is minimized. This thesis presents a dynamically clustered distributed monitoring structure. The monitoring is distributed so that no centralized control is required for basic tasks such as traffic management and task mapping. To enable extensive analysis of different Network-on-Chip architectures, an in-house SystemC based simulation environment was implemented. It allows transaction level analysis without time consuming circuit level implementations during early design phases of novel architectures and features. The presented analysis shows that the dynamically clustered monitoring structure can be efficiently utilized for traffic management in faulty and congested Network-on-Chip-based multiprocessor systems. The monitoring structure can be also successfully applied for task mapping purposes. Furthermore, the analysis shows that the presented in-house simulation environment is flexible and practical tool for extensive Network-on-Chip architecture analysis.

Video transcoding in a distributed cloud computing environment

Video transcoding refers to the process of converting a digital video from one format into another format. It is a compute-intensive operation. Therefore, transcoding of a large number of simultaneous video streams requires a large amount of computing resources. Moreover, to handle di erent load conditions in a cost-e cient manner, the video transcoding service should be dynamically scalable. Infrastructure as a Service Clouds currently offer computing resources, such as virtual machines, under the pay-per-use business model. Thus the IaaS Clouds can be leveraged to provide a coste cient, dynamically scalable video transcoding service. To use computing resources e ciently in a cloud computing environment, cost-e cient virtual machine provisioning is required to avoid overutilization and under-utilization of virtual machines. This thesis presents proactive virtual machine resource allocation and de-allocation algorithms for video transcoding in cloud computing. Since users' requests for videos may change at di erent times, a check is required to see if the current computing resources are adequate for the video requests. Therefore, the work on admission control is also provided. In addition to admission control, temporal resolution reduction is used to avoid jitters in a video. Furthermore, in a cloud computing environment such as Amazon EC2, the computing resources are more expensive as compared with the storage resources. Therefore, to avoid repetition of transcoding operations, a transcoded video needs to be stored for a certain time. To store all videos for the same amount of time is also not cost-e cient because popular transcoded videos have high access rate while unpopular transcoded videos are rarely accessed. This thesis provides a cost-e cient computation and storage trade-o strategy, which stores videos in the video repository as long as it is cost-e cient to store them. This thesis also proposes video segmentation strategies for bit rate reduction and spatial resolution reduction video transcoding. The evaluation of proposed strategies is performed using a message passing interface based video transcoder, which uses a coarse-grain parallel processing approach where video is segmented at group of pictures level.

Big Data Processing in the Cloud: a Hydra/Sufia Experience

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014