#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1999

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

#### Organism

Learn More

- James H. Anderson, Yong-Jik Kim, Ted Herman
- Distributed Computing
- 2003

In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.

- James H. Anderson, Yong-Jik Kim
- Distributed Computing
- 2001

We establish a lower bound of &OHgr;(log <i>N</i>/log log <i>N</i>) remote memory references for <i>N</i>-process mutual exclusion algorithms based on reads, writes, or comparison primitives. Our bound improves an earlier bound of &OHgr;(log log <i>N</i>/log log log <i>N</i>) established by Cypher.

- James H. Anderson, Yong-Jik Kim
- DISC
- 1999

We present an N -process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and (logN) time complexity under contention, where \time" is measured by counting remote memory references. This is the rst such algorithm to achieve these time complexity bounds. Our algorithm is obtained by… (More)

- James H. Anderson, Yong-Jik Kim
- Distributed Computing
- 2000

We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p performs O(k) remote memory references to enter and exit its critical section, where k is the maximum “point contention” experienced by p. The space complexity of our algorithm is Θ(N),… (More)

- Yong-Jik Kim, James H. Anderson
- DISC
- 2001

We consider the time complexity of adaptive mutual exclusion algorithms, where \time" is measured by counting the number of remote memory references required per critical-section access. We establish a lower bound that precludes a deterministic algorithm with O(log k) time complexity (in fact, any deterministic o(k) algorithm), where k is \point… (More)

- Yong-Jik Kim, James H. Anderson
- Distributed Computing
- 2011

We consider the time complexity of adaptive mutual exclusion algorithms, where “time” is measured by counting the number of remote memory references required per critical-section access. For systems that support (only) read, write, and comparison primitives (such as compare-and-swap), we establish a lower bound that precludes a deterministic algorithm with… (More)

- Lucia H. S. Cevidanes, Alexandre A Franco, +7 authors Julio Wilson Vigorito
- American journal of orthodontics and dentofacial…
- 2005

INTRODUCTION
Three-dimensional (3D) craniofacial images are commonly used in clinical studies in orthodontics to study developmental and morphologic relationships.
METHODS
We used 3D magnetic resonance imaging to study relationships among craniofacial components during the pubertal growth spurt and in response to Fränkel appliance therapy. The sample for… (More)

- James H. Anderson, Yong-Jik Kim
- Distributed Computing
- 2002

We present an <i>N</i>-process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs Θ(log <i>N</i>) remote memory references to enter and exit its critical section. No atomic read/write algorithm with better asymptotic worst-case time complexity is currently known. This suggests that atomic memory… (More)

We present a generic fetch-and-based local-spin mutual exclusion algorithm, with O(1) time complexity under the remote-memory-references time measure. This algorithm is \generic" in the sense that it can be implemented using any fetch-andprimitive of rank 2N , where N is the number of processes. The rank of a fetch-andprimitive is a notion introduced… (More)

- Yong-Jik Kim, James H. Anderson
- Inf. Process. Lett.
- 2002