Shrinker: efficient live migration of virtual clusters over wide area networks

Riteau, Pierre; Morin, Christine; Priol, Thierry

doi:10.1002/cpe.2861

Cited by 8 publications

(8 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While for the FBA algorithm, the Bandwidth Adaptive Allocation strategy put by this paper solve this problem appropriately. The bandwidth is calculated by applying the formula (13) in FBA realize the changing of bandwidth together with the dirty pages, so the utilization of the bandwidth can be increased . Fig.…”

Section: ) Test Results A) the Relationship Between Bandwidth And Thementioning

confidence: 99%

“…Sun [12] using Markov prediction model to optimize the selection of working set in pre-copy mechanism, in order to reduce the transmission of redundant data, but this method limited to the high rate of dirty pages only. Riteau [13] proposed a mechanism called Shrinker, through examination of memory pages to avoid repeatedly sending copies of the same content, thus reducing the amount of data and time during the migration, but this method can not change bandwidth allocation dynamically according to business characteristics.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration

Shuang¹

2016

JACN

View full text Add to dashboard Cite

Virtual machine(VM) live migration is a core feature of virtualization which enables dynamic resource requirements to be matched with available physical resources, leading to better performance and reduced energy consumption. A group of pages have been mapped writable in response to the migration algorithm, however there lacks a algorithm to choose the matching algorithm dynamically based on the upper running features. This paper propose FBA algorithm which can first divide all the migrations into two types "sluggish dirty page" and "swifting dirty page" by monitoring the value of skip_to, moreover this paper present corresponding corrective strategies for migrating the two types of application. Finally via simulation and experiments with real system prototypes, the results show that when it belongs to "swifting dirty page", compared with existing pre-copy algorithm FBA algorithm improve the bandwidth utilization and reduce the total migration time; while for the "sluggish dirty page", the pre-copy algorithm will fail and FBA algorithm makes a beneficial supplement.

show abstract

Section: ) Test Results A) the Relationship Between Bandwidth And Thementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration

Shuang¹

2016

JACN

View full text Add to dashboard Cite

show abstract

“…The research ranges across a wide spectrum, from practical viewpoint to minimize the migration overhead [7], [8], [11], [12], [14], [22]- [27] to the theoretical perspective that leverages the migration mechanism as a substrate to develop various migration strategies for different research goals [19]- [21], [28]- [32].…”

Section: Background and Related Workmentioning

confidence: 99%

“…Bradford et al [9] show that when combining a blocklevel solution with pre-copying and write throttling strategies, an entire running web server, including its local file system, can be migrated with a minimal disruption of 3 seconds in a LAN and 68 seconds in a WAN. Later, H. Liu et al [10] report that by adopting checkpointing/recovery and trace/replay technologies, a transparent VM migration for both LAN and WAN environments can be achieved in a very efficient way where the downtime for a variety of workloads (including static and dynamic web applications) could be reduced to only 200 ms (with a small standard deviation), Additionally, there are also some prototyped systems developed to further demonstrate the feasibility of migrating a single or multiple VMs in practice in Clouds [12]- [14], [41], each of them can be used as a substrate to support our migration algorithms.…”

Section: Background and Related Workmentioning

confidence: 99%

“…Fortunately, advances in virtualization technologies make it feasible to migrate one or more virtual server(s) (including relevant requested services) over a wide-area network (WAN) with minimum overhead [9]- [11]. Some well-designed VM migration systems (e.g., VMFlock [12], CloudNet [13], and Shrinker [14]) have demonstrated the feasibility even efficiency of such an approach in practice. Thus, from a technical viewpoint, co-migration over a WAN is never a prohibitively expensive operation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line

Wang

Shi

