The Portable Parallel Implementation of Two Novel Mathematical Biology Algorithms in ZPL (1995)
| Venue: | In Ninth International Conference on Supercomputing |
| Citations: | 10 - 6 self |
BibTeX
@INPROCEEDINGS{Dikaiakos95theportable,
author = {Marios Dikaiakos and Calvin Lin and Daphne Manoussaki and Diana E. Woodward},
title = {The Portable Parallel Implementation of Two Novel Mathematical Biology Algorithms in ZPL},
booktitle = {In Ninth International Conference on Supercomputing},
year = {1995},
pages = {365--374}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper shows that mathematical models of biological pattern formation are ideally suited to data parallelism. We present two new algorithms, one for simulating the dynamic structure of fibroblasts, and the other for studying the self-organization of motile bacteria. We describe implementations of these algorithms using a high level data parallel language called ZPL, and we give performance results for the Kendall Square Research KSR-2 and the Intel Paragon that include comparisons against sequential Fortran. 1 Introduction Mathematical biology is one of the fastest growing and most exciting applications of modern mathematics. As biology becomes more quantitative, the increased use of mathematical modeling is inevitable. Many of these problems involve extensive numerical computations over large computational domains and are easily amenable to data-parallelism. For example, in the field of pattern formation in biological systems, the equations that one derives are generally continuu...
