Group Mutual Exclusion Based on Priorities

We propose a distributed solution for the group mutual exclusion problem based on priorities, 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 p...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cenci, Karina M., Ardenghi, Jorge Raúl
Formato: Articulo
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
Distributed Systems
Parallelism and concurrency
Mutual exclusion
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9691
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr11-4.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9691
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Distributed Systems
Parallelism and concurrency
Mutual exclusion
spellingShingle Ciencias Informáticas
Distributed Systems
Parallelism and concurrency
Mutual exclusion
Cenci, Karina M.
Ardenghi, Jorge Raúl
Group Mutual Exclusion Based on Priorities
topic_facet Ciencias Informáticas
Distributed Systems
Parallelism and concurrency
Mutual exclusion
description We propose a distributed solution for the group mutual exclusion problem based on priorities, 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 a base priority 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. The message complexity obtain, in the best case, where the group does not yield the permission, is 3l + 3(q - 1) messages, where l denotes the processes linked and q denotes the quorum size. The maximum concurrency of the algorithm is n, which implies that all processes have linked to the same group.
format Articulo
Articulo
author Cenci, Karina M.
Ardenghi, Jorge Raúl
author_facet Cenci, Karina M.
Ardenghi, Jorge Raúl
author_sort Cenci, Karina M.
title Group Mutual Exclusion Based on Priorities
title_short Group Mutual Exclusion Based on Priorities
title_full Group Mutual Exclusion Based on Priorities
title_fullStr Group Mutual Exclusion Based on Priorities
title_full_unstemmed Group Mutual Exclusion Based on Priorities
title_sort group mutual exclusion based on priorities
publishDate 2011
url http://sedici.unlp.edu.ar/handle/10915/9691
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr11-4.pdf
work_keys_str_mv AT cencikarinam groupmutualexclusionbasedonpriorities
AT ardenghijorgeraul groupmutualexclusionbasedonpriorities
bdutipo_str Repositorios
_version_ 1764820492570591234

Ejemplares similares