Fast and fair mutual exclusion for shared memory systems

Autor:	Ting-Lu Huang
Rok vydání:	2003
Předmět:	Distributed shared memory Computer engineering Shared memory Computer science Distributed algorithm Fetch Distributed memory Mutual exclusion Remote memory Parallel computing Mutual exclusion algorithms
Zdroj:	ICDCS
DOI:	10.1109/icdcs.1999.776524
Popis:	Two fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented. The first one uses both compares the second uses only fetch&store. Fetch&store are more commonly available than compare&swap. It is impossible to obtain better algorithms if "time" is measured by counting remote memory references. We were able to maintain the same level of performance with or without the support of compare&swap. However, fairness is degraded from 1-bounded bypass to lockout freedom without the support.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::733507adbb74982a997cb081687545eb https://doi.org/10.1109/icdcs.1999.776524 Zobrazit plný text záznamu