A Scheduling Algorithm for Load Balance Sensitive Storage

您当前的位置：

首页 >

文章列表页 >

A Scheduling Algorithm for Load Balance Sensitive Storage

更新时间：2025-07-09

- A Scheduling Algorithm for Load Balance Sensitive Storage
- Vol. 43, Issue 10, Pages: 61-65(2009)
- 作者机构：
  
  西安交通大学电子与信息工程学院,西安,710049
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Online First：10 October 2009，
  
  Published：2009
- 稿件说明：
移动端阅览
A Scheduling Algorithm for Load Balance Sensitive Storage[J]. 2009, 43(10): 61-65.
DOI：

A Scheduling Algorithm for Load Balance Sensitive Storage[J]. 2009, 43(10): 61-65. DOI：

摘要

针对应用层存储聚合中的调度问题

提出了一种支持负载均衡的存储调度(LBS)算法.LBS是一种基于策略的调度算法

它将应用对存储资源的需求转换为一系列约束

再通过分析约束之间的关系选择合适的存储节点或者已有的调度方案

从而提高了调度方案的复用率

维护了策略复用与节点负载之间的平衡关系

寻找到最佳的负载均衡策略.模拟测试表明

LBS算法在负载均衡方面和策略耦合方面明显优于Least和Random算法

负载均衡指标最高可提升10倍左右.

Abstract

According to the scheduling problem in storage aggregating of application-level

a scheduling algorithm for load balance sensitive storage(LBS)is proposed based on policy. In the LBS algorithm

requirements from applications for storage are represented as a series of restrictions. The LBS then makes choice between new appropriate storage nodes and existing scheduling scenario by analyzing relations between restrictions so that the reusability of scheduler scenarios can be improved. The LBS maintains the balance between the reusability of policy and the load of storage

and achieves the goal of load balance finally. The simulation and comparisons show that the LBS outperforms the Random and the Least obviously in load balancing

policy decupling and scalability

and that the load balance of the LBS improves 10 times against the two baseline algorithms.

关键词

Keywords

references

GANTZ J. The diverse and exploding digital universe: an updated forecast of worldwide information growth through 2011 [M]. Framingham, MA,USA:IDC, 2008.

胡周君,胡志刚,李林.一种基于性能评估的元任务调度算法 [J].西安交通大学学报, 2008, 42(8): 972-976.

HU Zhoujun, HU Zhigang, LI Lin. Performance evaluation based meta-task scheduling algorithm [J]. Journal of Xi'an Jiaotong University, 2008,42(8):972-976.

MCNAB R, HOWELL F. Using java for discrete event simulation [C]∥Proceedings of 12th UK Computer and Telecommunications Performance Engineering Workshop. Edinburgh, UK:UKPEW,1996:219-228.

GABBER E, FELLIN J, FLASTER M, et al. Starfish: highly-available block storage [C]∥Proceedings of the Freenix Track: 2003 USENIX Annual Technical Conference. San Antonio, Texas, USA:USENIX, 2003: 151-163.

CRAINICEANU A, LINGA P, MACHANAVAJJHALA A, et al. P-ring: an efficient and robust P2P range index structure[C]∥Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data. New York, USA: ACM, 2007: 223-234.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Sensitivity Analysis of Foil Geometrical Parameters for the Third-Generation CO2 Gas Foil Bearings Based on Design of Experiments Method

Effects of Expansion Angle Crater Film Hole on the Film Cooling Characteristics of a Double-Wall Structure

Turbulent Kinetic Energy Dissipation Mechanism of Supercritical Carbon Dioxide Leakage Flow in a Scallop Bionic Seal Cavity

Integrated and Joint Design Optimization of Centrifugal Compressor Impeller and Casing Treatment at Multiple Working Points

Numerical Simulation of Heat-Moisture Barrier Performance of a Horizontal Air Curtain in Cold Storage

Related Author

No data

Related Institution

No data

⁰