Name
Abstract | ||
|---|---|---|
Non-volatile write cache (NVWC) can help to improve the performance of I/O-intensive tasks, especially write-dominated tasks. The benefit of NVWC, however, cannot be fully exploited if an admission policy blindly caches all writes without differentiating the criticality of each write in terms of application performance. We propose a request-oriented admission policy, which caches only writes awaited in the context of request execution. To accurately detect such writes, a critical process, which is involved in handling requests, is identified by applicationlevel hints. Then, we devise criticality inheritance protocols in order to handle process and I/O dependencies to a critical process. The proposed scheme is implemented on the Linux kernel and is evaluated with PostgreSQL relational database and Redis NoSQL store. The evaluation results show that our scheme outperforms the policy that blindly caches all writes by up to 2.2× while reducing write traffic to NVWC by up to 87%. |
Year | Venue | Field |
|---|---|---|
2015 | USENIX Annual Technical Conference | Relational database,Cache,Computer science,Parallel computing,Real-time computing,NoSQL,Criticality,Operating system,Linux kernel |
DocType | Citations | PageRank |
Conference | 4 | 0.46 |
References | Authors | |
57 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang-Wook Kim | 1 | 792 | 152.77 |
| Hwanju Kim | 2 | 4 | 0.46 |
| Sang-Hoon Kim | 3 | 9 | 3.61 |
| Joonwon Lee | 4 | 1438 | 90.35 |
| Jinkyu Jeong | 5 | 300 | 21.96 |