### Skapa referens, olika format (klipp och klistra)

**Harvard**

Huang, C. och Jayanti, P. (2016) *Priority mutual exclusion: Specification and algorithm*. : Springer Verlag

** BibTeX **

@conference{

Huang2016,

author={Huang, Chien-Chung and Jayanti, P.},

title={Priority mutual exclusion: Specification and algorithm},

booktitle={Lecture Notes in Computer Science, 30th International Symposium on Distributed Computing, DISC 2016, Paris, France, 27-29 September 2016},

isbn={978-366253425-0},

pages={385-398},

abstract={Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of this problem, which we call priority mutual exclusion, processes have priorities and the requirement is that, whenever the critical section becomes vacant, the next occupant should be the process that has the highest priority among the waiting processes. Instead of first capturing this vague, but intuitively appealing requirement by a rigorously specified condition, earlier research rushed into proposing algorithms. Consequently, as we explain in the paper, none of the existing algorithms meet the reasonable expectations we would have of an algorithm that claims to respect process priorities. This paper fixes this situation by rigorously specifying the priority mutual exclusion problem and designing an efficient algorithm for it. Our algorithm supports an arbitrary number of processes and, when configured to support m priority levels (m can be any natural number), the algorithm has O(m) RMR complexity on both DSM and CC machines.},

publisher={Springer Verlag},

year={2016},

keywords={Artificial intelligence, Computer science, Computers, Arbitrary number, Critical sections, Mutual exclusions, Natural number, Priority levels, Process priority, Distributed computer systems },

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 244678

A1 Huang, Chien-Chung

A1 Jayanti, P.

T1 Priority mutual exclusion: Specification and algorithm

YR 2016

T2 Lecture Notes in Computer Science, 30th International Symposium on Distributed Computing, DISC 2016, Paris, France, 27-29 September 2016

SN 978-366253425-0

SP 385

OP 398

AB Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of this problem, which we call priority mutual exclusion, processes have priorities and the requirement is that, whenever the critical section becomes vacant, the next occupant should be the process that has the highest priority among the waiting processes. Instead of first capturing this vague, but intuitively appealing requirement by a rigorously specified condition, earlier research rushed into proposing algorithms. Consequently, as we explain in the paper, none of the existing algorithms meet the reasonable expectations we would have of an algorithm that claims to respect process priorities. This paper fixes this situation by rigorously specifying the priority mutual exclusion problem and designing an efficient algorithm for it. Our algorithm supports an arbitrary number of processes and, when configured to support m priority levels (m can be any natural number), the algorithm has O(m) RMR complexity on both DSM and CC machines.

PB Springer Verlag

LA eng

DO 10.1007/978-3-662-53426-7_28

LK http://dx.doi.org/10.1007/978-3-662-53426-7_28

OL 30