Остановите войну!
for scientists:
default search action
Fernando Guirado
- > Home > Persons > Fernando Guirado
Publications
- 2023
- [j18]Sergi Vila, Fernando Guirado, Josep L. Lérida:
Cloud computing virtual machine consolidation based on stock trading forecast techniques. Future Gener. Comput. Syst. 145: 321-336 (2023) - 2021
- [j17]Jordi Lladós, Fernando Cores, Fernando Guirado, Josep L. Lérida:
Accurate consistency-based MSA reducing the memory footprint. Comput. Methods Programs Biomed. 208: 106237 (2021) - [j16]Fernando Cores, Fernando Guirado, Josep Lluís Lérida:
High throughput BLAST algorithm using spark and cassandra. J. Supercomput. 77(2): 1879-1896 (2021) - 2020
- [c22]Sergi Vila, Nilson Moraes, Fernando Guirado, Josep L. Lérida, Fernando Cores, Fábio L. Verdi:
Cloud Resources Reassignment Based on CPU and Bandwidth Correlation. AINA 2020: 1101-1113 - [c21]Sergi Vila, Josep L. Lérida, Fernando Cores, Fernando Guirado, Fábio L. Verdi:
WPSP: A Multi-correlated Weighted Policy for VM Selection and Migration for Cloud Computing. Euro-Par 2020: 312-326 - 2019
- [j14]Sergi Vila, Fernando Guirado, Josep L. Lérida, Fernando Cores:
Energy-saving scheduling on IaaS HPC cloud environments based on a multi-objective genetic algorithm. J. Supercomput. 75(3): 1483-1495 (2019) - 2017
- [j12]Eloi Gabaldon, Josep Lluís Lérida, Fernando Guirado, Jordi Planes:
Blacklist muti-objective genetic algorithm for energy saving in heterogeneous environments. J. Supercomput. 73(1): 354-369 (2017) - [c20]Eloi Gabaldon, Sergi Vila, Fernando Guirado, Josep L. Lérida, Jordi Planes:
Energy efficient scheduling on heterogeneous federated clusters using a fuzzy multi-objective meta-heuristic. FUZZ-IEEE 2017: 1-6 - 2016
- [c18]Eloi Gabaldon, Fernando Guirado, Josep Lluís Lérida, Jordi Planes:
Particle Swarm Optimization Scheduling for Energy Saving in Cluster Computing Heterogeneous Environments. FiCloud Workshops 2016: 321-325 - 2015
- [j11]Eloi Gabaldon, Josep L. Lérida, Fernando Guirado, Jordi Planes:
Multi-criteria genetic algorithm applied to scheduling in multi-cluster environments Open. J. Simulation 9(4): 287-295 (2015) - [j9]Jordi Lladós, Fernando Guirado, Fernando Cores, Josep Lluís Lérida, Cédric Notredame:
Recovering accuracy methods for scalable consistency library. J. Supercomput. 71(5): 1833-1845 (2015) - 2014
- [c17]Eloi Gabaldon, Josep L. Lérida, Fernando Guirado, Jordi Planes:
Slowdown-Guided Genetic Algorithm for Job Scheduling in Federated Environments. ICTCC 2014: 181-190 - 2012
- [c15]Héctor Blanco, Fernando Guirado, Josep L. Lérida, Víctor M. Albornoz:
MIP Model Scheduling for BSP Parallel Applications on Multi-cluster Environments. 3PGCIC 2012: 12-18 - [c14]Héctor Blanco, Fernando Guirado, Josep L. Lérida, Víctor M. Albornoz:
MIP Model Scheduling for Multi-Clusters. Euro-Par Workshops 2012: 196-206 - 2011
- [j3]Héctor Blanco, Josep L. Lérida, Fernando Cores, Fernando Guirado:
Multiple job co-allocation strategy for heterogeneous multi-cluster systems based on linear programming. J. Supercomput. 58(3): 394-402 (2011)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-07 03:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint