期刊文献+

基于LT-backfilling算法的集群作业调度系统 被引量:4

Cluster Job-scheduling System Based on LT-backfilling Algorithm
下载PDF
导出
摘要 在胖节点集群系统中,目前的reservations,backfilling等主流调度算法未能充分考虑单节点过载情况。该文在传统backfilling算法基础上,充分考虑节点当前负载,将预约、回填策略相结合,提出了一种新的LT-backfilling调度算法。设计了基于XML业务流程模板的二层作业调度系统,用户不仅可以提交单个作业,而且可以提交一组具有数据相关性的作业流,使得作业调度系统更加实用化。 In a SMP cluster job-scheduling system, most of the well-rounded algorithms such as reservation, backfilling, don't pay much attention to the overload of system. This paper presents a LT-backfilling algorithm combined with reservation and backfilling. This algorithm focuses on the balance of system's load and improves the efficiency of balance of system's load. Based on the algorithm, this paper proposes a job-scheduling system based on XML flow telmplate, in this system, user not only can submit single job, but also can submit a data-relative job flow, the function makes this job-scheduling system more practical.
出处 《计算机工程》 CAS CSCD 北大核心 2007年第21期69-71,共3页 Computer Engineering
关键词 LT-backfilling 负载均衡 作业调度 XML 作业流 LT-backfilling balance of load job-scheduling XML job-flow
  • 相关文献

参考文献7

  • 1Ruhl K M.Simple Efficient Load Balancing Algorithms for Peer to Peer Systems[C]//Proc.of ACM Symposium on Parallelism in Algorithms and Architectures.2004.
  • 2梁毅,孟丹,樊建平.RB-FIFT——一种结合Firstfit及预约回填策略的机群作业调度算法[J].计算机研究与发展,2004,41(11):1902-1910. 被引量:9
  • 3Aaron D B,Lam S J.Essential XML[M].[S.1.]:Addison Wesley Longman,Inc.,2003.
  • 4Parrish R.Make the Most of Xerces-C++,Part 2,A DOM Implementation[Z].[2006-10].http://www-900.ibm.com/developer Wo rks/cn/xml/x-xerces/index_eng.shtml.
  • 5Feitelson D G,Weil A M.Utilization and Predictability in Scheduling the IBM SP2 with Backfilling[C]//Proceedings of the 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing.Los Alamitos,CA:IEEEE Computer Society Press.1998:542-546.
  • 6Feiteison D G.Metric and Workload Effects on Computer Systems[J].Evaluation Computer,2003,36(9):18-25.
  • 7Stüezle T,Dorigo M.A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms[J].IEEE Transactions on Evolutionary Computation,2002,6 (4):358-365.

二级参考文献7

  • 1Olf Arndt, Bernd Freisleben, Thilo Kielmann, et al. A comparative study of online scheduling algorithms for networks of workstations. Clnster Computing, 2000, 3(2): 95~112
  • 2B S Yoo, C R Das. Good processor management=fast allocation + efficient scheduling. 1997 Int'l Conf on Parallel Processing, Bloomingdale, 1997
  • 3D G Feitelson, B Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. IPPS'95 Workshop on Job Scheduling Strategies for Parallel Processing, California, 1995
  • 4J Subhlok, T Gross, T Suzuoka. Impact of job mix on optimizations for space sharing schedulers. Supercomputing'96, San Diego, 1996
  • 5R H Arpaci, A C Dusseau, A M Vahdat, et al. The interaction of parallel and sequential workloads on a network of workstations. 1995 ACM SIGMETRICS Conf on Measurement and Modeling of Computer Systems, Ottawa, 1995
  • 6David Talby, Dror G Feitelson. Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling. The 10th Symp on Parallel and Distributed Processing, Puerto Rico, 1997
  • 7D G Feitelson, A M Weil. Utilization and predictability in scheduling the IBM SP2 with backfilling. In: Proc of the 12th Int'l Parallel Processing Symp and the 9th Symp on Parallel and Distributed Processing. Los Alamitos, CA: IEEE Computer Society Press, 1998. 542~546

共引文献8

同被引文献21

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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