Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Help
Sign on to:
My DSpace
Receive email
updates
Edit Profile
BITS Pilani Institutional Repository
Browsing by Author Jangiti, Saikishor
Jump to:
0-9
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
or enter first few letters:
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 11 to 14 of 14
< previous
Issue Date
Title
Author(s)
2018
Scalable and direct vector bin-packing heuristic based on residual resource ratios for virtual machine placement in cloud data centers
Jangiti, Saikishor
2019-05
Scalable hybrid and ensemble heuristics for economic virtual resource allocation in cloud and fog cyber-physical systems
Jangiti, Saikishor
2018-08
Virtual Machine (VM) placement consolidates VMs into a minimum number of Physical Machines (PMs), which can be viewed as a Vector Bin-Packing (VBP) problem. Recent literature reveals the significance of first-fit-decreasing variants in solving VBP problems, however they suffer from reduced packing efficiency and delayed packing speed. This paper presents VM NeAR (VM Nearest and Available to Residual resource ratios of PM), a novel heuristic method to address the above said challenges in VBP. Further, we have developed Bulk-Bin-Packing based VM Placement (BBPVP) and Multi-Capacity Bulk VM Placement (MCBVP) as a solution for VBP. The simulation results on real-time Amazon EC2 dataset and synthetic datasets obtained from CISH, SASTRA shows that VM NeAR based MCVBP achieves about 1.6% reduction in the number of PMs and possess a packing speed which was found to be 24 times faster than exisiting state-of-the-art VBP heuristics.
Jangiti, Saikishor
2018
Workflow Scheduling In Clouds Using Randomized Scheduling Algorithm
Jangiti, Saikishor