wPerf: Generic Off-CPU Analysis to Identify Bottleneck Waiting Events

Authors: 

Fang Zhou, Yifan Gan, Sixiang Ma, and Yang Wang, The Ohio State University

Abstract: 

This paper tries to identify waiting events that limit the maximal throughput of a multi-threaded application. To achieve this goal, we not only need to understand an event's impact on threads waiting for this event (i.e., local impact), but also need to understand whether its impact can reach other threads that are involved in request processing (i.e., global impact).

To address these challenges, wPerf computes the local impact of a waiting event with a technique called cascaded re-distribution; more importantly, wPerf builds a wait-for graph to compute whether such impact can indirectly reach other threads. By combining these two techniques, wPerf essentially tries to identify events with large impacts on all threads.

We apply wPerf to a number of open-source multi-threaded applications. By following the guide of wPerf, we are able to improve their throughput by up to 4.83$\times$. The overhead of recording waiting events at runtime is about 5.1% on average.

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

Presentation Audio

BibTeX
@inproceedings {222617,
author = {Fang Zhou and Yifan Gan and Sixiang Ma and Yang Wang},
title = {wPerf: Generic Off-CPU Analysis to Identify Bottleneck Waiting Events},
booktitle = {13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18)},
year = {2018},
isbn = {978-1-931971-47-8},
address = {Carlsbad, CA},
pages = {527--543},
url = {https://www.usenix.org/conference/osdi18/presentation/zhou},
publisher = {{USENIX} Association},
}