License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ECRTS.2018.25
URN: urn:nbn:de:0030-drops-89789
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8978/
Go to the corresponding LIPIcs Volume Portal

Nemitz, Catherine E. ; Amert, Tanya ; Anderson, James H.

Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts

pdf-format:
LIPIcs-ECRTS-2018-25.pdf (1 MB)

Abstract

During the past decade, parallelism-related issues have been at the forefront of real-time systems research due to the advent of multicore technologies. In the coming years, such issues will loom ever larger due to increasing core counts. Having more cores means a greater potential exists for platform capacity loss when the available parallelism cannot be fully exploited. In this paper, such capacity loss is considered in the context of real-time locking protocols. In this context, lock nesting becomes a key concern as it can result in transitive blocking chains that force tasks to execute sequentially unnecessarily. Such chains can be quite long on a larger machine. Contention-sensitive real-time locking protocols have been proposed as a means of "breaking" transitive blocking chains, but such protocols tend to have high overhead due to more complicated lock/unlock logic. To ease such overhead, the usage of lock servers is considered herein. In particular, four specific lock-server paradigms are proposed and many nuances concerning their deployment are explored. Experiments are presented that show that, by executing cache hot, lock servers can enable reductions in lock/unlock overhead of up to 86%. Such reductions make contention-sensitive protocols a viable approach in practice.

BibTeX - Entry

@InProceedings{nemitz_et_al:LIPIcs:2018:8978,
  author =	{Catherine E. Nemitz and Tanya Amert and James H. Anderson},
  title =	{{Using Lock Servers to Scale Real-Time Locking Protocols: Chasing Ever-Increasing Core Counts}},
  booktitle =	{30th Euromicro Conference on Real-Time Systems (ECRTS 2018)},
  pages =	{25:1--25:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-075-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{106},
  editor =	{Sebastian Altmeyer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8978},
  URN =		{urn:nbn:de:0030-drops-89789},
  doi =		{10.4230/LIPIcs.ECRTS.2018.25},
  annote =	{Keywords: multiprocess locking protocols, nested locks, priority-inversion blocking, reader/writer locks, real-time locking protocols}
}

Keywords: multiprocess locking protocols, nested locks, priority-inversion blocking, reader/writer locks, real-time locking protocols
Collection: 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)
Issue Date: 2018
Date of publication: 22.06.2018
Supplementary Material: ECRTS Artifact Evaluation approved artifact available at https://dx.doi.org/10.4230/DARTS.4.2.2

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI