首页> 外文会议>IEEE International Conference on Cluster Computing >Gather-Arrange-Scatter: Node-Level Request Reordering for Parallel File Systems on Multi-Core Clusters
【24h】

Gather-Arrange-Scatter: Node-Level Request Reordering for Parallel File Systems on Multi-Core Clusters

机译:收集 - 排列 - 分散:Node-Level请求重新排序多核集群上的并行文件系统

获取原文

摘要

Multiple processors or multi-core CPUs are now in common, and the number of processes running concurrently is increasing in a cluster. Each process issues contiguous I/O requests individually, but they can be interrupted by the requests of other processes if all the processes enter the I/O phase together. Then, I/O nodes handle these requests as non-contiguous. This increases the disk seek time, and causes performance degradation. To overcome this problem, a node-level request reordering architecture, called Gather-Arrange-Scatter (GAS) architecture, is proposed. In GAS, the I/O requests in the same node are gathered and buffered locally. Then, those are arranged and combined to reduce the I/O cost at I/O nodes, and finally they are scattered to the remote I/O nodes in parallel. A prototype is implemented and evaluated using the BTIO benchmark. This system reduces up to 84.3% of the 1seek() calls and reduces up to 93.6% of the number of requests at I/O nodes. This results in up to a 12.7% performance improvement compared to the non-arranged case.
机译:多个处理器或多核CPU现在共同,并且在群集中同时运行的进程数量正在增加。每个进程单独发出连续的I / O请求,但如果所有进程在一起输入I / O相,则可以通过其他进程的请求中断。然后,I / O节点将这些请求处理为非连续。这会增加磁盘搜索时间,并导致性能下降。为了克服这个问题,提出了一种节点级别请求重新排序架构,称为收集 - 排列 - 散射(气体)架构。在气体中,同一节点中的I / O请求在本地收集和缓冲。然后,布置并组合那些以降低I / O节点的I / O成本,最后它们并行地分散到远程I / O节点。使用BTIO基准实现和评估原型。该系统可缩短1Seek()呼叫的84.3%,可在I / O节点上减少高达93.6%的请求次数。与未安排的案例相比,这导致高达12.7%的性能改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号