Dynamic estimation and Grid partitioning approach for Multi-Objective Optimization Problems in medical cloud federations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Transactions on Large-Scale Data- and Knowledge-Centered Systems Année : 2020

Dynamic estimation and Grid partitioning approach for Multi-Objective Optimization Problems in medical cloud federations

Verena Kantere
  • Fonction : Auteur
  • PersonId : 1040917

Résumé

Data sharing is important in the medical domain. Sharing data allows large-scale analysis with many data sources to provide more accurate results (especially in the case of rare diseases with small local datasets). Cloud federations can leverage sharing medical data stored in different cloud platforms, such as Amazon, Microsoft, Google Cloud, etc. They also enable access to distributed data of patients. The pay-as-yougo model in cloud federations raises important issues of Multi-Objective Optimization Problems (MOOP) related to users’ preferences, such as response time, money, quality, etc. However, optimizing a query in a cloud federation is complex with increasing the variety, especially due to a wide range of communications and pricing models. The variety of virtual machines configuration also leverages the high complexity in generating the space of candidate solutions. Indeed, in such a context, it is difficult to provide accurate estimations and optimal solutions to make relevant decisions. The first challenge is how to estimate accurate parameter values for MOOPs without precise knowledge of the execution environment in a cloud federation consisting of different sites. To address the accurate estimation of parameter values problem, we present the Dynamic Regression Algorithm (DREAM), which can provide accurate estimations in a cloud federation with limited historical data. DREAM focuses on reducing the size of historical data while maintaining the estimation accuracy. The second challenge is how to find an approximate optimal solution in MOOPs using an efficient Multi-Objective Optimization algorithm. To address the problem of finding an approximate optimal solution, we present Non-dominated Sorting Genetic Algorithms based on Grid partitioning (NSGA-G) for MOOPs. The proposed algorithm is integrated into the Intelligent Resource Scheduler, a solution for heterogeneous databases, to solve MOQP in cloud federations. We validate our algorithms with experiments on a decision support benchmark (TPC-H benchmark).
Fichier principal
Vignette du fichier
TLDKS.pdf (899.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03103810 , version 1 (08-01-2021)
hal-03103810 , version 2 (18-01-2021)

Identifiants

  • HAL Id : hal-03103810 , version 2

Citer

Trung-Dung Le, Verena Kantere, Laurent d'Orazio. Dynamic estimation and Grid partitioning approach for Multi-Objective Optimization Problems in medical cloud federations. Transactions on Large-Scale Data- and Knowledge-Centered Systems, 2020. ⟨hal-03103810v2⟩
74 Consultations
95 Téléchargements

Partager

Gmail Facebook X LinkedIn More