MFAP:Fair Allocation Between Fully Backlogged and Non-Fully Backlogged Applications | |
Sui, Yan ; Yang, Chun ; Tong, Dong ; Liu, Xianhua ; Cheng, Xu | |
2016 | |
英文摘要 | In this paper, we consider the problem of ensuring fairness in systems serving a mixture of fully backlogged applications, which continuously demand resources, and non-fully backlogged applications. We introduce a fairness metric, called interference fairness, the basic idea underlying which is that the interference caused by application A for another application B should be equal to that caused by B for A. To effectively and efficiently guarantee this fairness metric, we propose Mutual Fair Allocation Policy (MFAP), a simple and powerful resource sharing policy, and show how it guarantees interference fairness between any pair of applications. We also show that MFAP, unlike other viable policies, satisfies several highly desirable properties, including some from game theory, as well as common sense intuitions. As a use case, we implemented MFAP on a disk scheduling framework. The experimental results based on synthetic and real workloads show how our implementation achieved interference fairness and improved non-fully backlogged applications performance.; National Natural Science Foundation of China(NNSFC) grant NSFC [61300004]; CPCI-S(ISTP); suiyan@mprc.pku.edu.cn; yangchun@mprc.pku.edu.cn; tongdong@mprc.pku.edu.cn; liuxianhua@mprc.pku.edu.cn; chengxu@mprc.pku.edu.cn; 576-583 |
语种 | 英语 |
出处 | IEEE 34th International Conference on Computer Design (ICCD) |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/459792] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Sui, Yan,Yang, Chun,Tong, Dong,et al. MFAP:Fair Allocation Between Fully Backlogged and Non-Fully Backlogged Applications. 2016-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论