PARTITIONING STRATEGIES FOR COMPOSITE GRIDS*
作者:
MICHAEL THUNÉ,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1997)
卷期:
Volume 11,
issue 3-4
页码: 325-348
ISSN:1063-7192
年代: 1997
DOI:10.1080/10637199708915601
出版商: Taylor & Francis Group
关键词: partition;data distribution;composite grid;multi-block;finite difference;parallel computing
数据来源: Taylor
摘要:
Two different strategies are discussed, for the partitioning of composite grids, in the context of parallel computers of MIMD type with distributed memory. The two strategies are compared theoretically, with respect to arithmetic load balance and communication overhead. Moreover, the ability to handle dynamically changing grids is considered.
点击下载:
PDF (345KB)
返 回