Please use this identifier to cite or link to this item:
|Title:||New Results on Test-Cost Minimization in Database Migration||Authors:||Açıkalın, U.U.
Quality of service
|Issue Date:||2021||Publisher:||Springer Science and Business Media Deutschland GmbH||Abstract:||An important ubiquitous task in modern cloud systems is the migration of databases from one location to another. In practical settings, the databases are migrated in several shifts in order to meet the quality of service requirements of the end-users . Once a batch of databases is migrated in a shift, the applications that depend on the databases on that shift are to be immediately tested . Testing an application is a costly procedure  and the number of times an application is to be tested throughout the migration process varies greatly depending on the migration schedule. An interesting algorithmic challenge is to find a schedule that minimizes the total testing cost of all the applications. This problem, referred to as the capacity constrained database migration (CCDM) problem, is known to be NP-hard and fixed-parameter intractable for various relevant parameters . In this paper, we provide new approximability and inapproximability results as well as new conditional lower bounds for the running time of any exact algorithm for the CCDM problem. Also, we adapt heuristic algorithms devised for the Hypergraph Partitioning problem to the CCDM problem and give extensive experimental results. © 2021, Springer Nature Switzerland AG.||Description:||6th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2021 -- 6 September 2021 through 7 September 2021 -- 269749||URI:||https://doi.org/10.1007/978-3-030-93043-1_3
|Appears in Collections:||Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering|
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show full item record
checked on Dec 26, 2022
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.