Title: Fast and fair mutual exclusion for shared memory systems
Authors: Huang, TL
資訊工程學系
Department of Computer Science
Issue Date: 1999
Abstract: Two fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented. The first one uses both compare&swap and fetch&store; 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.
URI: http://hdl.handle.net/11536/19399
ISBN: 0-7695-0222-9
ISSN: 1063-6927
Journal: 19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS
Begin Page: 224
End Page: 231
Appears in Collections:Conferences Paper