首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system
【24h】

Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system

机译:多计算机系统中随机fork-join作业的性能分析和调度

获取原文
获取原文并翻译 | 示例
           

摘要

The authors model a parallel processing system comprising several homogeneous computers interconnected by a communication network. Jobs arriving to this system have a linear fork-join structure. Each fork of the job gives rise to a random number of tasks that can be processed independently on any of the computers. Since exact analysis of fork-join models is known to be intractable, the authors resort to obtaining analytical bounds to the mean job response time of the fork-join job. For jobs with a single fork-join and, probabilistic allocation of tasks of the job to the N processors, they obtain upper and lower bounds to the mean job response time. Upper bounds are obtained using the concept of associated random variables and are found to be a good approximation to the mean job response time. A simple lower bound is obtained by neglecting queueing delays. They also find two lower bounds that include queueing delays. For multiple fork-join jobs, they study an approximation based on associated random variables. Finally, two versions of the join-the-shortest-queue (JSQ) allocation policy (i.e., JSQ by batch and JSQ by task) are studied and compared, via simulations and diffusion limits.
机译:作者建立了一个并行处理系统的模型,该系统包括通过通信网络互连的几台同类计算机。到达该系统的作业具有线性叉形连接结构。作业的每个分支都会产生随机数量的任务,这些任务可以在任何计算机上独立处理。由于对分叉模型的精确分析众所周知是很棘手的,因此作者求助于获得分叉模型的平均工作响应时间的分析界限。对于具有单个fork-join的作业,以及将作业的任务概率分配给N个处理器的作业,它们获得了平均作业响应时间的上限和下限。上限是使用相关随机变量的概念获得的,并且可以很好地近似于平均作业响应时间。通过忽略排队延迟可以获得简单的下限。他们还发现了两个下限,包括排队延迟。对于多个fork-join作业,他们研究基于相关随机变量的近似值。最后,通过仿真和扩散限制,研究和比较了两种最短联接队列分配策略(即,批处理JSQ和任务分配JSQ)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号