检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北工业大学计算机学院,陕西西安710072
出 处:《西北工业大学学报》2008年第5期566-569,共4页Journal of Northwestern Polytechnical University
摘 要:机群管理系统中节点的I/O负载过重以及系统的可扩展性是制约其效率的关键。通过使用作业对象的互复制以及基于快照的并发调度,可降低读/写操作的等待,同时也使各种操作在机群节点交替执行,提高了并行性。文中首先描述了作业对象的快照模型;给出了作业数据访问协议并实现了作业对象可扩展复制算法;最后对该算法进行了评价和分析。Aim. We propose a new data replication method based on a snapshot model in order to achieve the more efficient utilization of I/O resources. Section 1 in the full paper discusses job objects in cluster management system. Section 2 presents the replication protocol of job objects. Its two subsections are: the snapshot of job objects (subsection 2.1) and the protocol of job object operations (subsection 2.2). In section 2, we reduce the waiting time for reading and writing through the concurrent scheduling based on snapshot. Section 3 explains the concurrent scheduling algorithm. In this section, we implement the scheduling algorithm to have concurrent access to job objects. The scheduling algorithm uses scheduler to check conflicts and only allows valid operations to be stored, thus ensuring the data consistency. In section 4, we did experiments on connecting 100 clients to the cluster server to track the three operations of job creation, job execution and job status inquiry. The experimental results, shown in Figs. 3 and 4, indicate preliminarily that the number of nodes of a replication cluster increases with increasing number of inquiries completed within a unit of time, thus consuming less response time and raising the efficiency by around 30%.
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.176.130