The swept rule for breaking the latency barrier in time-advancing PDEs
Name
1129585911-MIT.pdf
Size
13.46 MB
Format
Adobe PDF
Checksum (MD5)
858d132cac64f1d64e514d4f7f840d62
Author(s)
Alhubail, Maitham Makki(Maitham Makki Hussain)
Advisor(s)
John R. Willaims and Qiqi Wang.
Date Issued
2019
Publisher
Massachusetts Institute of Technology
Abstract
This thesis describes a method to accelerate parallel, explicit time integration of unsteady PDEs. The method is motivated by our observation that network latency, not bandwidth or computing power, often limits how fast PDEs can be solved in parallel. The method is called the swept rule of space-time domain decomposition. Compared to conventional, space-only domain decomposition, it communicates similar amount of data, but in fewer messages. The swept rule achieves this by decomposing space and time among computing nodes in ways that exploit the domains of influence and the domain of dependency, making it possible to communicate once per many time steps with no redundant computation. By communicating less often, the swept rule effectively breaks the latency barrier, advancing on average more than one time step per round-trip latency of the network. The thesis describes the algorithms, presents simple theoretical analysis to the performance of the swept rule, and supports the analysis with numerical experiments.
Description
Thesis: Ph. D. in Computational Science and Engineering, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 103-104).
Subjects
Civil and Environmental Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
