Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Chandy–Misra–Haas_algorithm
|
| gptkbp:application |
resource allocation
concurrency control |
| gptkbp:citation |
Communications of the ACM, 1984
|
| gptkbp:designedFor |
distributed systems
|
| gptkbp:feature |
prevents deadlock
prevents starvation |
| gptkbp:notableFor |
distributed mutual exclusion
|
| gptkbp:proposedBy |
gptkb:J._Misra
gptkb:K._Mani_Chandy |
| gptkbp:solvedBy |
gptkb:dining_philosophers_problem
|
| gptkbp:uses |
message passing
token-based mechanism |
| gptkbp:yearProposed |
1984
|
| gptkbp:bfsParent |
gptkb:J._Misra
|
| gptkbp:bfsLayer |
9
|
| http://www.w3.org/2000/01/rdf-schema#label |
Chandy–Misra algorithm
|