SEMAPHORE PRIMITIVES AND STARVATION-FREE MUTUAL EXCLUSION

被引：12
|
作者：
STARK, EW
机构：
来源：
JOURNAL OF THE ACM | 1982年 / 29卷 / 04期
关键词：
D O I：
10.1145/322344.322352
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1049 / 1072
页数：24
相关论文
共 50 条
  • [1] AN EFFICIENT STARVATION-FREE SEMAPHORE SOLUTION FOR THE GRAPHICAL MUTUAL EXCLUSION PROBLEM
    YUE, K
    JACOB, RT
    COMPUTER JOURNAL, 1991, 34 (04): : 345 - 349
  • [2] Starvation-free mutual exclusion with semaphores
    Hesselink, Wim H.
    IJbema, Mark
    FORMAL ASPECTS OF COMPUTING, 2013, 25 (06) : 947 - 969
  • [3] STARVATION-FREE SOLUTION TO THE MUTUAL EXCLUSION PROBLEM
    MORRIS, JM
    INFORMATION PROCESSING LETTERS, 1979, 8 (02) : 76 - 80
  • [4] COMMENTS ON MORRIS STARVATION-FREE SOLUTION TO THE MUTUAL EXCLUSION PROBLEM
    ANNOT, JK
    JANSSENS, MD
    VANDEGOOR, AJ
    INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 91 - 97
  • [5] A fair starvation-free prioritized mutual exclusion algorithm for distributed systems
    Lejeune, Jonathan
    Arantes, Luciana
    Sopena, Julien
    Sens, Pierre
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2015, 83 : 13 - 29
  • [6] Modelling and Verification of Starvation-Free Mutual Exclusion Algorithms based on Weak Semaphores
    Cicirelli, Franco
    Nigro, Libero
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2015, 5 : 773 - 779
  • [7] AN ITERATIVE AND STARVATION-FREE SOLUTION FOR A GENERAL-CLASS OF DISTRIBUTED CONTROL-PROBLEMS BASED ON INTERACTION PRIMITIVES
    WEDDE, H
    THEORETICAL COMPUTER SCIENCE, 1983, 24 (01) : 1 - 20
  • [8] A Provably Starvation-Free Distributed Directory Protocol
    Attiya, Hagit
    Gramoli, Vincent
    Milani, Alessia
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2010, 6366 : 405 - +
  • [9] Starvation-free secure multiversion concurrency control
    Kim, HT
    Kim, MH
    INFORMATION PROCESSING LETTERS, 1998, 65 (05) : 247 - 253
  • [10] A scalable and starvation-free concurrent locking mechanism
    Nash, J
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1999, 11 (13): : 823 - 833
12345