Ana Ripoll
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ana Ripoll has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Emilio Luque
Computer Architecture and Operating Systems Department, Universitat Autònoma de Barcelona, Bellaterra, Barcelona, Spain
19 shared publications - Concepció Roig
University of Lleida
10 shared publications - Fernando Cores
Universitat de Lleida
9 shared publications - Fernando Guirado
Universitat de Lleida
7 shared publications - Porfidio Hernández
Universitat Autónoma de Barcelona
7 shared publications - Miquel Angel Senar
Universitat Autónoma de Barcelona
6 shared publications
Latest Publications
- 11 August 2017
- Published by Springer Nature
- p. 489-502
A Resource Manager for Maximizing the Performance of Bioinformatics Workflows in Shared Clusters
- 11 August 2017
- Published by Springer Nature
- p. 489-502
A Resource Manager for Maximizing the Performance of Bioinformatics Workflows in Shared Clusters
- 1 August 2013
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 73 (8) , 1092-1105
Enhancing throughput for streaming applications running on cluster systems
- 1 August 2013
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 73 (8) , 1092-1105
Enhancing throughput for streaming applications running on cluster systems
- 8 June 2012
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 62 (3) , 1305-1317
Analysis and improvement of map-reduce data distribution in read mapping applications
- 8 June 2012
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 62 (3) , 1305-1317
Analysis and improvement of map-reduce data distribution in read mapping applications
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 71-82
Enhancing the Scalability of Consistency-based Progressive Multiple Sequences Alignment Applications
Multiple Sequence Alignment (MSA) is an extremely powerful tool for important biological applications, such as phylogenetic analysis, identification of conserved motifs and domains and structure prediction. In this paper we propose a new approach to reduce the computational requirements of TCoffee, a memory demanding MSA tool that uses a consistency based scheme to produce more accurate alignments. Our goal is to minimize the memory constraints in order to increase the performance and scalability of the application. The experimental results show that our approach is able to reduce the memory consumption and increase both the time performance and the number and the length of sequences that the method can align. In summary, it is able to reduce the memory requirements by between 72% and 58% depending on the optimization level, improving the alignment scalability as a whole. Also, the library reduction yields a further improvement: the alignment execution time can be reduced by up to 92%. These results are obtained without a significant impact on the final alignment quality, that declines by less than 3%.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 71-82
Enhancing the Scalability of Consistency-based Progressive Multiple Sequences Alignment Applications
Multiple Sequence Alignment (MSA) is an extremely powerful tool for important biological applications, such as phylogenetic analysis, identification of conserved motifs and domains and structure prediction. In this paper we propose a new approach to reduce the computational requirements of TCoffee, a memory demanding MSA tool that uses a consistency based scheme to produce more accurate alignments. Our goal is to minimize the memory constraints in order to increase the performance and scalability of the application. The experimental results show that our approach is able to reduce the memory consumption and increase both the time performance and the number and the length of sequences that the method can align. In summary, it is able to reduce the memory requirements by between 72% and 58% depending on the optimization level, improving the alignment scalability as a whole. Also, the library reduction yields a further improvement: the alignment execution time can be reduced by up to 92%. These results are obtained without a significant impact on the final alignment quality, that declines by less than 3%.
- 1 December 2010
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 70 (12) , 1175-1192
Designing an effective P2P system for a VoD system to exploit the multicast communication
- 1 December 2010
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 70 (12) , 1175-1192
Designing an effective P2P system for a VoD system to exploit the multicast communication
- 5 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 18 (12) , 1740-1753
A New Task Graph Model for Mapping Message Passing Applications
The exploitation of parallelism in a message passing platform implies a previous modeling phase of the parallel application as a task graph, which properly reflects its temporal behavior. In this paper, we analyze the classical task graph models of the literature and their drawbacks when modeling message passing programs with an arbitrary task structure. We define a new task graph model called temporal task interaction graph (TTIG) that integrates the classical models used in the literature. The TTIG allows us to explicitly capture the ability of concurrency of adjacent tasks for applications where adjacent tasks can communicate at any point inside them. A mapping strategy is developed from this model, which minimizes the expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proved in different experimentation scopes for a wide range of message passing applications.
- 5 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 18 (12) , 1740-1753
A New Task Graph Model for Mapping Message Passing Applications
The exploitation of parallelism in a message passing platform implies a previous modeling phase of the parallel application as a task graph, which properly reflects its temporal behavior. In this paper, we analyze the classical task graph models of the literature and their drawbacks when modeling message passing programs with an arbitrary task structure. We define a new task graph model called temporal task interaction graph (TTIG) that integrates the classical models used in the literature. The TTIG allows us to explicitly capture the ability of concurrency of adjacent tasks for applications where adjacent tasks can communicate at any point inside them. A mapping strategy is developed from this model, which minimizes the expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proved in different experimentation scopes for a wide range of message passing applications.
- 13 March 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 41 (4) , 609-618
The Convergence of Realistic Distributed Load-Balancing Algorithms
- 13 March 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 41 (4) , 609-618
The Convergence of Realistic Distributed Load-Balancing Algorithms
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1633-1640
Multi-Collaboration Domain Multicast P2P Delivery Architecture for VoD System
Although a P2P scheme based unicast forward or application level multicast (ALM) is able to decentralize the video delivery process to reduce the VoD server load, the performance of such a scheme is limited by the high network resource requirement of the clients' communications. In this paper, we propose a new P2P architecture that uses multicast communications for peer collaborations. We introduce the concept of n-peers to m-peers cooperative collaboration to achieve high client delivery efficiency as well as unbounded scalable client collaboration capacity. Furthermore, the architecture selects peers by taking into account the underlying network infrastructure in order to avoid network saturation. We compared the new design with video delivery architecture based on Patching and Chaining schemes in a synthetic network model as well as a real Ethernet network topology. The experimental results showed that our design is better than Patching and Chaining in terms of admitted client requests and VoD server resource requirement. Furthermore, the results showed that our architecture is adaptable to any underlying physical networks.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1633-1640
Multi-Collaboration Domain Multicast P2P Delivery Architecture for VoD System
Although a P2P scheme based unicast forward or application level multicast (ALM) is able to decentralize the video delivery process to reduce the VoD server load, the performance of such a scheme is limited by the high network resource requirement of the clients' communications. In this paper, we propose a new P2P architecture that uses multicast communications for peer collaborations. We introduce the concept of n-peers to m-peers cooperative collaboration to achieve high client delivery efficiency as well as unbounded scalable client collaboration capacity. Furthermore, the architecture selects peers by taking into account the underlying network infrastructure in order to avoid network saturation. We compared the new design with video delivery architecture based on Patching and Chaining schemes in a synthetic network model as well as a real Ethernet network topology. The experimental results showed that our design is better than Patching and Chaining in terms of admitted client requests and VoD server resource requirement. Furthermore, the results showed that our architecture is adaptable to any underlying physical networks.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A Performance Prediction Methodology for Data-dependent Parallel Applications
The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both deterministic applications and non-deterministic applications. In particular, the performance prediction of data-dependent programs is an extremely challenging problem because for a specific issue the input datasets may cause different execution times. Generally, a parallel application is characterized as a collection of tasks and their interrelations. If the application is time-critical it is not enough to work with only one value per task, and consequently knowledge of the distribution of task execution times is crucial. The development of a new prediction methodology to estimate the performance of data-dependent parallel applications is the primary target of this study. This approach makes it possible to evaluate the parallel performance of an application without the need of implementation. A real data-dependent arterial structure detection application model is used to apply the methodology proposed. The predicted times obtained using the new methodology for genuine datasets are compared with predicted times that arise from using only one execution value per task. Finally, the experimental study shows that the new methodology generates more precise predictions
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
A Performance Prediction Methodology for Data-dependent Parallel Applications
The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both deterministic applications and non-deterministic applications. In particular, the performance prediction of data-dependent programs is an extremely challenging problem because for a specific issue the input datasets may cause different execution times. Generally, a parallel application is characterized as a collection of tasks and their interrelations. If the application is time-critical it is not enough to work with only one value per task, and consequently knowledge of the distribution of task execution times is crucial. The development of a new prediction methodology to estimate the performance of data-dependent parallel applications is the primary target of this study. This approach makes it possible to evaluate the parallel performance of an application without the need of implementation. A real data-dependent arterial structure detection application model is used to apply the methodology proposed. The predicted times obtained using the new methodology for genuine datasets are compared with predicted times that arise from using only one execution value per task. Finally, the experimental study shows that the new methodology generates more precise predictions
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 43
Designing a Video-on-Demand System for a Brazilian High Speed Network
Despite the availability of video-on-demand (VoD) services in a number of cities around the world, the large-scale deployment of VoD services has not been widely explored due to economic constraints. The high complexity founded in these systems makes the design process very difficult. This study presents a VoD system design for a highspeed metropolitan network, based on ATM technology, located in Brazil. To accomplish this goal, we have utilized our own simulation-based tool for VoD design called VODSim. This tool allows VoD research on any VoD platform, simulating the complete flow path followed by requests from clients to servers passing through the network infrastructure, allowing the configuration and tuning of multiple system parameters. Using VODSim, we analyse possible VoD architectures for the proposal environment (i.e. Centralized-server, Independent-servers, One-level-proxies and Distributedservers), studying key-parameters that have influence in system design. Experimental results show that Distributed-server architecture is the one that adjusts better to the analyzed infrastructure, improving streaming capacity by 16%, 25% and 28% more than One-level-proxies, Centralized and Independent-servers respectively. Taking in account future growth in VoD system, the Distributed-server even provides an unlimited scalability through new local network incorporation and using P2P techniques.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 43
Designing a Video-on-Demand System for a Brazilian High Speed Network
Despite the availability of video-on-demand (VoD) services in a number of cities around the world, the large-scale deployment of VoD services has not been widely explored due to economic constraints. The high complexity founded in these systems makes the design process very difficult. This study presents a VoD system design for a highspeed metropolitan network, based on ATM technology, located in Brazil. To accomplish this goal, we have utilized our own simulation-based tool for VoD design called VODSim. This tool allows VoD research on any VoD platform, simulating the complete flow path followed by requests from clients to servers passing through the network infrastructure, allowing the configuration and tuning of multiple system parameters. Using VODSim, we analyse possible VoD architectures for the proposal environment (i.e. Centralized-server, Independent-servers, One-level-proxies and Distributedservers), studying key-parameters that have influence in system design. Experimental results show that Distributed-server architecture is the one that adjusts better to the analyzed infrastructure, improving streaming capacity by 16%, 25% and 28% more than One-level-proxies, Centralized and Independent-servers respectively. Taking in account future growth in VoD system, the Distributed-server even provides an unlimited scalability through new local network incorporation and using P2P techniques.