Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 39
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Teaching parallel programming in interdisciplinary studies

  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Moure, Juan C.|||0000-0001-6697-0331
  • Sikora, Anna|||0000-0003-0090-4109
  • Suppi, Remo|||0000-0002-0373-8292
Nowadays many fields of science and engineering are evolving by the joint contribution of complementary fields. Computer science, and especially high performance computing, has become a key factor in the development of many research fields, establishing a new paradigm called computational science. Researchers and professionals from many different fields require a knowledge of high performance computing, including parallel programming, to develop a fruitful work in their particular field. So, at Universitat Autònoma of Barcelona, an interdisciplinary master on Modeling for science and engineering was started 5 years ago to provide a deep knowledge on the application of modeling and simulation to graduate students on different fields (Mathematics, Physics, Chemistry, Engineering, Geology, etc.). In this master, Parallel Programming appears as a compulsory subject, because it is a key topic for them. The concepts learnt in parallel programming must be applied to real applications. Therefore, a subject on Applied Modelling and Simulation has also been included. In this paper, the experience on teaching parallel programming in such interdisciplinary master is shown. © Springer International Publishing Switzerland 2015. Ministerio de Economía y Competitividad.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Seguimiento y control de pacientes fumadores en proceso de deshabituación mediante SMS. Una experiencia en e-salud

  • Abella i Pons, Francesc
  • Vilarasau, Assumpció
  • Cuadrado, Josep
  • Solsona Tehàs, Francesc
  • Alves, Rui
  • Vilaplana Mayoral, Jordi
  • Serra, Joan
El consumo de tabaco continúa siendo una importante causa de morbilidad y mortalidad. El proceso terapéutico para abandonar el tabaco consiste en la desintoxicación física de la nicotina y en el mantenimiento de la abstinencia de su consumo. Nuestro estudio se sitúa en este contexto, ofreciendo una estrategia de apoyo por SMS y monitorizando al paciente a lo largo del tratamiento. Material y método. Este estudio longitudinal compara dos grupos de pacientes: uno con apoyo a través de SMS y otro, de control, que no disfruta de dicho apoyo. Los pacientes recibieron aleatoriamente mensajes de apoyo y refuerzo positivo, así como preguntas sobre su estado. El resto de la terapia es igual para ambos grupos. Resultados. El grupo que recibía apoyo por SMS presentó unas tasas de abstinencia mejores que el otro (57,1% frente a 42,9%). Los mismos participantes valoran positivamente la metodología y admiten que les ahorra tiempo y viajes. Conclusión. El uso de las TIC para monitorizar y reforzar el proceso de desintoxicación del consumo de tabaco parece ser efectivo y bien acogido por los pacientes., El presente trabajo ha sido financiado por el MICINN-Spain, mediante los contratos TIN2011-28689-C02-02 y BFU2010- 17704, por la Generalitat de Catalunya mediante los grupos de investigación 2009SGR809 y 2009SGR145 y por la European Social Fund.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

State-based predictions with self-correction on Enterprise Desktop Grid environments

  • Lérida Monsó, Josep Lluís
  • Solsona Tehàs, Francesc
  • Hernandez, Porfidio
  • Giné, Francesc
  • Hanzich, Mauricio
  • Conde Colom, Josep
The abundant computing resources in current organizations provide new opportunities for executing parallel scientific applications and using resources. The Enterprise Desktop Grid Computing (EDGC) paradigm addresses the potential for harvesting the idle computing resources of an organization’s desktop PCs to support the execution of the company’s large-scale applications. In these environments, the accuracy of response-time predictions is essential for effective metascheduling that maximizes resource usage without harming the performance of the parallel and local applications. However, this accuracy is a major challenge due to the heterogeneity and non-dedicated nature of EDGC resources. In this paper, two new prediction techniques are presented based on the state of resources. A thorough analysis by linear regression demonstrated that the proposed techniques capture the real behavior of the parallel applications better than other common techniques in the literature. Moreover, it is possible to reduce deviations with a proper modeling of prediction errors, and thus, a Self-adjustable Correction method (SAC) for detecting and correcting the prediction deviations was proposed with the ability to adapt to the changes in load conditions. An extensive evaluation in a real environment was conducted to validate the SAC method. The results show that the use of SAC increases the accuracy of response-time predictions by 35%. The cost of predictions with self-correction and its accuracy in a real environment was analyzed using a combination of the proposed techniques. The results demonstrate that the cost of predictions is negligible and the combined use of the prediction techniques is preferable., This work was supported by the Spanish Ministry of Science and Technology under grant No. TIN2011-28689-C02-02 and No. TIN2010-18978.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Computer-assisted initial diagnosis of rare diseases

  • Alves, Rui
  • Piñol, Marc
  • Vilaplana Mayoral, Jordi
  • Teixidó Torrelles, Ivan
  • Cruz, Joaquim
  • Comas, Jorge
  • Vilaprinyo Terré, Ester
  • Sorribas Tello, Albert
  • Solsona Tehàs, Francesc
Introduction. Most documented rare diseases have genetic origin. Because of their low individual frequency, an initial diagnosis based on phenotypic symptoms is not always easy, as practitioners might never have been exposed to patients suffering from the relevant disease. It is thus important to develop tools that facilitate symptom-based initial diagnosis of rare diseases by clinicians. In this work we aimed at developing a computational approach to aid in that initial diagnosis. We also aimed at implementing this approach in a user friendly web prototype. We call this tool Rare Disease Discovery. Finally, we also aimed at testing the performance of the prototype. Methods. Rare Disease Discovery uses the publicly available ORPHANET data set of association between rare diseases and their symptoms to automatically predict the most likely rare diseases based on a patient’s symptoms. We apply the method to retrospectively diagnose a cohort of 187 rare disease patients with confirmed diagnosis. Subsequently we test the precision, sensitivity, and global performance of the system under different scenarios by running large scale Monte Carlo simulations. All settings account for situations where absent and/or unrelated symptoms are considered in the diagnosis. Results. We find that this expert system has high diagnostic precision (≥80%) and sensitivity (≥99%), and is robust to both absent and unrelated symptoms. Discussion. The Rare Disease Discovery prediction engine appears to provide a fast and robust method for initial assisted differential diagnosis of rare diseases. We coupled this engine with a user-friendly web interface and it can be freely accessed at http://disease-discovery.udl.cat/. The code and most current database for the whole project can be downloaded from https://github.com/Wrrzag/DiseaseDiscovery/tree/no_classifiers., This work was partially supported by the MEyC under contracts TIN2014-53234-C2- 2-R, TIN2011-28689-C02-02 and BFU2010-17704 and by Universitat de Lleida and Departament de Ciències Mèdiques Bàsiques with bridge grants to RA. The authors are members of the research groups 2014-SGR163 and 2014-SGR243, funded by the Generalitat de Catalunya.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment

  • Teixidó Torrelles, Ivan
  • Sebé Feixas, Francesc
  • Conde Colom, Josep
  • Solsona Tehàs, Francesc
In recent years, several lightweight cryptographic protocols whose security lies in the assumed intractability of the learning parity with noise (LPN) problem have been proposed. The LPN problem has been shown to be solvable in subexponential time by algorithms that have very large (subexponential) memory requirements, which limits their practical applicability. When the memory resources are constrained, a brute-force search is the only known way of solving the LPN problem. In this paper, we propose a new parallel implementation, called Parallel-LPN, of an enhanced algorithm to solve the LPN problem. We implemented the Parallel-LPN in C and MPI (Message Passing Interface), and it was tested on a cluster system, where we obtained a quasi-linear speedup of approximately 90%. We also proposed a new algorithm by using combinatorial objects that enhances the ParallelLPN performance and its serial version., This work was supported by the Ministerio de Ciencia e Innovación (Spain) under Contracts TIN2011-28689-C02-02, CSD- 2007-00050, CSD-2007-0004 and the European Social Fund. The authors are members of the research groups 2009SGR145 and 2009SGR442, which are funded by the Generalitat de Catalunya (Spain).
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Design of a P2P network that protects users’ privacy in front of Web Search Engines

  • Romero-Tris, Cristina
  • Castellà Martínez, Damià
  • Viejo Galicia, Alexandre
  • Castellà Roca, Jordi
  • Solsona Tehàs, Francesc
  • Mateo-Sanz, Josep María
Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though this service is positive for the users, their profiles may contain sensitive information that can threaten their privacy. Literature in this field stresses the existence of a trade-off between the level of privacy achieved and the quality of service received. Current proposals try to maximize this trade-off, yet we argue that there is still room for improvement. In this paper, we present a new approach which improves the trade-off by grouping users who share similar profiles. Moreover, our new proposal is based on a hybrid P2P architecture that outperforms current schemes in terms of scalability. The proposed system has been tested in terms of performance and privacy achieved, using real data from the AOL dataset. Simulation results show that: (i) the system protects users’ privacy when they behave honestly, and penalizes selfish users; (ii) it supports a large number of users; (iii) the runtime required to group users is affordable; and (iv) groups are dynamic and their topology is unpredictable, which we argue that is positive from the privacy point of view., This work was partly supported by the Spanish Ministry of Science and Innovation (through Projects eAEGIS TSI2007-65406-C03-01, CO-PRIVACY TIN2011-27076- C03-01, ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, Audit Transparency Voting Process IPT-430000-2010-31 and Ballot Next IPT-2012-0603-430000) and by the Government of Catalonia (under Grant 2009 SGR 1135). Francesc Solsona and Damià Castellà are funded by the MEyC under Contract TIN2011-28689-C02-02. Francesc Solsona is a member of the research group 2009 SGR145, funded by Government of Catalonia.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

H-PC: a cloud computing tool for supervising hypertensive patients

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Abella i Pons, Francesc
  • Cuadrado, Josep
  • Teixidó Torrelles, Ivan
  • Mateo Fornés, Jordi
  • Rius Torrentó, Josep Maria
Hypertension or high blood pressure is a condition on the rise. Not only does it affect the elderly but it is also increasingly spreading to younger sectors of the population. Treating it involves exhaustive monitoring of patients. Current health services can be improved to perform this task more effectively. A tool adapted to the particular requirements of hypertension can greatly facilitate monitoring and diagnosis. This paper presents the computer application Hypertension Patient Control (H-PC), which allows patients with hypertension to send their readings through mobile phone Short Message Service (SMS) or e-mail to a cloud computing datacenter. Through a graphic interface, clinicians can keep track of their patients, thus facilitating monitoring. Cloud-based datacenters provide a series of advantages in terms of scalability, maintainability, and massive data processing. However, the ability to guarantee Quality of Service (QoS) is crucial for the commercial success of cloud platforms. A novel and efficient cloud-based platform managing H-PC with QoS is also proposed in this paper, This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Biblio-MetReS for user-friendly mining of genes and biological processes in scientific documents

  • Usié Chimenos, Anabel
  • Karathia, Hiren
  • Teixidó Torrelles, Ivan
  • Alves, Rui
  • Solsona Tehàs, Francesc
One way to initiate the reconstruction of molecular circuits is by using automated text-mining techniques. Developing more efficient methods for such reconstruction is a topic of active research, and those methods are typically included by bioinfor- maticians in pipelines used to mine and curate large literature datasets. Nevertheless, experimental biologists have a limited number of available user-friendly tools that use text-mining for network reconstruction and require no programming skills to use. One of these tools is Biblio-MetReS. Originally, this tool permitted an on-the-fly analysis of documents contained in a number of web-based literature databases to identify co-occurrence of proteins/genes. This approach ensured results that were always up-to-date with the latest live version of the databases. However, this `up-to- dateness' came at the cost of large execution times. Here we report an evolution of the application Biblio-MetReS that permits constructing co-occurrence networks for genes, GO processes, Pathways, or any combination of the three types of entities and graphically represent those entities.We show that the performance of Biblio- MetReS in identifying gene co-occurrence is as least as good as that of other com- parable applications (STRING and iHOP). In addition, we also show that the iden- tification of GO processes is on par to that reported in the latest BioCreAtIvE chal- lenge. Finally, we also report the implementation of a new strategy that combines on-the-fly analysis of new documents with preprocessed information from docu- ments that were encountered in previous analyses. This combination simultaneously decreases program run time and maintains `up-to-dateness' of the results., RA was partially supported by the Ministerio de Ciencia e Innovación (MICINN, Spain through grant BFU2010-17704). FS was partially funded by the MICINN, with grants TIN2011-28689-C02-02. The authors are members of the research groups 2009SGR809 and 2009SGR145, funded by the “Generalitat de Catalunya”. AU is funded by a Generalitat de Catalunya (AGAUR) PhD fellowship. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

FingerScanner: Embedding a Fingerprint Scanner in a Raspberry Pi

  • Sapes, Jordi
  • Solsona Tehàs, Francesc
Nowadays, researchers are paying increasing attention to embedding systems. Cost reduction has lead to an increase in the number of platforms supporting the operating system Linux, jointly with the Raspberry Pi motherboard. Thus, embedding devices on Raspberry-Linux systems is a goal in order to make competitive commercial products. This paper presents a low-cost fingerprint recognition system embedded into a Raspberry Pi with Linux, This work was supported by the MEyC under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research was partly supported by the European Union FEDER (CAPAP-H5network TIN2014-53522-REDT).
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

TControl: A mobile app to follow up tobacco-quitting patients

  • Pifarré Montalà, Marc
  • Carrera Peruga, Adrián
  • Vilaplana Mayoral, Jordi
  • Cuadrado, Josep
  • Solsona, Sara
  • Abella i Pons, Francesc
  • Solsona Tehàs, Francesc
  • Alves, Rui
Background and Objective Tobacco smoking is a major risk factor for a wide range of respiratory and circulatory diseases in active and passive smokers. Well-designed campaigns are raising awareness to the problem and an increasing number of smokers seeks medical assistance to quit their habit. In this context, there is the need to develop mHealth Apps that assist and manage large smoke quitting programs in efficient and economic ways. Objectives Our main objective is to develop an efficient and free mHealth app that facilitates the management of, and assistance to, people who want to quit smoking. As secondary objectives, our research also aims at estimating the economic effect of deploying that App in the public health system. Methods Using JAVA and XML we develop and deploy a new free mHealth App for Android, called TControl (Tobacco-quitting Control). We deploy the App at the Tobacco Unit of the Santa Maria Hospital in Lleida and determine its stability by following the crashes of the App. We also use a survey to test usability of the app and differences in aptitude for using the App in a sample of 31 patients. Finally, we use mathematical models to estimate the economic effect of deploying TControl in the Catalan public health system. Results TControl keeps track of the smoke-quitting users, tracking their status, interpreting it, and offering advice and psychological support messages. The App also provides a bidirectional communication channel between patients and clinicians via mobile text messages. Additionally, registered patients have the option to interchange experiences with each other by chat. The App was found to be stable and to have high performances during startup and message sending. Our results suggest that age and gender have no statistically significant effect on patient aptitude for using TControl. Finally, we estimate that TControl could reduce costs for the Catalan public health system (CPHS) by up to € 400M in 10 years. Conclusions TControl is a stable and well behaved App, typically operating near optimal performance. It can be used independent of age and gender, and its wide implementation could decrease costs for the public health system., This work was supported by the Ministerio de Economía y Competitividad under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT).
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Recovering accuracy methods for scalable consistency library

  • Lladós Segura, Jordi
  • Guirado Fernández, Fernando
  • Cores Prado, Fernando
  • Lérida Monsó, Josep Lluís
  • Notredame, Cedric
Multiple sequence alignment (MSA) is crucial for high-throughput next generation sequencing applications. Large-scale alignments with thousands of sequences are necessary for these applications. However, the quality of the alignment of current MSA tools decreases sharply when the number of sequences grows to several thousand. This accuracy degradation can be mitigated using global consistency information as in the T-Coffee MSA-Tool, which implements a consistency library. However, consistency-based methods do not scale well because of the computational resources required to calculate and store the consistency information, which grows quadratically. In this paper, we propose an alternative method for building the consistency-library. To allow unlimited scalability, consistency information must be discarded to avoid exceeding the environment memory. Our first approach deals with the memory limitation by identifying the most important entries, which provide better consistency. This method is able to achieve scalability, although there is a negative impact on accuracy. The second proposal, aims to reduce this degradation of accuracy, with three different methods presented to attain a better alignment., This work has been supported by the Government of Spain TIN2011-28689-C02-02. Cedric Notredame is funded by the Plan Nacional BFU2011-28575 and The Quantomics project (KBBE- 2A-222664).
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform

  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
  • Naranjo, J. A. M.
  • Casado, L. G.
CodiP2P is a distributed platform for computation based on the peer-topeer paradigm. This article presents a novel distributed authentication method that suits the platform and adapts to its characteristics. The developed method is based on the Web of Trust paradigm, i.e., not depending on a traditional PKI infrastructure, and focuses on efficiency both in the number of messages transmitted and digital signatures processed by exploiting the inherent locality found in the platform. As part of the method, a reliable and efficient distributed public key repository is developed taking CoDiP2P’s de Bruijn topology as a cornerstone., This work is supported by the CAPAP-H3 network (TIN2010-12011-E), the Spanish Ministry of Science and Innovation (TIN2008-01117 and TIN2011-28689-C02-02), and Junta de Andalucía (P11-TIC-7176), in part financed by the European Regional Development Fund (ERDF).
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

A Green Strategy for Federated and Heterogeneous Clouds with Communicating Workloads

  • Mateo Fornés, Jordi
  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Pla Aragonés, Lluís Miquel
  • Lérida Monsó, Josep Lluís
Providers of cloud environments must tackle the challenge of configuring their system to provide maximal performance while minimizing the cost of resources used. However, at the same time, they must guarantee an SLA (service-level agreement) to the users. The SLA is usually associated with a certain level of QoS (quality of service). As response time is perhaps the most widely used QoS metric, it was also the one chosen in this work. This paper presents a green strategy (GS) model for heterogeneous cloud systems. We provide a solution for heterogeneous job-communicating tasks and heterogeneous VMs that make up the nodes of the cloud. In addition to guaranteeing the SLA, the main goal is to optimize energy savings. The solution results in an equation that must be solved by a solver with nonlinear capabilities. The results obtained from modelling the policies to be executed by a solver demonstrate the applicability of our proposal for saving energy and guaranteeing the SLA., This work was supported by the MEYC under Contracts TIN2011-28689-C02-02. The authors are members of the research groups 2009-SGR145 and 2014-SGR163, funded by the Generalitat de Catalunya.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

A queuing theory model for cloud computing

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Teixidó Torrelles, Ivan
  • Mateo Fornés, Jordi
  • Abella i Pons, Francesc
  • Rius Torrentó, Josep Maria
The ability to deliver guaranteed QoS (Quality of Service) is crucial for the commercial success of cloud platforms. This paper presents a model based on queuing theory to study computer service QoS in cloud computing. Cloud platforms are modeled with an open Jackson network that can be used to determine and measure the QoS guarantees the cloud can offer regarding the response time. The analysis can be performed according to different parameters, such as the arrival rate of customer services and the number and service rate of processing servers, among others. Detailed results for the model are presented. When scaling the system and depending on the types of bottleneck in the system, we show how our model can provide us with the best option to guarantee QoS. The results obtained confirm the usefulness of the model presented for designing real cloud computing systems., This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

CheNER: a tool for the identification of chemical entities and their classes in biomedical literature

  • Solsona Tehàs, Francesc
  • Alves, Rui
  • Usié Chimenos, Anabel
  • Cruz, Joaquim
  • Comas, Jorge
