引用本文:曾国荪,陆鑫达.异构计算中的负载共享.软件学报,2000,11(4):551-556
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4218次   下载 5400 本文二维码信息
码上扫一扫!
分享到: 微信 更多
异构计算中的负载共享
曾国荪1,2, 陆鑫达1,2
1.上海交通大学计算机科学与工程系,上海,200030;2.江西师范大学计算机科学系,南昌,330027
摘要:
在基于消息传递的异构并行计算系统中 ,各处理器或计算机具有自制和独立地调度、执行作业的能力 .当一个可划分的作业初始位于一个处理器上时 ,为了提高计算性能 ,该处理器可以请求其他异构处理器负载共享 ,参与协同计算 ,减少作业的完成时间 .该文提出了异构计算负载共享的一种方案 .首先 ,调用负载共享协议 ,收集当前各处理器参与负载共享的许可数据 ,包括共享时间段、计算能力等 .然后 ,构造一个作业量与作业完成时间之间的关系函数 .该函数是选择一组合适的处理器群、优化作业划分、作业完成时间最小的理论基础 .最
关键词:  负载共享  异构计算  作业划分  调度  加速比
DOI:
分类号:
基金项目:本文研究得到国家自然科学基金(No.69773014)资助.
Load Sharing in Heterogeneous Computing
ZENG Guo sun,LU Xin da
Abstract:
In heterogeneous parallel computing systems based on message passing, every processor or computer has capability of scheduling and executing jobs autonomously and independently. For high performance computing, a processor, which originally has a divisible job, can call other heterogeneous processors for co computing with load sharing so that job completing time can be decreased. In this paper, a scheme for load sharing in heterogeneous computing is presented. Firstly, invoking load sharing protocol,the originating processor collects available data such as load sharing interval time and computing power from its partners.Secondly,a function is constructed which represents the relationshop between the total job magnitude and the job completion time.The function is essential for choosing a suite of appropriate processors,optimally partitionng and scheduling jobs,as well as minimizing the job completing time.Finally,an efficient algorithm is proposed through the examples in application and experiments.The algorithm is real-time at the moment when the job is just started,and can be extended to the situation of multiple jobs originated at multiple processors.
Key words:  Load sharing  heterogeneous computing  job partitioning  scheduling  speedup