Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ganesha Shanmuganathan

dblp:127/9204 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 74% Storage systems · 16% Distributed systems · 11%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.212013
Defragmenting the cloud using demand-based resource allocation · SIGMETRICS 2013
Cloud and datacenter computing
resource allocation
0.212013
Defragmenting the cloud using demand-based resource allocation · SIGMETRICS 2013
Cloud and datacenter computing
virtualization
0.212013
Defragmenting the cloud using demand-based resource allocation · SIGMETRICS 2013
Cloud and datacenter computing
quality of service
0.112012
Demand Based Hierarchical QoS Using Storage Resource Pools · USENIX ATC 2012
Storage systems › storage management
storage resource management
0.112012
Demand Based Hierarchical QoS Using Storage Resource Pools · USENIX ATC 2012
Distributed systems
distributed coordination
0.012013
Defragmenting the cloud using demand-based resource allocation · SIGMETRICS 2013
Distributed systems › distributed resource management
distributed resource allocation
0.012013
Defragmenting the cloud using demand-based resource allocation · SIGMETRICS 2013

Methods — techniques the papers use, named apart from their topics

distributed algorithm · 0.2demand-based allocation · 0.2
YearPublicationVenuePosition
2013 Defragmenting the cloud using demand-based resource allocation
abstract
Current public cloud offerings sell capacity in the form of pre-defined virtual machine (VM) configurations to their tenants. Typically this means that tenants must purchase individual VM configurations based on the peak demands of the applications, or be restricted to only scale-out applications that can share a pool of VMs. This diminishes the value proposition of moving to a public cloud as compared to server consolidation in a private virtualized datacenter, where one gets the benefits of statistical multiplexing between VMs belonging to the same or different applications. Ideally one would like to enable a cloud tenant to buy capacity in bulk and benefit from statistical multiplexing among its workloads. This requires the purchased capacity to be dynamically and transparently allocated among the tenant's VMs that may be running on different servers, even across datacenters. In this paper, we propose two novel algorithms called BPX and DBS that are able to provide the cloud customer with the abstraction of buying bulk capacity. These algorithms dynamically allocate the bulk capacity purchased by a customer between its VMs based on their individual demands and user-set importance. Our algorithms are highly scalable and are designed to work in a large-scale distributed environment. We implemented a prototype of BPX as part of VMware's management software and showed that BPX is able to closely mimic the behavior of a centralized allocator in a distributed manner.
Ganesha Shanmuganathan, Ajay Gulati, Peter J. Varman
SIGMETRICS1
2012 Demand Based Hierarchical QoS Using Storage Resource Pools
Ajay Gulati, Ganesha Shanmuganathan, Xuechen Zhang 0001, Peter J. Varman
USENIX ATC2
2011 Pesto: online storage performance management in virtualized datacenters
abstract
Virtualized datacenters strive to reduce costs through workload consolidation. Workloads exhibit a diverse set of IO behaviors and varying IO load that makes it difficult to estimate the IO performance on shared storage. As a result, system administrators often resort to gross overprovisioning or static partitioning of storage to meet application demands. In this paper, we introduce Pesto, a unified storage performance management system for heterogeneous virtualized datacenters. Pesto is the first system that completely automates storage performance management for virtualized datacenters, providing IO load balancing with cost-benefit analysis, per-device congestion management, and initial placement of new workloads.
Ajay Gulati, Ganesha Shanmuganathan, Irfan Ahmad 0005, Carl A. Waldspurger, Mustafa Uysal
SoCC2