A comparative performance study of distributed mutual exclusion algorithms with a class of extended Petri nets

dc.contributor.authorKostin, A
dc.contributor.authorIlushechkina, L
dc.contributor.authorBasri, E
dc.date.accessioned2026-02-06T18:28:23Z
dc.date.issued2005
dc.departmentDoğu Akdeniz Üniversitesi
dc.description6th International Conference on Algorithms and Architectures for Parallel Processing -- OCT 02-03, 2005 -- Melbourne, AUSTRALIA
dc.description.abstractA few algorithms of distributed mutual exclusion are discussed, their unified model in terms of a finite-population queuing system is proposed, and their simulation performance study is presented with the assumption that they use multicast communication if possible. To formally represent the algorithms for simulation, a class of extended Petri nets is used. The simulation was done in the simulation system Winsim based on this class of Petri nets.
dc.description.sponsorshipDeakin Univ, Sch IT,Martin Lack & Associates,Deakin Univ, Fac Sci & Technol,Natl ICT Australia,Alexander Technol
dc.identifier.endpage22
dc.identifier.isbn3-540-29235-7
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.scopus2-s2.0-33646397573
dc.identifier.scopusqualityQ3
dc.identifier.startpage11
dc.identifier.urihttps://hdl.handle.net/11129/10903
dc.identifier.volume3719
dc.identifier.wosWOS:000233419000002
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofDistributed and Parallel Computing
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectInformation-Structure
dc.subjectEfficient
dc.titleA comparative performance study of distributed mutual exclusion algorithms with a class of extended Petri nets
dc.typeConference Object

Files