Service meshes play a central role in the modern application ecosystem by providing an
easy and flexible way to connect microservices of a distributed application. However …

A fork–join system with Pareto service time distribution is considered as a model of a parallel
structure of data processing. For an approximation of the mean response time of the system …

The workflows of the predominant datacenter services are underlaid by various Fork-Join
structures. Due to the lack of good understanding of the performance of Fork-Join structures …

The traffic load sent to key-value (KV) stores varies over long timescales of hours to short
timescales of a few microseconds. Long-term variations present the opportunity to save …

The workflows of the predominant user-facing datacenter services, including web searching
and social networking, are underlaid by various Fork-Join structures. Due to the lack of …

The Fork-Join structure underlays many distributed computing applications in data centers.
In this paper, we develop a technique, called ForkMV, to estimate the mean and variance of …

Systems continue to grow in complexity in response to the need to support vast quantities of
data and a wide variety of workloads. Small changes in workloads and system configuration …

Large-scale interactive Web services break a user's request to many sub-requests and send
them to a large number of independent servers so as to consult multi-terabyte datasets …

As a fundamental cloud service, the cloud object storage system stores and retrieves
millions or even billions of read-heavy data objects. Serving for a massive amount of …

Consolidating applications is a practical necessity in today's datacenters to reduce cost and
improve resource utilization. However, resource sharing among different applications may …