Presentation 1999/10/25
Shared-Memory Contention of Mutual Exclusion Algorithms
Yoshifumi Suda, Hiroki Furuya, Wenjun Huang, Yasuaki Nishitani,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Most complexity measures for concurrent algorithms for asynchronous shared-memory systems focus on process steps and memory consumption. However, performance of multiprocessor algorithms is heavily influenced by contention, the extent to which processes access the same location at the same time. In this paper, we analyze contention of Peterson's mutual exclusion algorithms, and show that the amortized contention of 2-process mutual exclusion algorithm is equal to 1/2, and that for n>__-3, the amortized contention of n-process mutual exclusion algorithm is greater than n/3-5/9.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) asynchronous shared-memory systems / mutual exclusion / contention
Paper # COMP99-43
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Shared-Memory Contention of Mutual Exclusion Algorithms
Sub Title (in English)
Keyword(1) asynchronous shared-memory systems
Keyword(2) mutual exclusion
Keyword(3) contention
1st Author's Name Yoshifumi Suda
1st Author's Affiliation Department of Computer Science, Gunma University()
2nd Author's Name Hiroki Furuya
2nd Author's Affiliation Department of Computer Science, Gunma University
3rd Author's Name Wenjun Huang
3rd Author's Affiliation Department of Computer Science, Gunma University
4th Author's Name Yasuaki Nishitani
4th Author's Affiliation Department of Computer Science, Gunma University
Date 1999/10/25
Paper # COMP99-43
Volume (vol) vol.99
Number (no) 388
Page pp.pp.-
#Pages 8
Date of Issue