Publications

Export 6 results:
Sort by: Author [ Title  (Asc)] Type Year
A B C D E F G H I J K L M N [O] P Q R S T U V W X Y Z   [Show ALL]
O
Arun, KS, Govindan VK, Kumar MSD.  2017.  On integrating re-ranking and rank list fusion techniques for image retrieval, May. International Journal of Data Science and Analytics. : Springer AbstractWebsite
n/a
Jain, S, MP G, MadhuKumar SD, Jacob L.  2018.  On the Necessity of Right Optimizations for Live Migration of Virtual Machines. IEEE TENSYMP. , Sydney, Australia: IEEE Explore
BabithaBalachandran, MadhuKumar SD.  2013.  Optimization Of Reconfiguration Time During Client Movement On Siena, August 2013. International Conference on Advances in Computing, Communications and Informatics (ICACCI-2013. , Mysore India
Shabeera, TP, MadhuKumar SD.  2015.  Optimizing Virtual Machine Allocation in MapReduce Cloud for improved Data Locality. Inderscience International Journal of Big Data Intelligence (IJBD). Vol.2 No.1(March 2015)
Shabeera, TP, MadhuKumar SD, Salam SM, Krishnan MK.  2016.  Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm. Elsevier-Engineering Science and Technology, an International Journal. :-. AbstractWebsite

Abstract Nowadays data-intensive applications for processing big data are being hosted in the cloud. Since the cloud environment provides virtualized resources for computation, and data-intensive applications require communication between the computing nodes, the placement of Virtual Machines (VMs) and location of data affect the overall computation time. Majority of the research work reported in the current literature consider the selection of physical nodes for placing data and \{VMs\} as independent problems. This paper proposes an approach which considers \{VM\} placement and data placement hand in hand. The primary objective is to reduce cross network traffic and bandwidth usage, by placing required number of \{VMs\} and data in Physical Machines (PMs) which are physically closer. The \{VM\} and data placement problem (referred as MinDistVMDataPlacement problem) is defined in this paper and has been proved to be NP- Hard. This paper presents and evaluates a metaheuristic algorithm based on Ant Colony Optimization (ACO), which selects a set of adjacent \{PMs\} for placing data and VMs. Data is distributed in the physical storage devices of the selected PMs. According to the processing capacity of each PM, a set of \{VMs\} are placed on these \{PMs\} to process data stored in them. We use simulation to evaluate our algorithm. The results show that the proposed algorithm selects \{PMs\} in close proximity and the jobs executed in the \{VMs\} allocated by the proposed scheme outperforms other allocation schemes.

Shabeera, TP, MadhuKumar SD, Salam SM, Krishnan MK.  2017.  Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm. Engineering Science and Technology, an International Journal. 20:616-628., Number 2 AbstractWebsite

n/a