Publications
Detailed Information
Eliminating FUSE Bottleneck by Implementing Multi-threaded Framework on Distributed File System : 분산 파일 시스템의 퓨즈 멀티 쓰레드 구현을 통한 퓨즈 병목 현상 제거
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- Heon Young YEOM
- Major
- 공과대학 컴퓨터공학부
- Issue Date
- 2017-08
- Publisher
- 서울대학교 대학원
- Keywords
- FUSE bottleneck ; Multi-threaded FUSE ; GlusterFS
- Description
- 학위논문 (석사)-- 서울대학교 대학원 공과대학 컴퓨터공학부, 2017. 8. Heon Young YEOM.
- Abstract
- A popular Filesystem in Userspace (FUSE) is widely used as a data accessing protocol on many modern distributed file systems. FUSE works as a bridge for transferring requests from user application to FUSE-based file system. Actually, it receives requests from user application and then processes some corresponding FUSE operations sequentially by a single FUSE thread. Unfortunately, when a FUSE-based distributed file system performs on workload that consists of a relatively huge number of small-file operations or a very large number of clients, it suffers from overhead of request handling caused by the single FUSE threat. This overhead is the bottleneck of the whole system which significantly degrade the overall performance. In this paper, we propose a multi-threaded FUSE framework that receives and processes requests in parallel which can eliminate the bottleneck caused by that original single FUSE thread. As long as there are requests still available waiting inside the FUSE queue, the other new FUSE thread will be automatically created to receive request and performs some specific FUSE operations simultaneously. We incorporated our mechanism into a GlusterFS distributed file system. The experiment results of our proposed mechanism indicated that depending on the workloads and hardware used, the performance upgradation is improved by 32% on small-file writing workload and 35% on small-file reading workload.
- Language
- English
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.