Fair resource is a key building block of any shared computing system. Recently fair division theory has emerged as a promising approach for the allocation of multiple computational resources among agents. Recent research has discussed efficiency and fairness requirements and identified a number if desirable scheduling objectives including so-called dominant resource fairness(DRF). DRF is not good between fair and resource utilization. A new allocation model Balancing Fairness and Efficiency with Bottleneck-Aware Allocation(BAA) find good appropriate balance between fairness to the clients and maximizing system utilization. But BAA without taking into account the weight value and maximum number of tasks which are users need to run. We propose the IBAA fair allocation mechanism. IBAA has lots of good properties, it satisfies DSI, PE and EF. We construct IBAA mechanisms that provably satisfy properties, and analyze the performance. We believe that our work informs the design of superior multiusers system, and at the same time expands the scope of fair division theory by initiating the study of dynamic and fair resource allocation mechanisms.
목차
Abstract 1. Introduction 2. Problem Definition 2.1. Basic Setting 2.2. Improve Constrained Resources Fairness Policy 3. Fairness Properties 4. Experimental Results 5. Conclusion and Future Work References
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.8 No.11