IEICE TRANSACTIONS on Fundamentals
Adaptive Arbitration of Fair QoS Based Resource Allocation in Multi-Tier Computing Systems
Summary :
This paper proposes an adaptive resource allocation for multi-tier computing systems to guarantee a fair QoS level under resource constraints of tiers. We introduce a multi-tier computing architecture which consists of a group of resource managers and an arbiter. Resource allocation of each client is managed by a dedicated resource manager. Each resource manager updates resources allocated to subtasks of its client by locally exchanging QoS levels with other resource managers. An arbiter compensates the updated resources to avoid overload conditions in tiers. Based on the compensation by the arbiter, the subtasks of each client are executed in corresponding tiers. We derive sufficient conditions for the proposed resource allocation to achieve a fair QoS level avoiding overload conditions in all tiers with some assumptions on a QoS function and a resource consumption function of each client. We conduct a simulation to demonstrate that the proposed resource allocation can adaptively achieve a fair QoS level without causing any overload condition.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.9 pp.1678-1683
- Publication Date
- 2010/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1678
- Type of Manuscript
- PAPER
- Category
- Concurrent Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Naoki HAYASHI, Toshimitsu USHIO, Takafumi KANAZAWA, "Adaptive Arbitration of Fair QoS Based Resource Allocation in Multi-Tier Computing Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 9, pp. 1678-1683, September 2010, doi: 10.1587/transfun.E93.A.1678.
Abstract: This paper proposes an adaptive resource allocation for multi-tier computing systems to guarantee a fair QoS level under resource constraints of tiers. We introduce a multi-tier computing architecture which consists of a group of resource managers and an arbiter. Resource allocation of each client is managed by a dedicated resource manager. Each resource manager updates resources allocated to subtasks of its client by locally exchanging QoS levels with other resource managers. An arbiter compensates the updated resources to avoid overload conditions in tiers. Based on the compensation by the arbiter, the subtasks of each client are executed in corresponding tiers. We derive sufficient conditions for the proposed resource allocation to achieve a fair QoS level avoiding overload conditions in all tiers with some assumptions on a QoS function and a resource consumption function of each client. We conduct a simulation to demonstrate that the proposed resource allocation can adaptively achieve a fair QoS level without causing any overload condition.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1678/_p
Copy
@ARTICLE{e93-a_9_1678,
author={Naoki HAYASHI, Toshimitsu USHIO, Takafumi KANAZAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Adaptive Arbitration of Fair QoS Based Resource Allocation in Multi-Tier Computing Systems},
year={2010},
volume={E93-A},
number={9},
pages={1678-1683},
abstract={This paper proposes an adaptive resource allocation for multi-tier computing systems to guarantee a fair QoS level under resource constraints of tiers. We introduce a multi-tier computing architecture which consists of a group of resource managers and an arbiter. Resource allocation of each client is managed by a dedicated resource manager. Each resource manager updates resources allocated to subtasks of its client by locally exchanging QoS levels with other resource managers. An arbiter compensates the updated resources to avoid overload conditions in tiers. Based on the compensation by the arbiter, the subtasks of each client are executed in corresponding tiers. We derive sufficient conditions for the proposed resource allocation to achieve a fair QoS level avoiding overload conditions in all tiers with some assumptions on a QoS function and a resource consumption function of each client. We conduct a simulation to demonstrate that the proposed resource allocation can adaptively achieve a fair QoS level without causing any overload condition.},
keywords={},
doi={10.1587/transfun.E93.A.1678},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Adaptive Arbitration of Fair QoS Based Resource Allocation in Multi-Tier Computing Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1678
EP - 1683
AU - Naoki HAYASHI
AU - Toshimitsu USHIO
AU - Takafumi KANAZAWA
PY - 2010
DO - 10.1587/transfun.E93.A.1678
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2010
AB - This paper proposes an adaptive resource allocation for multi-tier computing systems to guarantee a fair QoS level under resource constraints of tiers. We introduce a multi-tier computing architecture which consists of a group of resource managers and an arbiter. Resource allocation of each client is managed by a dedicated resource manager. Each resource manager updates resources allocated to subtasks of its client by locally exchanging QoS levels with other resource managers. An arbiter compensates the updated resources to avoid overload conditions in tiers. Based on the compensation by the arbiter, the subtasks of each client are executed in corresponding tiers. We derive sufficient conditions for the proposed resource allocation to achieve a fair QoS level avoiding overload conditions in all tiers with some assumptions on a QoS function and a resource consumption function of each client. We conduct a simulation to demonstrate that the proposed resource allocation can adaptively achieve a fair QoS level without causing any overload condition.
ER -
English
