Kamesh Munagala

Kamesh Munagala

Auto-generated profile, based on publicly available information

Kamesh Munagala

Duke University, Durham, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
19 February 2011 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
MAMumtaz Ahmad
Mumtaz Ahmad
AAAshraf Aboulnaga
Ashraf Aboulnaga
SBShivnath Babu
Shivnath Babu
KMKamesh Munagala
Kamesh Munagala
The typical workload in a database system consists of a mix of multiple queries of different types that run concurrently. Interactions among the different queries in a query mix can have a significant impact on database performance. Hence, optimizing database performance requires reasoning about query mixes rather than considering queries individually. Current database systems lack the ability to do such reasoning. We propose a new approach based on planning experiments and statistical modeling to capture the impact of query interactions. Our approach requires no prior assumptions about the internal workings of the database system or the nature and cause of query interactions, making it portable across systems. To demonstrate the potential of modeling and exploiting query interactions, we have developed a novel interaction-aware query scheduler for report-generation workloads. Our scheduler, called QShuffler, uses two query scheduling algorithms that leverage models of query interactions. The first algorithm is optimized for workloads where queries are submitted in large batches. The second algorithm targets workloads where queries arrive continuously, and scheduling decisions have to be made online. We report an experimental evaluation of QShuffler using TPC-H workloads running on IBM DB2. The evaluation shows that QShuffler, by modeling and exploiting query interactions, can consistently outperform (up to 4x) query schedulers in current database systems.

16 October 2020 in ACM Transactions on Economics and Computation
Verified
Journal Article
Open access
YCYu Cheng
Yu Cheng
ZJZhihao Jiang
Zhihao Jiang
KMKamesh Munagala
Kamesh Munagala
KWKangning Wang
Kangning Wang
In this article, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all these voters strictly prefer the new committee to the existing one. Our main contribution is to extend this definition to stability of a distribution (or lottery) over committees. We consider two canonical voter preference models: the A pproval S et setting where each voter approves a set of candidates and prefers committees with larger intersection with this set; and the R anking R epresentative setting where each voter ranks committees based on how much she likes her favorite candidate in a committee. Our main result is to show that stable lotteries always exist for these canonical preference models. Interestingly, given preferences of voters over committees, the procedure for computing an approximately stable lottery is the same for both models and therefore extends to the setting where some voters have the former preference structure and others have the latter. Our existence proof uses the probabilistic method and a new large deviation inequality that may be of independent interest.

1 March 2006
Verified
Conference Paper
Closed access
SGSudipto Guha
Sudipto Guha
KMKamesh Munagala
Kamesh Munagala
SSSaswati Sarkar
Saswati Sarkar
We consider a wireless system with multiple channels when each channel has several different transmission states. Different states are associated with different probabilities of successful transmissions. In such networks, we are faced with making transmission decisions in the presence of partial information about channel states. This (typically probabilistic) information about any channel can be refined by sending control packets in the channels. In presence of multiple alternative channels, this process of probing every channel to find the best one is onerous and resource consuming. There is a natural tradeoff between the resource consumed in probing and the estimate of channel state we can obtain. The desired tradeoff can be attained by judiciously determining which and how many channels to probe and also which channel to transmit. We present adaptive algorithms for provably approximating the desired tradeoffs within constant factors.

16 June 2013
Verified
Conference Paper
Open access
PDF file
ABAnand Bhalgat
Anand Bhalgat
SGSreenivas Gollapudi
Sreenivas Gollapudi
KMKamesh Munagala
Kamesh Munagala

9 December 2022
Verified
Book Chapter
Closed access
PDF file
KMKamesh Munagala
Kamesh Munagala
YSYiheng Shen
Yiheng Shen
KWKangning Wang
Kangning Wang

1 April 2008
Verified
Conference Paper
Closed access
MAMumtaz Ahmad
Mumtaz Ahmad
AAAshraf Aboulnaga
Ashraf Aboulnaga
SBShivnath Babu
Shivnath Babu
KMKamesh Munagala
Kamesh Munagala
The typical workload in a database system consists of a mixture of multiple queries of different types, running concurrently and interacting with each other. Hence, optimizing performance requires reasoning about query mixes and their interactions, rather than considering individual queries or query types. In this paper, we use such a reasoning approach to develop a query scheduler. We treat the database system as a black box and experimentally build a model to estimate the performance of different query mixes. Our scheduler uses this model to decide which query mixes to schedule, with the goal of maximizing throughput. We experimentally demonstrate the effectiveness of our scheduler using queries from the TPC-H benchmark on DB2.