Background: Small chemical molecules regulate biological processes at the molecular level. Those molecules are often involved in causing or treating pathological states. Automatically identifying such molecules in biomedical text is difficult due to both, the diverse morphology of chemical names and the alternative types of nomenclature that are simultaneously used to describe them. To address these issues, the last BioCreAtIvE challenge proposed a CHEMDNER task, which is a Named Entity Recognition (NER) challenge that aims at labelling different types of chemical names in biomedical text. Methods: To address this challenge we tested various approaches to recognizing chemical entities in biomedical documents. These approaches range from linear Conditional Random Fields (CRFs) to a combination of CRFs with regular expression and dictionary matching, followed by a post-processing step to tag those chemical names in a corpus of Medline abstracts. We named our best performing systems CheNER. Results: We evaluate the performance of the various approaches using the F-score statistics. Higher F-scores indicate better performance. The highest F-score we obtain in identifying unique chemical entities is 72.88%. The highest F-score we obtain in identifying all chemical entities is 73.07%. We also evaluate the F-Score of combining our system with ChemSpot, and find an increase from 72.88% to 73.83%. Conclusions: CheNER presents a valid alternative for automated annotation of chemical entities in biomedical documents. In addition, CheNER may be used to derive new features to train newer methods for tagging chemical entities. CheNER can be downloaded from http://metres.udl.cat and included in text annotation pipelines., Funding for publication of this article comes from grants BFU2010-17704 and TIN2011-28689-C02-02 from the Spanish Ministry of Economy and Competitiveness.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

The cloud paradigm applied to e-Health

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Abella i Pons, Francesc
  • Filgueira, Rosa
  • Rius Torrentó, Josep Maria
Background: Cloud computing is a new paradigm that is changing how enterprises, institutions and people understand, perceive and use current software systems. With this paradigm, the organizations have no need to maintain their own servers, nor host their own software. Instead, everything is moved to the cloud and provided on demand, saving energy, physical space and technical staff. Cloud-based system architectures provide many advantages in terms of scalability, maintainability and massive data processing. Methods: We present the design of an e-health cloud system, modelled by an M/M/m queue with QoS capabilities, i.e. maximum waiting time of requests. Results: Detailed results for the model formed by a Jackson network of two M/M/m queues from the queueing theory perspective are presented. These results show a significant performance improvement when the number of servers increases. Conclusions: Platform scalability becomes a critical issue since we aim to provide the system with high Quality of Service (QoS). In this paper we define an architecture capable of adapting itself to different diseases and growing numbers of patients. This platform could be applied to the medical field to greatly enhance the results of those therapies that have an important psychological component, such as addictions and chronic diseases., This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Recovering accuracy methods for scalable consistency library

  • Lladós Segura, Jordi
  • Guirado Fernández, Fernando
  • Cores Prado, Fernando
  • Lérida Monsó, Josep Lluís
  • Notredame, Cedric
Multiple sequence alignment (MSA) is crucial for high-throughput next generation sequencing applications. Large-scale alignments with thousands of sequences are necessary for these applications. However, the quality of the alignment of current MSA tools decreases sharply when the number of sequences grows to several thousand. This accuracy degradation can be mitigated using global consistency information as in the T-Coffee MSA-Tool, which implements a consistency library. However, consistency-based methods do not scale well because of the computational resources required to calculate and store the consistency information, which grows quadratically. In this paper, we propose an alternative method for building the consistency-library. To allow unlimited scalability, consistency information must be discarded to avoid exceeding the environment memory. Our first approach deals with the memory limitation by identifying the most important entries, which provide better consistency. This method is able to achieve scalability, although there is a negative impact on accuracy. The second proposal, aims to reduce this degradation of accuracy, with three different methods presented to attain a better alignment., This work has been supported by the Government of Spain TIN2011-28689-C02-02. Cedric Notredame is funded by the Plan Nacional BFU2011-28575 and The Quantomics project (KBBE- 2A-222664).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A Green Strategy for Federated and Heterogeneous Clouds with Communicating Workloads

  • Mateo Fornés, Jordi
  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Pla Aragonés, Lluís Miquel
  • Lérida Monsó, Josep Lluís
Providers of cloud environments must tackle the challenge of configuring their system to provide maximal performance while minimizing the cost of resources used. However, at the same time, they must guarantee an SLA (service-level agreement) to the users. The SLA is usually associated with a certain level of QoS (quality of service). As response time is perhaps the most widely used QoS metric, it was also the one chosen in this work. This paper presents a green strategy (GS) model for heterogeneous cloud systems. We provide a solution for heterogeneous job-communicating tasks and heterogeneous VMs that make up the nodes of the cloud. In addition to guaranteeing the SLA, the main goal is to optimize energy savings. The solution results in an equation that must be solved by a solver with nonlinear capabilities. The results obtained from modelling the policies to be executed by a solver demonstrate the applicability of our proposal for saving energy and guaranteeing the SLA., This work was supported by the MEYC under Contracts TIN2011-28689-C02-02. The authors are members of the research groups 2009-SGR145 and 2014-SGR163, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

State-based predictions with self-correction on Enterprise Desktop Grid environments

  • Lérida Monsó, Josep Lluís
  • Solsona Tehàs, Francesc
  • Hernandez, Porfidio
  • Giné, Francesc
  • Hanzich, Mauricio
  • Conde Colom, Josep
The abundant computing resources in current organizations provide new opportunities for executing parallel scientific applications and using resources. The Enterprise Desktop Grid Computing (EDGC) paradigm addresses the potential for harvesting the idle computing resources of an organization’s desktop PCs to support the execution of the company’s large-scale applications. In these environments, the accuracy of response-time predictions is essential for effective metascheduling that maximizes resource usage without harming the performance of the parallel and local applications. However, this accuracy is a major challenge due to the heterogeneity and non-dedicated nature of EDGC resources. In this paper, two new prediction techniques are presented based on the state of resources. A thorough analysis by linear regression demonstrated that the proposed techniques capture the real behavior of the parallel applications better than other common techniques in the literature. Moreover, it is possible to reduce deviations with a proper modeling of prediction errors, and thus, a Self-adjustable Correction method (SAC) for detecting and correcting the prediction deviations was proposed with the ability to adapt to the changes in load conditions. An extensive evaluation in a real environment was conducted to validate the SAC method. The results show that the use of SAC increases the accuracy of response-time predictions by 35%. The cost of predictions with self-correction and its accuracy in a real environment was analyzed using a combination of the proposed techniques. The results demonstrate that the cost of predictions is negligible and the combined use of the prediction techniques is preferable., This work was supported by the Spanish Ministry of Science and Technology under grant No. TIN2011-28689-C02-02 and No. TIN2010-18978.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The cloud paradigm applied to e-Health

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Abella i Pons, Francesc
  • Filgueira, Rosa
  • Rius Torrentó, Josep Maria
