期刊文献+

用于云存储数据服务器的I/O请求调度算法 被引量:3

I/O Scheduling Algorithm for Data Servers in Cloud Storage Environments
下载PDF
导出
摘要 在云存储系统的体系架构中,当前对数据服务器守护进程的I/O请求调度采用先来先服务(first in first out)策略,这种调度策略没有考虑不同类型I/O请求的时效性要求,容易造成时效性要求高的I/O请求因被阻塞而无法得到及时处理,从而降低整个系统的服务质量.为解决该问题,本文提出一种用于云存储数据服务器的I/O请求调度算法.该算法首先对来自客户端的I/O请求进行分类,并赋予不同的优先级;然后以合适的时长作为周期、以分时间片的方式对不同优先级的I/O请求进行周期性的调度.分布式文件系统仿真实验结果表明,该算法在重负载情况下对实时请求的响应速度提高了20%,同时也兼顾了低优先级请求的响应性能. Distributed file systems(DFSs)are generally employed for storing user data while designing a cloud storage system.The primary aspects of DFSs include efficient storage and management of metadata,data distribution strategies,and reliability of user data.In the case of data servers of a DFS,the FIFO(first in first out)strategy is adopted for scheduling I/O requests which are received by a data server daemon.The FIFO algorithm prioritises all such requests equally;requests that require better quality of services may therefore be blocked for long durations.To address this issue,a new priority based periodic scheduling algorithm(PPSA)has been proposed.Initially,PPSA classifies requests into different priority queues.Then,it periodically schedules requests according to their respective priorities and dedicated time slices.The obtained DFS simulation results show that PPSA can increase the response performance of heavy-load real-time requests by 20%,and can also ascertain the lowest response time performance for other requests.
作者 李宇 LI Yu(School of Software Engineening,Beijing Jiaotong University,Beijing 100044,China)
出处 《西南交通大学学报》 EI CSCD 北大核心 2018年第4期857-864,共8页 Journal of Southwest Jiaotong University
关键词 大数据 云计算 分布式文件系统 周期性 优先级 调度算法 big data cloud computing distributed file system periodic priority scheduling algorithms
  • 相关文献

参考文献2

二级参考文献15

  • 1Gulati A, Merchant A, Varman P. pClock: An arrival curve based approach for QoS in shared storage systems [C]/ /Proc of ACM SIGMETRICS 2007. New York: ACM, 2007: 13- 24.
  • 2Gulati A, Merchant A, Varman P. mClock: Handling throughput variability for hyper visor I/O scheduling [C]// Proc of USENIX OSDI 2010. Berkeley, CA: USENIX Association, 2010: 437-450.
  • 3Hui W, Varman P. Nested QoS: Providing flexible performance in shared I/O environment [C]/ /Proc of USENIX WIOV 2011. Berkeleyv CA, USENIX Association, 2011: 1-6.
  • 4Zhang], Anand S, Wang Q. et al. Storage performance virtualization via throughput and latency control [J]. ACM Trans on Storage, 2006, 2(3): 283-308.
  • 5Zhang Q, Zhu Q, Raouf B. Dynamic resource allocation for spot markets in cloud computing environments [C]//Proc of IEEE/ACM Int Conf on Utility and Cloud Computing 2011. Los Alamitos, CA: IEEE Computer Society, 2011: 178-185.
  • 6Zhang Q, Eren G, Raouf B. et al. Dynamic resource allocation for spot markets in clouds [C]//Proc of USE NIX HotICE 2011. Berkeley. CA: USENIX Association, 2011: 1-6.
  • 7Amazon Web Services Inc. Amazon Elastic Compute Cloud (Amazon EC2) [OL]. [2011-11-11]. http://aws. amazon. com/ec2/.
  • 8Ganger G. et al. The DiskSim simulation environment (version 4. 0) [OL]. [2011-11-11]. http://www. pdl. emu. edu/DiskSim/.
  • 9Storage Performance Council (Umass Trace Repository) [OL]. [2011-11-11].http://traces. cs, urnass. edu/index. php/Storage/.
  • 10Gulati A. Ganesha S, Irfan A, et al. Pesto , Online storage performance management in virtualized datacenters [C]// Proc of ACM SOCC 2011. New York: ACM, 2011: 1-14.

共引文献10

同被引文献31

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部