Write a Blog >>
PPoPP 2021
Sat 27 February - Wed 3 March 2021
Tue 2 Mar 2021 12:30 - 12:36 - Session 6. Posters 1 Chair(s): Adam Morrison

The \emph{group mutual exclusion (GME)} problem is a generalization of the classical mutual exclusion problem in which every critical section is associated with a \emph{type} or \emph{session}. Critical sections belonging to the same session can execute concurrently, whereas critical sections belonging to different sessions must be executed serially. The well-known read-write mutual exclusion problem is a special case of the group mutual exclusion problem.

In this work, we present a suite of GME algorithms for an asynchronous shared-memory system under the cache coherent (CC) model. Our GME algorithms have the feature that they do not require an \emph{a priori} knowledge of the set of processes in the system and all their important complexity measures depend only on the number of different sessions that can be requested by processes. This makes them especially suitable for a dynamic system in which the set of processes may change over time. To our knowledge, no existing GME algorithm satisfies this property. Our GME algorithms provide different trade offs between complexity and fairness.

Conference Day
Tue 2 Mar

Displayed time zone: Eastern Time (US & Canada) change

12:30 - 13:18
Session 6. Posters 1Main Conference
Chair(s): Adam MorrisonTel Aviv University
12:30
6m
Talk
POSTER: On Group Mutual Exclusion for Dynamic Systems
Main Conference
Shreyas GokhaleThe University of Texas at Dallas, Sahil DhokedThe University of Texas at Dallas, Neeraj MittalThe University of Texas at Dallas
Link to publication
12:36
6m
Talk
POSTER: Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries
Main Conference
Jacob NelsonLehigh University, Ahmed HassanLehigh University, Roberto PalmieriLehigh University
Link to publication
12:42
6m
Talk
POSTER: Verifying C11-Style Weak Memory Libraries
Main Conference
Sadegh DalvandiUniversity of Surrey, Brijesh DongolUniversity of Surrey
Link to publication
12:48
6m
Talk
POSTER: A Lock-free Relaxed Concurrent Queue for Fast Work Distribution
Main Conference
Giorgos KappesUniversity of Ioannina, Stergios V. AnastasiadisUniversity of Ioannina
Link to publication
12:54
6m
Talk
POSTER: A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
Main Conference
Jesper TräffTU Wien, Austria, Manuel PöterTU Wien, Austria
Link to publication
13:00
6m
Talk
POSTER: Extending MapReduce Framework with Locality Keys
Main Conference
Yifeng ChengPeiking University, China, Bei WangPeking University, China, Xiaolin WangPeking University, China
Link to publication
13:06
6m
Talk
POSTER: On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization
Main Conference
Grzegorz KwasniewskiETH Zurich, Tal Ben-NunDepartment of Computer Science, ETH Zurich, Alexandros Nikolaos ZiogasETH Zurich, Timo SchneiderETH Zurich, Maciej BestaETH Zurich, Torsten HoeflerETH Zurich
Link to publication
13:12
6m
Talk
POSTER: Asynchrony versus Bulk-Synchrony for a Generalized N-body Problem from Genomics
Main Conference
Marquita EllisUniversity of California at Berkeley & Lawrence Berkeley National Lab, Aydın BuluçUniversity of California at Berkeley & Lawrence Berkeley National Lab, Katherine YelickUniversity of California at Berkeley & Lawrence Berkeley National Lab
Link to publication