Yong-Jik Kim

Learn More
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)
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)
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)
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)
We present an <i>N</i>-process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs &Theta;(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)