首页    期刊浏览 2024年11月29日 星期五
登录注册

文章基本信息

  • 标题:A Computational Study of Distributed Processing Environments with Parallel Multiperiod Assignment Method: A Dedicated Machine versus a Workstation Cluster
  • 本地全文:下载
  • 作者:Gupta, Babita ; Aronson, Jay E.
  • 期刊名称:Journal of Computing and Information Technology
  • 印刷版ISSN:1330-1136
  • 电子版ISSN:1846-3908
  • 出版年度:1997
  • 卷号:5
  • 期号:2
  • 页码:103-113
  • 语种:English
  • 出版社:SRCE - Sveučilišni računski centar
  • 摘要:We provide a computational study of two of the more commonly distributed processing environments using a robust parallel multiperiod assignment branch and bound im£1ementation running in the Parallel Virtual Machine (PYM) environment. We describe the multiperiod assignment problem (an np-hard, combinatorial, network-based integer programming problem), an efficient parallel algorithm for its sol ution, and implementation details. The algorithm is designed for a large-grain computing environment and uses a Master /Slave (or monitor) configuratio n. Minimal communication among the processes is used. We then describe the PYM software system and the computational platforms being analyzed. We provide a computational comparison of runs on an IBM SP-2 and a cluster of IBM RISC 6000 POWERStations. The results indicate that losses in efficiency occur when employing parallelism in a cluster, but some gains in efficiency can be obtained by a single processor with multiple processes running in a time-shared mode. However, in general, the cluster provides poor parallel performance when compared to the dedicated IBM SP-2 for which linear and superlinear speedups can be routinely obtained. Tbe results may be generalized to any branch and bound method that utilizes a similar tree search strategy.
  • 关键词:Network Programming; Parallel Algorithms; Assignment Problem; Distributed Computing
国家哲学社会科学文献中心版权所有