.png){kind=icon}
返回
Optimizing server placement for parallel I/O in switch-based clusters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2008.10.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider how to optimize I/O server placement in order to improve parallel I/O performance in switch-based clusters. The significant advances in cluster networks in recent years have made it practical to connect tens of thousands of hosts via networks that have enormous and scalable total capacity, and in which communications between a host and any other host incur the same cost. The same cost property frees users from consideration of network contention and allows them to concentrate on load-balancing issues. We formulate the server placement problem on a cluster that has the same cost property as a weighted bipartite matching with the goal of balancing the workload on the I/O nodes. To find an optimal solution to this problem, we propose an O(n(3/2) m(log n + log m)) algorithm, called Load Balance Matching (LBM), where n is the number of compute nodes and m is the number of I/O servers. We also investigate server placement for general clusters in which multiple same-cost subclusters are interconnected to form a large cluster. This class of clusters typically adopt irregular topologies that allow the construction of scalable systems with an incremental expansion capability. Also, due to the limited bandwidth on network links between subclusters, network link contention is a major concern when distributing servers over the entire network. We show that finding an optimal placement strategy for general clusters with the goal of minimizing link contention is computationally intractable. To resolve this problem, we propose a hierarchical strategy that places servers in two steps. First, to minimize link contention, we decide which subcluster each server should be assigned to. We propose a tree-based heuristic algorithm, called Load Balance Traversing (LBT), to solve this problem. In the second step, the LBM algorithm decides the location of each server within a subcluster. Our simulation results demonstrate that LBT achieves a significant improvement in parallel I/O performance over four other algorithms, and is near-optimal in some cases. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Cluster computing
Parallel I/O
I/O server placement
Load balancing
Switch-based cluster
Irregular network
Load-balancing matching algorithm
Load-balancing tree-traversing algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
分享收藏
Structural dynamics of E6AP E3 ligase HECT domain and involvement of flexible hinge loop in ubiquitin chain synthesis mechanismE6AP E3泛素连接酶HECT结构域的结构动力学及柔性铰链环在泛素链合成机制中的参与.png)
OAAI
IF0
OAAI分享收藏Lateral Manipulation of Single Defect on Insulating Surface Using Noncontact Atomic Force Microscope
PREAI
分享收藏Allogeneic HCT with Reduced Intensity Conditioning Versus Autologous HCT for >55 Years Old Patients with Acute Lymphoblastic Leukemia in First Complete Remission: An Analysis from Acute Leukemia Working Party of the EBMTBlood
BloodIF0
PREAI
分享收藏
查看更多内容