policies studied in the literature assume that the system is homogeneous, meaning that all servers have the same speed; meanwhile, real-world systems often exhibit server speed heterogeneity. We introduce a general framework for describing and analyzing heterogeneity-aware power-of-d policies. The key idea behind our framework is that dispatching policies can make

Bio: Kristy Gardner is an Assistant Professor in the Computer Science Department at Amherst College. Her work primarily focuses on designing and analyzing dispatching policies for large-scale systems. She received her M.S. and PhD in 2015 and 2017 respectively, both from Carnegie Mellon University, and her B.A. in 2012 from Amherst College.use of server speed information at two decision points: when choosing which d servers to query, and when assigning a job to one of those servers. Our framework explicitly separates the dispatching policy into a querying rule and an assignment rule; we consider general families of both rule types. In this talk, we will focus on heterogeneity-aware assignment rules that ignore queue length information beyond idleness status. In this setting, we analyze mean response time and formulate novel optimization problems for the joint optimization of querying and assignment. We build upon our optimized policies to develop heuristic queue length-aware dispatching policies. We will also discuss extensions, our ongoing work, and open problems. Based on joint work with Jazeem Abdul Jaleel, Sherwin Doroudi, and Alexander Wickeham.