Distributed Speed Scaling in Large-Scale Service Systems

Daan Rutten, Martin Zubeldia, Debankur Mukherjee

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a large-scale parallel-server loss system with an unknown arrival rate, where each server is able to adjust its processing speed. The objective is to minimize the system cost, which consists of a power cost to maintain the servers' processing speeds and a quality of service cost depending on the tasks' processing times, among others. We draw on ideas from stochastic approximation to design a novel speed scaling algorithm and prove that the servers' processing speeds converge to the globally asymptotically optimum value. Curiously, the algorithm is fully distributed and does not require any communication between servers. Apart from the algorithm design, a key contribution of our approach lies in demonstrating how concepts from the stochastic approximation literature can be leveraged to effectively tackle learning problems in large-scale, distributed systems. En route, we also analyze the performance of a fully heterogeneous parallel-server loss system, where each server has a distinct processing speed, which might be of independent interest.

Original languageEnglish (US)
Pages (from-to)95-96
Number of pages2
JournalPerformance Evaluation Review
Volume52
Issue number1
DOIs
StatePublished - Jun 10 2024

Bibliographical note

Publisher Copyright:
© 2024 Owner/Author.

Keywords

  • distributed optimization
  • load balancing
  • speed scaling

Cite this