Background: Cloud computing is a new paradigm that is changing how enterprises, institutions and people understand, perceive and use current software systems. With this paradigm, the organizations have no need to maintain their own servers, nor host their own software. Instead, everything is moved to the cloud and provided on demand, saving energy, physical space and technical staff. Cloud-based system architectures provide many advantages in terms of scalability, maintainability and massive data processing. Methods: We present the design of an e-health cloud system, modelled by an M/M/m queue with QoS capabilities, i.e. maximum waiting time of requests. Results: Detailed results for the model formed by a Jackson network of two M/M/m queues from the queueing theory perspective are presented. These results show a significant performance improvement when the number of servers increases. Conclusions: Platform scalability becomes a critical issue since we aim to provide the system with high Quality of Service (QoS). In this paper we define an architecture capable of adapting itself to different diseases and growing numbers of patients. This platform could be applied to the medical field to greatly enhance the results of those therapies that have an important psychological component, such as addictions and chronic diseases., This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

TControl: A mobile app to follow up tobacco-quitting patients

  • Pifarré Montalà, Marc
  • Carrera Peruga, Adrián
  • Vilaplana Mayoral, Jordi
  • Cuadrado, Josep
  • Solsona, Sara
  • Abella i Pons, Francesc
  • Solsona Tehàs, Francesc
  • Alves, Rui
Background and Objective Tobacco smoking is a major risk factor for a wide range of respiratory and circulatory diseases in active and passive smokers. Well-designed campaigns are raising awareness to the problem and an increasing number of smokers seeks medical assistance to quit their habit. In this context, there is the need to develop mHealth Apps that assist and manage large smoke quitting programs in efficient and economic ways. Objectives Our main objective is to develop an efficient and free mHealth app that facilitates the management of, and assistance to, people who want to quit smoking. As secondary objectives, our research also aims at estimating the economic effect of deploying that App in the public health system. Methods Using JAVA and XML we develop and deploy a new free mHealth App for Android, called TControl (Tobacco-quitting Control). We deploy the App at the Tobacco Unit of the Santa Maria Hospital in Lleida and determine its stability by following the crashes of the App. We also use a survey to test usability of the app and differences in aptitude for using the App in a sample of 31 patients. Finally, we use mathematical models to estimate the economic effect of deploying TControl in the Catalan public health system. Results TControl keeps track of the smoke-quitting users, tracking their status, interpreting it, and offering advice and psychological support messages. The App also provides a bidirectional communication channel between patients and clinicians via mobile text messages. Additionally, registered patients have the option to interchange experiences with each other by chat. The App was found to be stable and to have high performances during startup and message sending. Our results suggest that age and gender have no statistically significant effect on patient aptitude for using TControl. Finally, we estimate that TControl could reduce costs for the Catalan public health system (CPHS) by up to € 400M in 10 years. Conclusions TControl is a stable and well behaved App, typically operating near optimal performance. It can be used independent of age and gender, and its wide implementation could decrease costs for the public health system., This work was supported by the Ministerio de Economía y Competitividad under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

H-PC: a cloud computing tool for supervising hypertensive patients

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Abella i Pons, Francesc
  • Cuadrado, Josep
  • Teixidó Torrelles, Ivan
  • Mateo Fornés, Jordi
  • Rius Torrentó, Josep Maria
Hypertension or high blood pressure is a condition on the rise. Not only does it affect the elderly but it is also increasingly spreading to younger sectors of the population. Treating it involves exhaustive monitoring of patients. Current health services can be improved to perform this task more effectively. A tool adapted to the particular requirements of hypertension can greatly facilitate monitoring and diagnosis. This paper presents the computer application Hypertension Patient Control (H-PC), which allows patients with hypertension to send their readings through mobile phone Short Message Service (SMS) or e-mail to a cloud computing datacenter. Through a graphic interface, clinicians can keep track of their patients, thus facilitating monitoring. Cloud-based datacenters provide a series of advantages in terms of scalability, maintainability, and massive data processing. However, the ability to guarantee Quality of Service (QoS) is crucial for the commercial success of cloud platforms. A novel and efficient cloud-based platform managing H-PC with QoS is also proposed in this paper, This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform

  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
  • Naranjo, J. A. M.
  • Casado, L. G.
CodiP2P is a distributed platform for computation based on the peer-topeer paradigm. This article presents a novel distributed authentication method that suits the platform and adapts to its characteristics. The developed method is based on the Web of Trust paradigm, i.e., not depending on a traditional PKI infrastructure, and focuses on efficiency both in the number of messages transmitted and digital signatures processed by exploiting the inherent locality found in the platform. As part of the method, a reliable and efficient distributed public key repository is developed taking CoDiP2P’s de Bruijn topology as a cornerstone., This work is supported by the CAPAP-H3 network (TIN2010-12011-E), the Spanish Ministry of Science and Innovation (TIN2008-01117 and TIN2011-28689-C02-02), and Junta de Andalucía (P11-TIC-7176), in part financed by the European Regional Development Fund (ERDF).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

CheNER: a tool for the identification of chemical entities and their classes in biomedical literature

  • Solsona Tehàs, Francesc
  • Alves, Rui
  • Usié Chimenos, Anabel
  • Cruz, Joaquim
  • Comas, Jorge
Background: Small chemical molecules regulate biological processes at the molecular level. Those molecules are often involved in causing or treating pathological states. Automatically identifying such molecules in biomedical text is difficult due to both, the diverse morphology of chemical names and the alternative types of nomenclature that are simultaneously used to describe them. To address these issues, the last BioCreAtIvE challenge proposed a CHEMDNER task, which is a Named Entity Recognition (NER) challenge that aims at labelling different types of chemical names in biomedical text. Methods: To address this challenge we tested various approaches to recognizing chemical entities in biomedical documents. These approaches range from linear Conditional Random Fields (CRFs) to a combination of CRFs with regular expression and dictionary matching, followed by a post-processing step to tag those chemical names in a corpus of Medline abstracts. We named our best performing systems CheNER. Results: We evaluate the performance of the various approaches using the F-score statistics. Higher F-scores indicate better performance. The highest F-score we obtain in identifying unique chemical entities is 72.88%. The highest F-score we obtain in identifying all chemical entities is 73.07%. We also evaluate the F-Score of combining our system with ChemSpot, and find an increase from 72.88% to 73.83%. Conclusions: CheNER presents a valid alternative for automated annotation of chemical entities in biomedical documents. In addition, CheNER may be used to derive new features to train newer methods for tagging chemical entities. CheNER can be downloaded from http://metres.udl.cat and included in text annotation pipelines., Funding for publication of this article comes from grants BFU2010-17704 and TIN2011-28689-C02-02 from the Spanish Ministry of Economy and Competitiveness.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

