Riccardo Murri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Riccardo Murri has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Maffioletti
Grid Computing Competence Center Universität Zürich Winterthurerstrasse 190 CH-8006 Zürich Switzerland
7 shared publications - Peter Kunszt
SystemsX ETH Zürich Clausiusstrasse 45 CH-8092 Zürich Switzerland
2 shared publications - Alessandro Costantini
INFN CNAF viale Carlo Berti Pichat 6/2 Bologna Italy
1 shared publication - Antonio Laganà
Dipartimento di Chimíca, Universitá di Perugia, Perugia, Italy
1 shared publication - Arnold Kuzniar
Netherlands eScience Center, 1098 XG Amsterdam, The Netherlands
1 shared publication Briséïs Castella
1 shared publication
Latest Publications
- Open Access
Performance of Python runtimes on a non-numeric scientific code
The Python library FatGHol FatGHoL used in Murri2012 to reckon the rational homology of the moduli space of Riemann surfaces is an example of a non-numeric scientific code: most of the processing it does is generating graphs (represented by complex Python objects) and computing their isomorphisms (a triple of Python lists; again a nested data structure). These operations are repeated many times over: for example, the spaces and are triangulated by 4'583'322 and 747'664 graphs, respectively. This is an opportunity for every Python runtime to prove its strength in optimization. The purpose of this experiment was to assess the maturity of alternative Python runtimes, in terms of: compatibility with the language as implemented in CPython 2.7, and performance speedup. This paper compares the results and experiences from running FatGHol with different Python runtimes: CPython 2.7.5, PyPy 2.1, Cython 0.19, Numba 0.11, Nuitka 0.4.4 and Falcon.
Open AccessPerformance of Python runtimes on a non-numeric scientific code
The Python library FatGHol FatGHoL used in Murri2012 to reckon the rational homology of the moduli space of Riemann surfaces is an example of a non-numeric scientific code: most of the processing it does is generating graphs (represented by complex Python objects) and computing their isomorphisms (a triple of Python lists; again a nested data structure). These operations are repeated many times over: for example, the spaces and are triangulated by 4'583'322 and 747'664 graphs, respectively. This is an opportunity for every Python runtime to prove its strength in optimization. The purpose of this experiment was to assess the maturity of alternative Python runtimes, in terms of: compatibility with the language as implemented in CPython 2.7, and performance speedup. This paper compares the results and experiences from running FatGHol with different Python runtimes: CPython 2.7.5, PyPy 2.1, Cython 0.19, Numba 0.11, Nuitka 0.4.4 and Falcon.
- Open Access
VM-MAD: a cloud/cluster software for service-oriented academic environments
The availability of powerful computing hardware in IaaS clouds makes cloud computing attractive also for computational workloads that were up to now almost exclusively run on HPC clusters. In this paper we present the VM-MAD Orchestrator software: an open source framework for cloudbursting Linux-based HPC clusters into IaaS clouds but also computational grids. The Orchestrator is completely modular, allowing flexible configurations of cloudbursting policies. It can be used with any batch system or cloud infrastructure, dynamically extending the cluster when needed. A distinctive feature of our framework is that the policies can be tested and tuned in a simulation mode based on historical or synthetic cluster accounting data. In the paper we also describe how the VM-MAD Orchestrator was used in a production environment at the FGCZ to speed up the analysis of mass spectrometry-based protein data by cloudbursting to the Amazon EC2. The advantages of this hybrid system are shown with a large evaluation run using about hundred large EC2 nodes.
Open AccessVM-MAD: a cloud/cluster software for service-oriented academic environments
The availability of powerful computing hardware in IaaS clouds makes cloud computing attractive also for computational workloads that were up to now almost exclusively run on HPC clusters. In this paper we present the VM-MAD Orchestrator software: an open source framework for cloudbursting Linux-based HPC clusters into IaaS clouds but also computational grids. The Orchestrator is completely modular, allowing flexible configurations of cloudbursting policies. It can be used with any batch system or cloud infrastructure, dynamically extending the cluster when needed. A distinctive feature of our framework is that the policies can be tested and tuned in a simulation mode based on historical or synthetic cluster accounting data. In the paper we also describe how the VM-MAD Orchestrator was used in a production environment at the FGCZ to speed up the analysis of mass spectrometry-based protein data by cloudbursting to the Amazon EC2. The advantages of this hybrid system are shown with a large evaluation run using about hundred large EC2 nodes.
- Open Access
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 004
AppPot: bridging the Grid and Cloud worlds
This paper presents AppPot, a system for creating Linux software appliances. AppPot appliances can be run as a regular batch or grid job and executed in user space, and require no virtualization support in the infrastructure. The main design goal of AppPot is to bring the benefits of a virtualization-based IaaS cloud to existing batch-oriented computing infrastructures. In particular, AppPot addresses the application deployment and configuration on large heterogeneous computing infrastructures: users are able to prepare their own customized virtual appliance to provide a safe execution environment for their applications. These appliances can then be executed on virtually any computing infrastructure, being it a private or public cloud, as well as any batch-queueing compute cluster. We give an overview of AppPot and its features, the technology that makes it possible, and briefly report on experiences running it in production use within the Swiss national grid infrastructure SMSCG.
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 004
Open AccessAppPot: bridging the Grid and Cloud worlds
This paper presents AppPot, a system for creating Linux software appliances. AppPot appliances can be run as a regular batch or grid job and executed in user space, and require no virtualization support in the infrastructure. The main design goal of AppPot is to bring the benefits of a virtualization-based IaaS cloud to existing batch-oriented computing infrastructures. In particular, AppPot addresses the application deployment and configuration on large heterogeneous computing infrastructures: users are able to prepare their own customized virtual appliance to provide a safe execution environment for their applications. These appliances can then be executed on virtually any computing infrastructure, being it a private or public cloud, as well as any batch-queueing compute cluster. We give an overview of AppPot and its features, the technology that makes it possible, and briefly report on experiences running it in production use within the Swiss national grid infrastructure SMSCG.
- Open Access
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 044
MILU, the three middleware user interface
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 044
Open AccessMILU, the three middleware user interface
- Open Access
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 058
A Grid execution model for Computational Chemistry Applications using GC3Pie and AppPot
Porting and running of computational chemistry applications on distributed systems have been performed for a set of quantum mechanics scattering programs within a collaboration between the Grid Computing Competence Centre (Zurich), the Computational Dynamics and Kinetics Group (Perugia) and the Italian Grid Infrastructure (Bologna). For this purpose the high throughput execution framework GC3Pie and the AppPot cloud/grid virtual machines have been used to implement a grid based workflow dealing with the central blocks of an ab initio Molecular simulator. These blocks carry out both the fitting of the potential energy values computed using ab initio methods and the evaluation of some atom diatom quantum reactive scattering properties. Related performances are discussed and compared with other approaches.
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 058
Open AccessA Grid execution model for Computational Chemistry Applications using GC3Pie and AppPot
Porting and running of computational chemistry applications on distributed systems have been performed for a set of quantum mechanics scattering programs within a collaboration between the Grid Computing Competence Centre (Zurich), the Computational Dynamics and Kinetics Group (Perugia) and the Italian Grid Infrastructure (Bologna). For this purpose the high throughput execution framework GC3Pie and the AppPot cloud/grid virtual machines have been used to implement a grid based workflow dealing with the central blocks of an ab initio Molecular simulator. These blocks carry out both the fitting of the potential energy values computed using ab initio methods and the evaluation of some atom diatom quantum reactive scattering properties. Related performances are discussed and compared with other approaches.
- Open Access
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 063
Computational workflows with GC3Pie
This paper present GC3Pie [5], a python library to ease the development of scalable and robust High Throughput data analysis tools. Most of the current distributed computing middlewares as well as most of the in-house grown scripts fall short in reaching the scaling and reliability factors required by the ever growing demand of large data analysis. GC3Pie provides mechanisms to automitise the execution and the monitoring of large collection of applications while, at the same time, provides simple data structures and interfaces to steer the behaviour of the underlying system in an application-centric perspective. The goal of GC3Pie is to embody the common execution and monitorig processing part of large data analysis while moving most decision making logic to the application level; like, for example, the reaction to certain types of failures, the validation of the application execution or the brokering of the computing resources driven by application fidelity metrics. This allows to write application specific tools that take full control of the underlying computing and data infrastructure, as opposite to current middleware stacks that are trying to embody the full control of the execution logic thus reducing the flexibility of the entire system as they prevent applications to define their own expected behaviour of the system.
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 063
Open AccessComputational workflows with GC3Pie
This paper present GC3Pie [5], a python library to ease the development of scalable and robust High Throughput data analysis tools. Most of the current distributed computing middlewares as well as most of the in-house grown scripts fall short in reaching the scaling and reliability factors required by the ever growing demand of large data analysis. GC3Pie provides mechanisms to automitise the execution and the monitoring of large collection of applications while, at the same time, provides simple data structures and interfaces to steer the behaviour of the underlying system in an application-centric perspective. The goal of GC3Pie is to embody the common execution and monitorig processing part of large data analysis while moving most decision making logic to the application level; like, for example, the reaction to certain types of failures, the validation of the application execution or the brokering of the computing resources driven by application fidelity metrics. This allows to write application specific tools that take full control of the underlying computing and data infrastructure, as opposite to current middleware stacks that are trying to embody the full control of the execution logic thus reducing the flexibility of the entire system as they prevent applications to define their own expected behaviour of the system.
- Open Access
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 143
GC3Pie: A Python framework for high-throughput computing
This paper present GC3Pie [7], a python library to ease the development of scalable and robust High Throughput data analysis tools. Most of the current distributed computing middlewares as well as most of the in-house grown scripts fall short in reaching the scaling and reliability factors required by the ever growing demand of large data analysis. GC3Pie provides mechanisms to automitise the execution and the monitoring of large collection of applications while, at the same time, provides simple data structures and interfaces to steer the behaviour of the underlying system in an application-centric perspective. The goal of GC3Pie is to embody the common execution and monitorig processing part of large data analysys while moving most decision making logic to the application level; like, for example, the reaction of certain types of failures, the validation of the application execution or the brokering of the computing resources driven by application fidelity metrics. This allows to write application specific tools that take full control of the underlying computing and data infrastructure, as opposite of current middleware stacks that are trying to embody the full control of the execution logic thus reducing the flexibility of the entire system as they prevent applications to define their own expected behaviour of the system.
- 4 December 2012
- Published by Sissa Medialab Srl
- Vol. 162, 143
Open AccessGC3Pie: A Python framework for high-throughput computing
This paper present GC3Pie [7], a python library to ease the development of scalable and robust High Throughput data analysis tools. Most of the current distributed computing middlewares as well as most of the in-house grown scripts fall short in reaching the scaling and reliability factors required by the ever growing demand of large data analysis. GC3Pie provides mechanisms to automitise the execution and the monitoring of large collection of applications while, at the same time, provides simple data structures and interfaces to steer the behaviour of the underlying system in an application-centric perspective. The goal of GC3Pie is to embody the common execution and monitorig processing part of large data analysys while moving most decision making logic to the application level; like, for example, the reaction of certain types of failures, the validation of the application execution or the brokering of the computing resources driven by application fidelity metrics. This allows to write application specific tools that take full control of the underlying computing and data infrastructure, as opposite of current middleware stacks that are trying to embody the full control of the execution logic thus reducing the flexibility of the entire system as they prevent applications to define their own expected behaviour of the system.
- Open Access
Fatgraph Algorithms and the Homology of the Kontsevich Complex
Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms of any given fatgraph; (3) compute the homology of the fatgraph complex. The algorithms are suitable for effective computer implementation. In particular, this allows us to compute the rational homology of the moduli space of Riemann surfaces with marked points. We thus compute the Betti numbers of $M_{g,n}$ with $(2g + n) \leq 6$, corroborating known results.Open AccessFatgraph Algorithms and the Homology of the Kontsevich Complex
Fatgraphs are multigraphs enriched with a cyclic order of the edges incident to a vertex. This paper presents algorithms to: (1) generate the set of all fatgraphs having a given genus and number of boundary cycles; (2) compute automorphisms of any given fatgraph; (3) compute the homology of the fatgraph complex. The algorithms are suitable for effective computer implementation. In particular, this allows us to compute the rational homology of the moduli space of Riemann surfaces with marked points. We thus compute the Betti numbers of $M_{g,n}$ with $(2g + n) \leq 6$, corroborating known results. - Open Access
A novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices, of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some preliminary performance measurements are presented and discussed, and the performance of the algorithm is compared to corresponding state-of-the-art algorithms for floating-point and integer matrices.
Open AccessA novel parallel algorithm for Gaussian Elimination of sparse unsymmetric matrices
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices, of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some preliminary performance measurements are presented and discussed, and the performance of the algorithm is compared to corresponding state-of-the-art algorithms for floating-point and integer matrices.
- 1 January 2012
- Vol. 175, 59-68
gcodeml: a Grid-enabled tool for detecting positive selection in biological evolution.
One of the important questions in biological evolution is to know if certain changes along protein coding genes have contributed to the adaptation of species. This problem is known to be biologically complex and computationally very expensive. It, therefore, requires efficient Grid or cluster solutions to overcome the computational challenge. We have developed a Grid-enabled tool (gcodeml) that relies on the PAML (codeml) package to help analyse large phylogenetic datasets on both Grids and computational clusters. Although we report on results for gcodeml, our approach is applicable and customisable to related problems in biology or other scientific domains.
- 1 January 2012
- Vol. 175, 59-68
gcodeml: a Grid-enabled tool for detecting positive selection in biological evolution.
One of the important questions in biological evolution is to know if certain changes along protein coding genes have contributed to the adaptation of species. This problem is known to be biologically complex and computationally very expensive. It, therefore, requires efficient Grid or cluster solutions to overcome the computational challenge. We have developed a Grid-enabled tool (gcodeml) that relies on the PAML (codeml) package to help analyse large phylogenetic datasets on both Grids and computational clusters. Although we report on results for gcodeml, our approach is applicable and customisable to related problems in biology or other scientific domains.