Suzuki–Kasami algorithm (original) (raw)
The Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only process able to enter its critical section. This is a modification to Ricart–Agrawala algorithm in which a REQUEST and REPLY message are used for attaining the critical section, but in this algorithm, a method was introduced in which a seniority vise and also by handing over the critical section to other node by sending a single PRIVILEGE message to other node. So, the node which has the privilege it can use the critical section and if it does not have one it cannot. If a process wants to enter its critical section and it does not have the token, it broadcasts a request message to all other processes in the system. The process that has the
| Property | Value |
|---|---|
| dbo:abstract | The Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only process able to enter its critical section. This is a modification to Ricart–Agrawala algorithm in which a REQUEST and REPLY message are used for attaining the critical section, but in this algorithm, a method was introduced in which a seniority vise and also by handing over the critical section to other node by sending a single PRIVILEGE message to other node. So, the node which has the privilege it can use the critical section and if it does not have one it cannot. If a process wants to enter its critical section and it does not have the token, it broadcasts a request message to all other processes in the system. The process that has the token, if it is not currently in a critical section, will then send the token to the requesting process. The algorithm makes use of increasing Request Numbers to allow messages to arrive out-of-order. (en) |
| dbo:wikiPageID | 23001183 (xsd:integer) |
| dbo:wikiPageLength | 4696 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1091156530 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Algorithm dbr:Node_(networking) dbr:Critical_section dbr:Mutual_exclusion dbr:Access_token dbc:Distributed_algorithms dbr:Lamport_timestamps dbr:Distributed_systems dbr:Ricart–Agrawala_algorithm |
| dbp:wikiPageUsesTemplate | dbt:More_citations_needed dbt:Reflist |
| dct:subject | dbc:Distributed_algorithms |
| rdfs:comment | The Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only process able to enter its critical section. This is a modification to Ricart–Agrawala algorithm in which a REQUEST and REPLY message are used for attaining the critical section, but in this algorithm, a method was introduced in which a seniority vise and also by handing over the critical section to other node by sending a single PRIVILEGE message to other node. So, the node which has the privilege it can use the critical section and if it does not have one it cannot. If a process wants to enter its critical section and it does not have the token, it broadcasts a request message to all other processes in the system. The process that has the (en) |
| rdfs:label | Suzuki–Kasami algorithm (en) |
| owl:sameAs | wikidata:Suzuki–Kasami algorithm https://global.dbpedia.org/id/4vath |
| prov:wasDerivedFrom | wikipedia-en:Suzuki–Kasami_algorithm?oldid=1091156530&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Suzuki–Kasami_algorithm |
| is dbo:wikiPageRedirects of | dbr:Suzuki-Kasami_algorithm dbr:Suzuki_kasami |
| is dbo:wikiPageWikiLink of | dbr:Suzuki-Kasami_algorithm dbr:Ricart–Agrawala_algorithm dbr:Suzuki_kasami |
| is foaf:primaryTopic of | wikipedia-en:Suzuki–Kasami_algorithm |