A novel resource selection framework to improve QoS in computational grid

Kavitha, G.; Sankaranarayanan, V.

doi:10.1504/ijcse.2014.058705

Cited by 4 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One challenge is that data-intensive applications may be built upon conventional frameworks, such as shared-nothing parallel database management systems, or modern frameworks, such as MapReduce (Cardosa et al, 2011), and so have very different resource requirements. A second challenge is that the parallel nature of large-scale data-intensive applications requires that scheduling (Hu et al, 2010;Achar et al, 2012;Murugesan and Chellappan, 2014) and resource allocation (Kavitha and Sankaranarayanan, 2014;Allenotor and Thulasiram, 2011) be done to avoid data transfer bottlenecks. A third challenge is to support effective scaling of resources when large volumes of data are involved.…”

Section: Introductionmentioning

confidence: 99%

Live migration of virtual machines with their local persistent storage in a data intensive cloud

Modi

Achar

Thilagam

2017

IJHPCN

View full text Add to dashboard Cite

Abstract:Processing large volumes of data to drive their core business has been the primary objective of many firms and scientific applications in these days. Cloud computing being a large-scale distributed computing paradigm can be used to cater for the needs of data intensive applications. There are various approaches for managing the workload on a data intensive cloud. Live migration of a virtual machine is the most prominent paradigm. Existing approaches to live migration use network attached storage where just the run time state needs to be transferred. Live migration of virtual machines with local persistent storage has been shown to have performance advantages like security, availability and privacy. This paper presents an optimised approach for migration of a virtual machine along with its local storage by considering the locality of storage access. Count map combined with a restricted block transfer mechanism is used to minimise the downtime and overhead. The solution proposed is tested by various parameters like bandwidth, write access patterns and threshold. Results show the improvement in downtime and reduction in overhead.

show abstract

Section: Introductionmentioning

confidence: 99%

Live migration of virtual machines with their local persistent storage in a data intensive cloud

Modi

Achar

Thilagam

2017

IJHPCN

View full text Add to dashboard Cite

show abstract

“…The estimated AB plays an important role in network protocols of routing selection, admission control, congestion control, and QoS management (Kavitha and Sankaranarayanan, 2014). Therefore, many researchers paid attention to design an efficient and accurate tool to estimate the AB.…”

Section: Introductionmentioning

confidence: 99%

End-to-end available bandwidth estimation using HybChirp

Chi

Zheng

Xie

et al. 2016

IJCSE

View full text Add to dashboard Cite

Abstract:The available bandwidth is a crucial metric of networks performance which is applied in congestion control, route selection, traffic analysis and QoS management. PathChirp is a well-known tool to estimate available bandwidth based on an approach of self-induced congestion, which exponentially increases the rate of probing packets in each packet train. But the inappropriate gaps of probing rates often result in a large deviation of estimated available bandwidth. In order to solve this problem, we propose HybChirp, an active probing tool which uses linearly spaced probing packets (lin-chirps) and exponentially spaced probing packets (exp-chirps) in combination. HybChirp improves PathChirp by adopting the hybrid of lin-chirps and exp-chirps, while inherits the advantages of PathChirp such as the short convergence time and low overhead. The NS-2 simulation results have shown that HybChirp outperforms PathChirp and Pathload in terms of accuracy, overhead, convergence time and adaptivity.

show abstract

Task Scheduling Using Two-Phase Variable Neighborhood Search Algorithm on Heterogeneous Computing and Grid Environments

Selvi¹,

Manimegalai²

2015

Arab J Sci Eng

View full text Add to dashboard Cite

A novel resource selection framework to improve QoS in computational grid

Cited by 4 publications

References 11 publications

Live migration of virtual machines with their local persistent storage in a data intensive cloud

Live migration of virtual machines with their local persistent storage in a data intensive cloud

End-to-end available bandwidth estimation using HybChirp

Task Scheduling Using Two-Phase Variable Neighborhood Search Algorithm on Heterogeneous Computing and Grid Environments

Contact Info

Product

Resources

About