A PARTITIONING ALGORITHM FOR COMPOSITE GRIDS*
作者:
MICHAEL THUNÉ,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1993)
卷期:
Volume 1,
issue 1
页码: 69-81
ISSN:1063-7192
年代: 1993
DOI:10.1080/10637199308915432
出版商: Taylor & Francis Group
关键词: Partitioning;data parallelism;MIMD computers;distributed memory;explicit difference methods;composite grids
数据来源: Taylor
摘要:
A partitioning algorithm is presented, which applies to composite grids for explicit difference methods. Results from four case studies are promising. In fact, close to optimal partitionings were generated by the algorithm. The new algorithm is intended for use in a set of software tools for parallelization of explicit difference methods on MIMD (multiple instruction, multiple data) computers with distributed memory.
点击下载:
PDF (188KB)
返 回