2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In this paper, we study the problem of co-migrating a set of service replicas residing on one or more redundant virtual servers in clouds in order to satisfy a sequence of mobile batch-request demands in a cost effective way. With such a migration, we can not only reduce the service access latency for end users but also minimize the network costs for service providers. The co-migration can be achieved at the cost of bulk-data transfer and increases the overall monetary costs for the service providers. To gain the benefits of service migration while minimizing the overall costs, we propose a co-migration algorithm Migk for multiple servers, each hosting a service replicas. Migk is a randomized algorithm with a competitive cost of O() to migrate κ services in a static n-node network where γ is the maximal ratio of the migration costs between any pair of neighbor nodes in the network, and where λ and µ represent the maximum wired transmission cost and the wireless link cost respectively. For comparison, we also study this problem in its static off-line form by proposing a parallel dynamic programming (hereafter DP) based algorithm that integrates the branch&bound strategy with sampling techniques in order to approximate the optimal DP results. We validate the advantage of the proposed algorithms via extensive simulation studies using various requests patterns and cloud network topologies. Our simulation results show that the proposed algorithms can effectively adapt to mobile access patterns to satisfy the service request sequences in a cost-effective way.

show abstract

Special Issue: Euro‐Par 2011

Bougé

Lengauer

2012

Concurrency and Computation

View full text Add to dashboard Cite

This special issue of Concurrency and Computation: Practice and Experience contains revised and extended versions of selected papers presented at the conference Euro-Par 2011.Euro-Par-the European Conference on Parallel Computing-is an annual series of international conferences dedicated to the promotion and advancement of all aspects of parallel and distributed computing. Euro-Par covers a wide spectrum of topics from algorithms and theory to software technology and hardware-related issues, with application areas ranging from scientific to mobile and cloud computing. The major part of the Euro-Par audience consists of researchers in academic institutions, government laboratories and industrial organizations.Euro-Par 2011, the 17th conference in the Euro-Par series, was organized by the National Institute for Research in Computer Science and Control (INRIA) and the University of Bordeaux, and held at the University of Bordeaux in the center of Bordeaux, France.Sixteen broad topics were defined and advertised, covering a large variety of aspects of parallel and distributed computing. The call for papers attracted a total of 271 submissions. The submitted papers were reviewed at least three and, in many cases, four times (3.58 on average). A total of 81 papers were finally accepted for publication. This makes a global acceptance rate of 29.9%. The authors of accepted papers come from 26 countries, with the four main contributing countries-the USA, France, Spain and Germany-accounting for about 64% of them. The distribution of papers follows the pattern typical for a Euro-Par conference: 58% are authored by academic researchers, 26% by students, and 12% by other authors (industry, non-governmental organizations, and government).With the results of the reviews and a majority opinion of the respective topic program committees, several papers were recommended for a special journal issue. The authors were contacted at the conference and invited to submit revised and extended versions of their papers. These new versions were reviewed independently by three reviewers; two had also reviewed the conference version, the third had not. Eventually, six papers were accepted for publication.Topic 2 on Performance Prediction and Evaluation is represented by the paper Backfilling with guarantees made as jobs arrive, authored by Alexander Lindsay, Maxwell Galloway-Carson, Christopher Johnson, David Bunde, and Vitus Leung [1]. In job scheduling, the term backfilling refers to the approach of assigning a job an earlier time than the predicted starting time if holes appear in the scheduling plan. Their new contribution is to give preference to jobs with higher priority, as defined by a job selection function. They explore two different such functions and validate their benefits with simulation experiments.Topic 5 on Parallel and Distributed Data Management is represented by the paper ISABELA for effective in situ compression of scientific data, authored by Sriram Lakshminarasimhan, Neil Shah, Stephane Ethier, Seung-Hoe Ku, C. S. Chan...

show abstract

Shrinker: efficient live migration of virtual clusters over wide area networks

Cited by 8 publications

References 28 publications

Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration

Flexible Bandwidth Allocation Algorithm for Virtual Machine Live Migration

Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line

Special Issue: Euro‐Par 2011

Contact Info

Product

Resources

About