Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.creatorJuan J. Durillo
dc.creatorRadu Prodan
dc.creatorJorge Manuel Gomes Barbosa
dc.description.abstractAs distributed computing infrastructures become nowadays ever more complex and heterogeneous, scientists are confronted with multiple competing goals such as makespan in high-performance computing and economic cost in Clouds. Existing approaches typically aim at finding a single tradeoff solution by aggregating or constraining the objectives in an a-priory fashion, which negatively impacts the quality of the solutions. In contrast, Pareto-based approaches aiming to approximate the complete set of (nearly-) optimal tradeoff solutions have been scarcely studied. In this paper, we extend the popular Heterogeneous Earliest Finish Time (HEFT) workflow scheduling heuristic for dealing with multiple conflicting objectives and approximating the Pareto frontier optimal schedules. We evaluate our new algorithm for performance and cost tradeoff optimisation of synthetic and real-world applications in Distributed Computing Infrastructures (DCIs) and federated Clouds and compare it with a state-of-the-art meta-heuristic from the multi-objective optimisation community.
dc.subjectSistema de computadores, Engenharia electrotécnica, electrónica e informática
dc.subjectComputer systems, Electrical engineering, Electronic engineering, Information engineering
dc.titlePareto tradeoff scheduling of workflows on federated commercial Clouds
dc.typeArtigo em Revista Científica Internacional
dc.contributor.uportoFaculdade de Engenharia
dc.subject.fosCiências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
dc.subject.fosEngineering and technology::Electrical engineering, Electronic engineering, Information engineering
Appears in Collections:FEUP - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
  Restricted Access
pdf1.68 MBAdobe PDF    Request a copy from the Author(s)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.