Suchergebnisse - "bakery algorithm"

  1. 1

    Mechanical verification of Lamport’s Bakery algorithm von Hesselink, Wim H.

    ISSN: 0167-6423, 1872-7964
    Veröffentlicht: Elsevier B.V 01.09.2013
    Veröffentlicht in Science of computer programming (01.09.2013)
    “… The technique is presented here by applying it to Lamport’s Bakery algorithm. The proofs for safety properties such as mutual exclusion, first-come …”
    Volltext
    Journal Article
  2. 2

    Correctness and concurrent complexity of the Black-White Bakery Algorithm von Hesselink, Wim H.

    ISSN: 0934-5043, 1433-299X
    Veröffentlicht: London Springer London 01.04.2016
    Veröffentlicht in Formal aspects of computing (01.04.2016)
    “… Lamport’s Bakery Algorithm (Commun ACM 17:453–455, 1974 ) implements mutual exclusion for a fixed number of threads with the first-come first-served property …”
    Volltext
    Journal Article
  3. 3

    Highly-fair bakery algorithm using symmetric tokens von Aravind, Alex A.

    ISSN: 0020-0190, 1872-6119
    Veröffentlicht: Amsterdam Elsevier B.V 15.11.2010
    Veröffentlicht in Information processing letters (15.11.2010)
    “… This note proposes a new version of the bakery algorithm that: (i) assures fair tie-breaking when two or more processes choose same token number; and (ii …”
    Volltext
    Journal Article
  4. 4

    Nonatomic dual bakery algorithm with bounded tokens von Aravind, Alex A., Hesselink, Wim H.

    ISSN: 0001-5903, 1432-0525
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.04.2011
    Veröffentlicht in Acta informatica (01.04.2011)
    “… A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the …”
    Volltext
    Journal Article
  5. 5

    Group mutual exclusion in linear time and space von He, Yuan, Gopalakrishnan, K., Gafni, Eli

    ISSN: 0304-3975, 1879-2294
    Veröffentlicht: Elsevier B.V 24.01.2018
    Veröffentlicht in Theoretical computer science (24.01.2018)
    “… (N) Remote Memory Reference (RMR) complexity in the Cache Coherency (CC) model. Our first algorithm is developed by generalizing the well-known Lamport's Bakery …”
    Volltext
    Journal Article
  6. 6

    Avoiding Register Overflow in the Bakery Algorithm von Sayyadabdi, Amirhossein, Sharifi, Mohsen

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 04.07.2020
    Veröffentlicht in arXiv.org (04.07.2020)
    “… Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination …”
    Volltext
    Paper
  7. 7

    Design Simulation Queue Cake Shop With Lamport's Bakery Algorithm von Manaha, Roberth Ricki Manaha, Janeman Summah

    ISSN: 2089-3329, 2797-7889
    Veröffentlicht: 01.09.2021
    Veröffentlicht in Jurnal Info Sains : Informatika dan Sains (01.09.2021)
    “… One of them is Lamport with a method known as Lamport's Bakery Algorithm. The work process of Lamport's Bakery Algorithm starts from the buyer entering the store and receiving the sequence number …”
    Volltext
    Journal Article
  8. 8

    Asml specification and verification of Lamport's bakery algorithm von BOTINCAN, Matko

    ISSN: 1330-1136, 1846-3908
    Veröffentlicht: Zagreb University Computing Centre 30.12.2005
    Veröffentlicht in Journal of computing and information technology (30.12.2005)
    “… We present a specification of Lamport's Bakery algorithm written in AsmL specification language …”
    Volltext
    Journal Article Paper
  9. 9

    Formal Modeling, Analysis and Verification of Black White Bakery Algorithm von Nawaz, M. Saqib, Lali, M. Ikram Ullah, Sun Meng

    ISBN: 9781538630211, 1538630214
    Veröffentlicht: IEEE 01.08.2017
    “… In this article, Black White (BW) Bakery algorithm is formally analyzed and verified in SPIN model checker …”
    Volltext
    Tagungsbericht
  10. 10
  11. 11
  12. 12
  13. 13

    Shared Memory and the Bakery Algorithm

    ISBN: 1450372716, 9781450372718
    Veröffentlicht: United States Association for Computing Machinery 2019
    Veröffentlicht in Concurrency (2019)
    Volltext
    Buchkapitel
  14. 14

    Method and Case Study of Model Checking Concurrent Systems That Use Unbounded Timestamps von Nakano, Shinya, Tsuchiya, Tatsuhiro

    ISSN: 2473-3105
    Veröffentlicht: IEEE 01.01.2017
    “… Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are …”
    Volltext
    Tagungsbericht
  15. 15
  16. 16

    Minimal Multi-tasking Operating System for RISC-V von B, Karunatharaka, Kamal, Sakshi, G S, Sharvani

    Veröffentlicht: IEEE 16.12.2022
    “… With the emergence of Open Source RISC-V Architectures, many companies are making the shift to use it to avoid licensing of proprietary architectures. Instead …”
    Volltext
    Tagungsbericht
  17. 17
  18. 18

    Verification of Bakery algorithm variants for two processes von Dedic, D., Meolic, R.

    ISBN: 078037763X, 9780780377639
    Veröffentlicht: IEEE 2003
    Veröffentlicht in Eurocon 2003 (2003)
    “… This paper is about Bakery algorithm for mutual exclusion. Three variants of the algorithm for two processes are discussed, formally modelled with a simple process algebra and then verified …”
    Volltext
    Tagungsbericht
  19. 19

    Concurrent Algorithms in SPIN Model Checker von Nawaz, M. Saqib, Ali, Hussam, Lali, M. Ikram Ullah

    Veröffentlicht: IEEE 01.12.2016
    “… In this article, two famous concurrent algorithms for mutual exclusion problem (Bakery algorithm and Dekker algorithm …”
    Volltext
    Tagungsbericht
  20. 20

    Consistency requirements of distributed shared memory for Lamport's bakery algorithm for mutual exclusion von Brzezinski, J., Wawrzyniak, D.

    ISBN: 9780769505008, 0769505007
    Veröffentlicht: IEEE 2000
    “… As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes …”
    Volltext
    Tagungsbericht