상세 보기
A Survey on Minimizing Lock Contention in Shared Resources in Linux Kernel
- Cho, S.;
- Lee, S.;
- Pham, K.T.;
- Anh, N.L.;
- Kim, S.;
- ... Son, Y.
SCOPUS
1초록
Many programs in multi-core environment use shared-memory parallelism using multi-threading. The multiple threads typically use locks to coordinate access the shared resources. In many cases, contention for locks reduces parallel efficiency and affects the scalability. Thus, it is important to study lock contention problems and its solutions in shared resources in multi-core era. In this paper, we investigate the studies to minimizing lock contention in shared resources in Linux kernel. For example, we study fine-grained locking mechanisms, lock-free based schemes, and scheduler schemes to minimize the lock contention in Linux kernel. Thus, we simplify and categorize the schemes and finally identify future research directions.
키워드
- 제목
- A Survey on Minimizing Lock Contention in Shared Resources in Linux Kernel
- 저자
- Cho, S.; Lee, S.; Pham, K.T.; Anh, N.L.; Kim, S.; Son, Y.
- 발행일
- 2022-10
- 유형
- Conference Paper
- 저널명
- International Conference on ICT Convergence
- 권
- 2022-October
- 페이지
- 1133 ~ 1135
- 언어
- ENG
- 출판사
- IEEE Computer Society
- 발행국가
- 미국
- 분량
- 3 페이지
- ISSN
- P 2162-1233