Busque entre los 169128 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-09-13T13:08:27Z | |
dc.date.available | 2012-09-13T13:08:27Z | |
dc.date.issued | 2009 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/20916 | |
dc.description.abstract | We propose a distributed algorithm for the group mutual exclusion problem in a network with no share memory whose members only communicate by messages. The proposed algorithm is composed by two players: groups and processes, groups are passive players while processes are active players. For the coordination access to the resource, each group has assigned a quorum. The groups have associated priorities in each stage, meanwhile the processes have the same level priority. An important feature is that processes have associated a time to participate in the group in each stage. | en |
dc.format.extent | 282-290 | es |
dc.language | en | es |
dc.subject | Distributed Systems | es |
dc.subject | Mutual exclusion | es |
dc.subject | Concurrency | es |
dc.title | Access coordination: group of processes | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Cenci, Karina M. | es |
sedici.creator.person | Ardenghi, Jorge Raúl | es |
sedici.description.note | Presentado en el IX Workshop Procesamiento Distribuido y Paralelo (WPDP) | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2009-10 | |
sedici.relation.event | XV Congreso Argentino de Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |