PPoPP 2019
Sat 16 - Wed 20 February 2019 Washington, DC, United States
Tue 19 Feb 2019 14:00 - 14:25 at Salon 12/13 - Session 7: Scheduling Chair(s): Jidong Zhai

A common task for all deterministic multithreading (DMT) systems is to enforce synchronization determinism. However, synchronization determinism has not been the focus of existing DMT research. Instead, most DMT systems focused on how to order data races remained after synchronization determinism is enforced. Consequently, existing scheduling policies for synchronization determinism all have limitations. They may either require performance annotations to achieve good performance or fail to provide schedule stability.

In this paper, we argue that synchronization determinism is more fundamental to DMT systems than existing research suggests and propose efficient and effective scheduling policies. Our key insight is that synchronization operations actually encode programmers’ intention on how inter-thread communication should be done and can be used as hints while scheduling synchronization operations. Based on this insight, we have built QiThread, a synchronization-determinism system with semantics-aware scheduling policies. Results of a diverse set of 108 programs show that QiThread is able to achieve comparable low overhead as state-of-the-art synchronization-determinism systems without the limitations associated with them.

Tue 19 Feb

Displayed time zone: Guadalajara, Mexico City, Monterrey change

14:00 - 15:15
Session 7: SchedulingMain Conference at Salon 12/13
Chair(s): Jidong Zhai Tsinghua University
14:00
25m
Talk
Semantics-Aware Scheduling Policies for Synchronization Determinism
Main Conference
Qi Zhao North Carolina State University, Zhengyi Qiu North Carolina State University, Guoliang Jin North Carolina State University
DOI
14:25
25m
Talk
Proactive Work Stealing for Futures
Main Conference
Kyle Singer Washington University in St. Louis, Yifan Xu Washington University in St. Louis, I-Ting Angelina Lee Washington University in St. Louis
DOI
14:50
25m
Talk
A Round-Efficient Distributed Betweenness Centrality Algorithm
Main Conference
Loc Hoang University of Texas at Austin, USA, Matteo Pontecorvi Nokia Bell Labs, Roshan Dathathri University of Texas at Austin, USA, Gurbinder Gill University of Texas at Austin, USA, Bozhi You Xi'an Jiaotong University, Keshav Pingali University of Texas at Austin, USA, Vijaya Ramachandran University of Texas at Austin
DOI