2 research outputs found
An Open-Source Benchmark Suite for Cloud and IoT Microservices
Cloud services have recently started undergoing a major shift from monolithic
applications, to graphs of hundreds of loosely-coupled microservices.
Microservices fundamentally change a lot of assumptions current cloud systems
are designed with, and present both opportunities and challenges when
optimizing for quality of service (QoS) and utilization. In this paper we
explore the implications microservices have across the cloud system stack. We
first present DeathStarBench, a novel, open-source benchmark suite built with
microservices that is representative of large end-to-end services, modular and
extensible. DeathStarBench includes a social network, a media service, an
e-commerce site, a banking system, and IoT applications for coordination
control of UAV swarms. We then use DeathStarBench to study the architectural
characteristics of microservices, their implications in networking and
operating systems, their challenges with respect to cluster management, and
their trade-offs in terms of application design and programming frameworks.
Finally, we explore the tail at scale effects of microservices in real
deployments with hundreds of users, and highlight the increased pressure they
put on performance predictability
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
We consider the classic problem of scheduling jobs with precedence
constraints on a set of identical machines to minimize the makespan objective
function. Understanding the exact approximability of the problem when the
number of machines is a constant is a well-known question in scheduling theory.
Indeed, an outstanding open problem from the classic book of Garey and Johnson
asks whether this problem is NP-hard even in the case of 3 machines and
unit-length jobs. In a recent breakthrough, Levey and Rothvoss gave a
-approximation algorithm, which runs in nearly quasi-polynomial
time, for the case when job have unit lengths. However, a substantially more
difficult case where jobs have arbitrary processing lengths has remained open.
We make progress on this more general problem. We show that there exists a
-approximation algorithm (with similar running time as that of
Levey and Rothvoss) for the non-migratory setting: when every job has to be
scheduled entirely on a single machine, but within a machine the job need not
be scheduled during consecutive time steps. Further, we also show that our
algorithmic framework generalizes to another classic scenario where, along with
the precedence constraints, the jobs also have communication delay constraints.
Both of these fundamental problems are highly relevant to the practice of
datacenter scheduling