Local-spin group mutual exclusion algorithms.
Published: 2004
Language: eng
Number of pages: 153
Description: The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem in which multiple processes that request the same session (and thus belong to the same "group") may be admitted to the critical section concurrently. We examine N-process group mutual exclusion under two different shared-memory models: the distributed shared-memory (DSM) model and the cache-coherent (CC) model. We prove that the remote memory reference (RMR) complexity of any GME algorithm in the DSM model is O( N), and we present and prove correct several local-spin GME algorithms whose RMR complexity matches this lower bound. We also present a 2-session local-spin GME algorithm for the CC model that beats the lower bound of the DSM model, and use it to construct an M-session GME algorithm. Each algorithm we present is in the form of a reduction to a FCFS abortable mutual exclusion algorithm.
Notes: Adviser:  Vassos Hadzilacos.

Thesis (M.Sc.)--University of Toronto, 2004.

Electronic version licensed for access by U. of T. users.

Source: Masters Abstracts International, Volume: 42-06, page: 2227.

MICR copy on microfiche (2 microfiches).