RFUSE의 성능 개선을 위한 N-way 스케줄링 기법

초록

RFUSE is a framework that supports managing the filesystem in user space. It employs multiple ring channels to guarantee better performance than a traditional FUSE framework. However, RFUSE can cause imbalanced resource utilization when intensive jobs have concentrated on a specific CPU because of the channel distribution policy of RFUSE. In this paper, we proposed a new distribution policy, called N-way, that could improve resource utilization by decreasing conflict with other jobs on CPUs based on the set-associative policy, like the CPU cache mechanism, to address the performance bottleneck issue. Since the proposed policy forms multiple ring channels into sets and assigns each job to one channel in a round-robin manner inside a set, the N-way policy can reduce the waste of CPU cache and ensure suitable scheduling among CPUs. To confirm the performance of the proposed scheduling policy, we evaluated the N-way policy using Filebench and YCSB benchmarks. As a result, the proposed policy showed higher performance than traditional RFUSE policies by up to 25%.

키워드