FingerScanner: Embedding a Fingerprint Scanner in a Raspberry Pi

  • Sapes, Jordi
  • Solsona Tehàs, Francesc
Nowadays, researchers are paying increasing attention to embedding systems. Cost reduction has lead to an increase in the number of platforms supporting the operating system Linux, jointly with the Raspberry Pi motherboard. Thus, embedding devices on Raspberry-Linux systems is a goal in order to make competitive commercial products. This paper presents a low-cost fingerprint recognition system embedded into a Raspberry Pi with Linux, This work was supported by the MEyC under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research was partly supported by the European Union FEDER (CAPAP-H5network TIN2014-53522-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Seguimiento y control de pacientes fumadores en proceso de deshabituación mediante SMS. Una experiencia en e-salud

  • Abella i Pons, Francesc
  • Vilarasau, Assumpció
  • Cuadrado, Josep
  • Solsona Tehàs, Francesc
  • Alves, Rui
  • Vilaplana Mayoral, Jordi
  • Serra, Joan
El consumo de tabaco continúa siendo una importante causa de morbilidad y mortalidad. El proceso terapéutico para abandonar el tabaco consiste en la desintoxicación física de la nicotina y en el mantenimiento de la abstinencia de su consumo. Nuestro estudio se sitúa en este contexto, ofreciendo una estrategia de apoyo por SMS y monitorizando al paciente a lo largo del tratamiento. Material y método. Este estudio longitudinal compara dos grupos de pacientes: uno con apoyo a través de SMS y otro, de control, que no disfruta de dicho apoyo. Los pacientes recibieron aleatoriamente mensajes de apoyo y refuerzo positivo, así como preguntas sobre su estado. El resto de la terapia es igual para ambos grupos. Resultados. El grupo que recibía apoyo por SMS presentó unas tasas de abstinencia mejores que el otro (57,1% frente a 42,9%). Los mismos participantes valoran positivamente la metodología y admiten que les ahorra tiempo y viajes. Conclusión. El uso de las TIC para monitorizar y reforzar el proceso de desintoxicación del consumo de tabaco parece ser efectivo y bien acogido por los pacientes., El presente trabajo ha sido financiado por el MICINN-Spain, mediante los contratos TIN2011-28689-C02-02 y BFU2010- 17704, por la Generalitat de Catalunya mediante los grupos de investigación 2009SGR809 y 2009SGR145 y por la European Social Fund.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Computer-assisted initial diagnosis of rare diseases

  • Alves, Rui
  • Piñol, Marc
  • Vilaplana Mayoral, Jordi
  • Teixidó Torrelles, Ivan
  • Cruz, Joaquim
  • Comas, Jorge
  • Vilaprinyo Terré, Ester
  • Sorribas Tello, Albert
  • Solsona Tehàs, Francesc
Introduction. Most documented rare diseases have genetic origin. Because of their low individual frequency, an initial diagnosis based on phenotypic symptoms is not always easy, as practitioners might never have been exposed to patients suffering from the relevant disease. It is thus important to develop tools that facilitate symptom-based initial diagnosis of rare diseases by clinicians. In this work we aimed at developing a computational approach to aid in that initial diagnosis. We also aimed at implementing this approach in a user friendly web prototype. We call this tool Rare Disease Discovery. Finally, we also aimed at testing the performance of the prototype. Methods. Rare Disease Discovery uses the publicly available ORPHANET data set of association between rare diseases and their symptoms to automatically predict the most likely rare diseases based on a patient’s symptoms. We apply the method to retrospectively diagnose a cohort of 187 rare disease patients with confirmed diagnosis. Subsequently we test the precision, sensitivity, and global performance of the system under different scenarios by running large scale Monte Carlo simulations. All settings account for situations where absent and/or unrelated symptoms are considered in the diagnosis. Results. We find that this expert system has high diagnostic precision (≥80%) and sensitivity (≥99%), and is robust to both absent and unrelated symptoms. Discussion. The Rare Disease Discovery prediction engine appears to provide a fast and robust method for initial assisted differential diagnosis of rare diseases. We coupled this engine with a user-friendly web interface and it can be freely accessed at http://disease-discovery.udl.cat/. The code and most current database for the whole project can be downloaded from https://github.com/Wrrzag/DiseaseDiscovery/tree/no_classifiers., This work was partially supported by the MEyC under contracts TIN2014-53234-C2- 2-R, TIN2011-28689-C02-02 and BFU2010-17704 and by Universitat de Lleida and Departament de Ciències Mèdiques Bàsiques with bridge grants to RA. The authors are members of the research groups 2014-SGR163 and 2014-SGR243, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Biblio-MetReS for user-friendly mining of genes and biological processes in scientific documents

  • Usié Chimenos, Anabel
  • Karathia, Hiren
  • Teixidó Torrelles, Ivan
  • Alves, Rui
  • Solsona Tehàs, Francesc
One way to initiate the reconstruction of molecular circuits is by using automated text-mining techniques. Developing more efficient methods for such reconstruction is a topic of active research, and those methods are typically included by bioinfor- maticians in pipelines used to mine and curate large literature datasets. Nevertheless, experimental biologists have a limited number of available user-friendly tools that use text-mining for network reconstruction and require no programming skills to use. One of these tools is Biblio-MetReS. Originally, this tool permitted an on-the-fly analysis of documents contained in a number of web-based literature databases to identify co-occurrence of proteins/genes. This approach ensured results that were always up-to-date with the latest live version of the databases. However, this `up-to- dateness' came at the cost of large execution times. Here we report an evolution of the application Biblio-MetReS that permits constructing co-occurrence networks for genes, GO processes, Pathways, or any combination of the three types of entities and graphically represent those entities.We show that the performance of Biblio- MetReS in identifying gene co-occurrence is as least as good as that of other com- parable applications (STRING and iHOP). In addition, we also show that the iden- tification of GO processes is on par to that reported in the latest BioCreAtIvE chal- lenge. Finally, we also report the implementation of a new strategy that combines on-the-fly analysis of new documents with preprocessed information from docu- ments that were encountered in previous analyses. This combination simultaneously decreases program run time and maintains `up-to-dateness' of the results., RA was partially supported by the Ministerio de Ciencia e Innovación (MICINN, Spain through grant BFU2010-17704). FS was partially funded by the MICINN, with grants TIN2011-28689-C02-02. The authors are members of the research groups 2009SGR809 and 2009SGR145, funded by the “Generalitat de Catalunya”. AU is funded by a Generalitat de Catalunya (AGAUR) PhD fellowship. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Design of a P2P network that protects users’ privacy in front of Web Search Engines

  • Romero-Tris, Cristina
  • Castellà Martínez, Damià
  • Viejo Galicia, Alexandre
  • Castellà Roca, Jordi
  • Solsona Tehàs, Francesc
  • Mateo-Sanz, Josep María
Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though this service is positive for the users, their profiles may contain sensitive information that can threaten their privacy. Literature in this field stresses the existence of a trade-off between the level of privacy achieved and the quality of service received. Current proposals try to maximize this trade-off, yet we argue that there is still room for improvement. In this paper, we present a new approach which improves the trade-off by grouping users who share similar profiles. Moreover, our new proposal is based on a hybrid P2P architecture that outperforms current schemes in terms of scalability. The proposed system has been tested in terms of performance and privacy achieved, using real data from the AOL dataset. Simulation results show that: (i) the system protects users’ privacy when they behave honestly, and penalizes selfish users; (ii) it supports a large number of users; (iii) the runtime required to group users is affordable; and (iv) groups are dynamic and their topology is unpredictable, which we argue that is positive from the privacy point of view., This work was partly supported by the Spanish Ministry of Science and Innovation (through Projects eAEGIS TSI2007-65406-C03-01, CO-PRIVACY TIN2011-27076- C03-01, ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, Audit Transparency Voting Process IPT-430000-2010-31 and Ballot Next IPT-2012-0603-430000) and by the Government of Catalonia (under Grant 2009 SGR 1135). Francesc Solsona and Damià Castellà are funded by the MEyC under Contract TIN2011-28689-C02-02. Francesc Solsona is a member of the research group 2009 SGR145, funded by Government of Catalonia.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A queuing theory model for cloud computing

  • Vilaplana Mayoral, Jordi
  • Solsona Tehàs, Francesc
  • Teixidó Torrelles, Ivan
  • Mateo Fornés, Jordi
  • Abella i Pons, Francesc
  • Rius Torrentó, Josep Maria
The ability to deliver guaranteed QoS (Quality of Service) is crucial for the commercial success of cloud platforms. This paper presents a model based on queuing theory to study computer service QoS in cloud computing. Cloud platforms are modeled with an open Jackson network that can be used to determine and measure the QoS guarantees the cloud can offer regarding the response time. The analysis can be performed according to different parameters, such as the arrival rate of customer services and the number and service rate of processing servers, among others. Detailed results for the model are presented. When scaling the system and depending on the types of bottleneck in the system, we show how our model can provide us with the best option to guarantee QoS. The results obtained confirm the usefulness of the model presented for designing real cloud computing systems., This work was supported by the MEyC under contract TIN2011-28689-C02-02. Some of the authors are members of the research group 2009 SGR145, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment

  • Teixidó Torrelles, Ivan
  • Sebé Feixas, Francesc
  • Conde Colom, Josep
  • Solsona Tehàs, Francesc
In recent years, several lightweight cryptographic protocols whose security lies in the assumed intractability of the learning parity with noise (LPN) problem have been proposed. The LPN problem has been shown to be solvable in subexponential time by algorithms that have very large (subexponential) memory requirements, which limits their practical applicability. When the memory resources are constrained, a brute-force search is the only known way of solving the LPN problem. In this paper, we propose a new parallel implementation, called Parallel-LPN, of an enhanced algorithm to solve the LPN problem. We implemented the Parallel-LPN in C and MPI (Message Passing Interface), and it was tested on a cluster system, where we obtained a quasi-linear speedup of approximately 90%. We also proposed a new algorithm by using combinatorial objects that enhances the ParallelLPN performance and its serial version., This work was supported by the Ministerio de Ciencia e Innovación (Spain) under Contracts TIN2011-28689-C02-02, CSD- 2007-00050, CSD-2007-0004 and the European Social Fund. The authors are members of the research groups 2009SGR145 and 2009SGR442, which are funded by the Generalitat de Catalunya (Spain).
Dipòsit Digital de Documents de la UAB
Publicación

Thread-cooperative, bit-parallel computation of Levenshtein distance on GPU

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
Approximate string matching is a very important problem in computational biology; it requires the fast computation of string distance as one of its essential components. Myers' bit-parallel algorithm improves the classical dynamic programming approach to Levenshtein distance computation, and offers competitive performance on CPUs. The main challenge when designing an efficient GPU implementation is to expose enough SIMD parallelism while at the same time keeping a relatively small working set for each thread. In this work we implement and optimise a CUDA version of Myers' algorithm suitable to be used as a building block for DNA sequence alignment. We achieve high efficiency by means of a cooperative parallelisation strategy for (1) very-long integer addition and shift operations, and (2) several simultaneous pattern matching tasks. In addition, we explore the performance impact obtained when using features specific to the Kepler architecture. Our results show an overall performance of the order of tera cells updates per second using a single high-end Nvidia GPU, and factor speedups in excess of 20 with respect to a sixteen-core, non-vectorised CPU implementation.
Dipòsit Digital de Documents de la UAB
Publicación

FM-index on GPU, a cooperative scheme to reduce memory footprint

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
The FM-index is a data structure which is seeing more and more pervasive use, in particular in the field of highthroughput bioinformatics. Algorithms based on it show a pseudo-random memory access pattern. As a consequence, they are usually bound by memory bandwidth rather than CPU usage. Naive GPU implementations are no exception. Here we show that the combination of a compact design of the FM-index and a thread-cooperative approach can be used to restore a proper balance. The resulting solution is less memory-bandwidth intensive, and allows full exploitation of the computational resources of the GPU across several GPU architectures.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Boosting the FM-index on the GPU, effective techniques to mitigate random memory access

  • Chacón, Alejandro|||0000-0001-8851-7618
  • Marco-Sola, Santiago|||0000-0001-7951-3914
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Ribeca, Paolo
  • Moure, Juan C|||0000-0001-6697-0331
The recent advent of high-throughput sequencing machines producing big amounts of short reads has boosted the interest in efficient string searching techniques. As of today, many mainstream sequence alignment software tools rely on a special data structure, called the FM-index, which allows for fast exact searches in large genomic references. However, such searches translate into a pseudo-random memory access pattern, thus making memory access the limiting factor of all computation-efficient implementations, both on CPUs and GPUs. Here we show that several strategies can be put in place to remove the memory bottleneck on the GPU: more compact indexes can be implemented by having more threads work cooperatively on larger memory blocks, and a k-step FM-index can be used to further reduce the number of memory accesses. The combination of those and other optimisations yields an implementation that is able to process about 2 Gbases of queries per second on our test platform, being about 8× faster than a comparable multi-core CPU version, and about 3× to 5× faster than the FM-index implementation on the GPU provided by the recently announced Nvidia NVBIO bioinformatics library.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Implementation of the DWT in a GPU through a register-based strategy

  • Enfedaque Montes, Pablo
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Moure, Juan C.|||0000-0001-6697-0331
The release of the CUDA Kepler architecture in March 2012 has provided Nvidia GPUs with a larger register memory space and instructions for the communication of registers among threads. This facilitates a new programming strategy that utilizes registers for data sharing and reusing in detriment of the shared memory. Such a programming strategy can significantly improve the performance of applications that reuse data heavily. This paper presents a register-based implementation of the Discrete Wavelet Transform (DWT), the prevailing data decorrelation technique in the field of image coding. Experimental results indicate that the proposed method is, at least, four times faster than the best GPU implementation of the DWT found in the literature. Furthermore, theoretical analysis coincide with experimental tests in proving that the execution times achieved by the proposed implementation are close to the GPU's performance limits.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Bitplane image coding with parallel coefficient processing

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Enfedaque Montes, Pablo
  • Moure, Juan C.|||0000-0001-6697-0331
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
Image coding systems have been traditionally tailored for multiple instruction, multiple data (MIMD) computing. In general, they partition the (transformed) image in codeblocks that can be coded in the cores of MIMD-based processors. Each core executes a sequential flow of instructions to process the coefficients in the codeblock, independently and asynchronously from the others cores. Bitplane coding is a common strategy to code such data. Most of its mechanisms require sequential processing of the coefficients. The last years have seen the upraising of processing accelerators with enhanced computational performance and power efficiency whose architecture is mainly based on the single instruction, multiple data (SIMD) principle. SIMD computing refers to the execution of the same instruction to multiple data in a lockstep synchronous way. Unfortunately, current bitplane coding strategies cannot fully profit from such processors due to inherently sequential coding task. This paper presents bitplane image coding with parallel coefficient (BPC-PaCo) processing, a coding method that can process many coefficients within a codeblock in parallel and synchronously. To this end, the scanning order, the context formation, the probability model, and the arithmetic coder of the coding engine have been re-formulated. The experimental results suggest that the penalization in coding performance of BPC-PaCo with respect to the traditional strategies is almost negligible.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Applying probability theory for the quality assessment of a wildfire spread prediction framework based on genetic algorithms

  • Cencerrado Barraqué, Andrés|||0000-0002-9143-3279
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
This work presents a framework for assessing how the existing constraints at the time of attending an ongoing forest fire affect simulation results, both in terms of quality (accuracy) obtained and the time needed to make a decision. In the wildfire spread simulation and prediction area, it is essential to properly exploit the computational power offered by new computing advances. For this purpose, we rely on a two-stage prediction process to enhance the quality of traditional predictions, taking advantage of parallel computing. This strategy is based on an adjustment stage which is carried out by a well-known evolutionary technique: Genetic Algorithms. The core of this framework is evaluated according to the probability theory principles. Thus, a strong statistical study is presented and oriented towards the characterization of such an adjustment technique in order to help the operation managers deal with the two aspects previously mentioned: time and quality. The experimental work in this paper is based on a region in Spain which is one of the most prone to forest fires: El Cap de Creus.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Dynamic tuning of the workload partition factor and the resource utilization in data-intensive applications

  • Rosas Mendoza, Claudia Andreina
  • Sikora, Anna|||0000-0003-0090-4109
  • Jorba i Esteve, Josep|||0000-0002-5810-4748
  • Moreno, Andreu
  • Espinosa, Antonio|||0000-0002-6460-3789
  • César Galobardes, Eduardo|||0000-0002-9729-8557
The recent data deluge needing to be processed represents one of the major challenges in the computational field. This fact led to the growth of specially-designed applications known as data-intensive applications. In general, in order to ease the parallel execution of data-intensive applications input data is divided into smaller data chunks that can be processed separately. However, in many cases, these applications show severe performance problems mainly due to the load imbalance, inefficient use of available resources, and improper data partition policies. In addition, the impact of these performance problems can depend on the dynamic behavior of the application. This work proposes a methodology to dynamically improve the performance of data-intensive applications based on: (i) adapting the size and the number of data partitions to reduce the overall execution time; and (ii) adapting the number of processing nodes to achieve an efficient execution. We propose to monitor the application behavior for each exploration (query) and use gathered data to dynamically tune the performance of the application. The methodology assumes that a single execution includes multiple related queries on the same partitioned workload. The adaptation of the workload partition factor is addressed through the definition of the initial size for the data chunks; the modification of the scheduling policy to send first data chunks with large processing times; dividing of the data chunks with the biggest associated computation times; and joining of data chunks with small computation times. The criteria for dividing or gathering chunks are based on the chunks' associated execution time (average and standard deviation) and the number of processing elements being used. Additionally, the resources utilization is addressed through the dynamic evaluation of the application performance and the estimation and modification of the number of processing nodes that can be efficiently used. We have evaluated our strategy using as cases of study a real and a synthetic data-intensive application. Analytical expressions have been analyzed through simulation. Applying our methodology, we have obtained encouraging results reducing total execution times and efficient use of resources.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Improving the execution performance of FreeSurfer

  • Delgado, Jordi|||0000-0002-0166-5464
  • Moure, Juan C.|||0000-0001-6697-0331
  • Vives-Gilabert, Yolanda|||0000-0002-3744-5893
  • Delfino, Manuel|||0000-0002-9468-4751
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Gómez Ansón, Beatriz|||0000-0001-7900-938X
A scheme to significantly speed up the processing of MRI with FreeSurfer (FS) is presented. The scheme is aimed at maximizing the productivity (number of subjects processed per unit time) for the use case of research projects with datasets involving many acquisitions. The scheme combines the already existing GPU-accelerated version of the FS workflow with a task-level parallel scheme supervised by a resource scheduler. This allows for an optimum utilization of the computational power of a given hardware platform while avoiding problems with shortages of platform resources. The scheme can be executed on a wide variety of platforms, as its implementation only involves the script that orchestrates the execution of the workflow components and the FS code itself requires no modifications. The scheme has been implemented and tested on a commodity platform within the reach of most research groups (a personal computer with four cores and an NVIDIA GeForce 480 GTX graphics card). Using the scheduled task-level parallel scheme, a productivity above 0.6 subjects per hour is achieved on the test platform, corresponding to a speedup of over six times compared to the default CPU-only serial FS workflow.