首页> 美国政府科技报告 >Speedup Bounds and Processor Allocation for Parallel Programs on Multiprocessors
【24h】

Speedup Bounds and Processor Allocation for Parallel Programs on Multiprocessors

机译:多处理器上并行程序的加速边界和处理器分配

获取原文

摘要

The main aim of this paper is to study allocation of processors to parallel programs executing on a multiprocessor system, and the resulting speedups. We first consider a general program represented as a sequence of steps consisting of parallel operations, then one represented as a task graph whose nodes are do across loops and whose edges represent precedence constraints, and finally a single do across loop. General bounds on program speedup are discussed and measurements of code parallelism for the LINPACK numerical package are presented. 11 refs., 4 figs. (ERA citation 12:008797)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号