Stable Scheduling in Transactional Memory

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study computer systems with transactions executed on a set of shared objR framed as an adversarial model and impose limits on the average rate of transaction generation and the number of objects that transactions use. We show that no deterministic distributed scheduler in the queue-free model of transaction autonomy can provide stability for any positive rate of transaction generation. Let a system consist of m shared objects and an adversary be constrained such that each transaction may access at most k shared objects. We prove that no scheduler can be stable if a generation rate is greater than We develop a centralized scheduler that is stable if a transaction generation rate is at most We design a distributed scheduler in the queue-based model of transaction autonomy, in which a transaction is assigned to an individual processor, that guarantees stability if the rate of transaction generation is less than For each of the schedulers we give upper bounds on the queue size and transaction latency in the range of rates of transaction generation for which the scheduler is stable.

Original languageEnglish (US)
Title of host publicationAlgorithms and Complexity - 13th International Conference, CIAC 2023, Proceedings
EditorsMarios Mavronicolas
PublisherSpringer Science and Business Media Deutschland GmbH
Pages172-186
Number of pages15
ISBN (Print)9783031304477
DOIs
StatePublished - 2023
Event13th International Symposium on Algorithms and Complexity, CIAC 2023 - Larnaca, Cyprus
Duration: Jun 13 2023Jun 16 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13898 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Algorithms and Complexity, CIAC 2023
Country/TerritoryCyprus
CityLarnaca
Period6/13/236/16/23

Keywords

  • Transactional memory
  • adversarial model
  • dynamic transaction generation
  • latency
  • shared object
  • stability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Stable Scheduling in Transactional Memory'. Together they form a unique fingerprint.

Cite this