Shrisha Rao

Prof. Shrisha Rao

orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 May 2013 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
APAbhinandan S. Prasad
Abhinandan S. Prasad
SRShrisha Rao
Shrisha Rao
We present a cloud resource procurement approach which not only automates the selection of an appropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloud resource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible (C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCG mechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budget balance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowest cost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner. C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, but also individually rational. Our experiments indicate that the resource procurement cost decreases with increase in number of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud broker which can implement C-DSIC, C-BIC, or C--OPT to perform resource procurement in a cloud computing context. A cloud broker with such a procurement module enables users to automate the choice of a cloud vendor among many with diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.

26 October 2017
Verified
Book Chapter
Closed access
PDF file
SSSneha Singhania
Sneha Singhania
NFNigel Fernandez
Nigel Fernandez
SRShrisha Rao
Shrisha Rao

9 May 2014 in IEEE Systems Journal
Verified
Journal Article
Closed access
PPParvathy S. Pillai
Parvathy S. Pillai
SRShrisha Rao
Shrisha Rao
Virtualization of resources on the cloud offers a scalable means of consuming services beyond the capabilities of small systems. In a cloud that offers infrastructure such as processor, memory, hard disk, etc., a coalition of virtual machines formed by grouping two or more may be needed. Economical management of cloud resources needs allocation strategies with minimum wastage, while configuring services ahead of actual requests. We propose a resource allocation mechanism for machines on the cloud, based on the principles of coalition formation and the uncertainty principle of game theory. We compare the results of applying this mechanism with existing resource allocation methods that have been deployed on the cloud. We also show that this method of resource allocation by coalition-formation of the machines on the cloud leads not only to better resource utilization but also higher request satisfaction.

12 August 2010 in IEEE Systems Journal
Verified
Journal Article
Closed access
IMIndrani Maity
Indrani Maity
SRShrisha Rao
Shrisha Rao
A framework is proposed for an electrical power microgrid, such as for a colony or small township of homes that generate electrical power from solar energy and use it directly when possible, and via stored battery power at other times. The situation is described as a demand and supply problem in a multi-agent system with many consumers and suppliers and no explicit communication or coordination among the agents. Such a demand and supply problem is modeled as a Potluck Problem, a generalization of the Santa Fe Bar Problem. Power produced by PV panels and batteries may be used in the local market, in addition to being consumed locally. The proposed microgrid system model is able to determine the optimum operation of a solar-powered microgrid with respect to load demand, environmental requirements, PV panel and battery capacities. The results indicate the effect of various such parameters on the performance of these micro-grids. This paper also analyzes and proposes, based on auction theory, the most efficient and competing pricing mechanism in the proposed microgrid system model. Two important market bidding techniques, single bidding and discriminatory bidding, are considered. The microgrid is made to participate in the bidding process to serve the consumers at a reduced price and to provide better revenues. The viability of the model proposed is illustrated with analyses using realistic assumptions and published historical data.

17 January 2018 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
ATAshutosh Trivedi
Ashutosh Trivedi
SRShrisha Rao
Shrisha Rao
During mass evacuations, many psychological and physical factors are responsible for stampedes and other life threatening situations. Quantitative and qualitative analyses of these factors are of high importance while devising optimal strategies for evacuations. In this paper, we present an agent-based model that considers psychological and physical factors that cause panic in such situations. We have also simulated some simple evacuation scenarios and presented a method to identify possible bottlenecks and shortcomings in the environments during emergency evacuations. Our method also helps in evaluation and analysis of different evacuation strategies. To enable this analysis, we have used a rule-based roadmap approach, where critical nodes in the environment are identified by the evacuation planner and each node has a special rule according to the strategy of the planner. We evaluate different strategies on parameters, such as evacuation time and physical discomfort caused to the agents.

25 March 2014 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
PAPragati Agrawal
Pragati Agrawal
SRShrisha Rao
Shrisha Rao
Scheduling of tasks on a multi-machine system to reduce the makespan, while satisfying the precedence constraints between the tasks, is known to be an NP-hard problem. We propose a new formulation and show that energy-aware scheduling is a generalization of the minimum makespan scheduling problem. Taking the system graph and program graph as inputs, we propose three different algorithms for energy-aware scheduling, each of them having its own strengths and limitations. The first is a genetic algorithm (Plain GA) that searches for an energy reducing schedule. The second (CA+GA) uses cellular automata (CA) to generate low energy schedules, while using a genetic algorithm (GA) to find good rules for the CA. The third (EAH) is a heuristic which gives preference to high-efficiency machines in allocation. We have tested our algorithms on well-known program graphs and compared our results with other state-of-the-art scheduling algorithms, which confirms the efficacy of our approach. Our work also gives insight into the time-energy trade-offs in scheduling.