Lazy Scheduling Based Disk Energy Optimization Method

被引:0
|
作者
Yong Dong
Juan Chen
Yuhua Tang
Junjie Wu
Huiquan Wang
Enqiang Zhou
机构
[1] with the School of Computer Science,National University of Defense Technology
[2] the National Innovation Institute of Defense Technology
关键词
high-performance computing system; storage systems; disk energy savings; lazy scheduling; disk seek; time window;
D O I
暂无
中图分类号
TP333.35 [];
学科分类号
081201 ;
摘要
Reducing the energy consumption of the storage systems disk read/write requests plays an important role in improving the overall energy efficiency of high-performance computing systems.We propose a method to reduce disk energy consumption by delaying the dispatch of disk requests to the end of a time window,which we call time window-based lazy scheduling.We prove that sorting requests within a single time window can reduce the disk energy consumption,and we discuss the relationship between the size of the time window and the disk energy consumption,proving that the energy consumption is highly likely to decrease with increasing window size.To exploit this opportunity,we propose the Lazy Scheduling based Disk Energy Optimization(LSDEO) algorithm,which adopts a feedback method to periodically adjust the size of the time window,and minimizes the local disk energy consumption by sorting disk requests within each time window.We implement the LSDEO algorithm in an OS kernel and conduct both simulations and actual measurements on the algorithm,confirming that increasing the time window increases disk energy savings.When the average request arrival rate is 300 and the threshold of average request response time is 50 ms,LSDEO can yield disk energy savings of 21.5%.
引用
收藏
页码:203 / 216
页数:14
相关论文
共 50 条
  • [1] Lazy Scheduling Based Disk Energy Optimization Method
    Dong, Yong
    Chen, Juan
    Tang, Yuhua
    Wu, Junjie
    Wang, Huiquan
    Zhou, Enqiang
    TSINGHUA SCIENCE AND TECHNOLOGY, 2020, 25 (02) : 203 - 216
  • [2] Lazy scheduling for energy harvesting sensor nodes
    Moser, C.
    Brunelli, D.
    Thiele, L.
    Benini, L.
    FROM MODEL-DRIVEN DESIGN TO RESOURCE MANAGEMENT FOR DISTRIBUTED EMBEDDED SYSTEMS, 2006, 225 : 125 - +
  • [3] Collaborative optimization scheduling method of clean energy based on big data and particle swarm optimization
    Liu Y.
    Liu J.-C.
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2023, 53 (05): : 1443 - 1448
  • [4] Optimization of online disk scheduling algorithms
    Computer Science Department, New Jersey Institute of Technology, Newark, NJ 07102, United States
    Perform Eval Rev, 2006, 4 (42-46):
  • [5] Hierarchical Optimization Method for Energy Scheduling of Multiple Microgrids
    Rui, Tao
    Li, Guoli
    Wang, Qunjing
    Hu, Cungang
    Shen, Weixiang
    Xu, Bin
    APPLIED SCIENCES-BASEL, 2019, 9 (04):
  • [6] Hardware design of a new genetic based disk scheduling method
    Rahmani, Hossein
    Bonyadi, Mohammad Reza
    Momeni, Amir
    Moghaddam, Mohsen Ebrahimi
    Abbaspour, Maghsoud
    REAL-TIME SYSTEMS, 2011, 47 (01) : 41 - 71
  • [7] Hardware design of a new genetic based disk scheduling method
    Hossein Rahmani
    Mohammad Reza Bonyadi
    Amir Momeni
    Mohsen Ebrahimi Moghaddam
    Maghsoud Abbaspour
    Real-Time Systems, 2011, 47 : 41 - 71
  • [8] Probabilistic Power and Energy Balance Risk Scheduling Method Based on Distributed Robust Optimization
    Shi, Jing
    Qin, Jianru
    Li, Haibo
    Li, Zesen
    Ge, Yi
    Liu, Boliang
    ENERGIES, 2024, 17 (19)
  • [9] An energy-optimization-based method of task scheduling for a cloud video surveillance center
    Xiong, Yonghua
    Wan, Shaoyun
    She, Jinhua
    Wu, Min
    He, Yong
    Jiang, Keyuan
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 59 : 63 - 73
  • [10] An optimization scheduling method of electric vehicle virtual energy storage to track planned output based on multiobjective optimization
    Han, Xiaojuan
    Liang, Dengxiang
    Wang, Hui
    INTERNATIONAL JOURNAL OF ENERGY RESEARCH, 2020, 44 (11) : 8492 - 8512