2026-09-19T13:48:37Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1232222026-06-16T18:15:34Zcom_1721.1_33226com_1721.1_7582com_1721.1_7581col_1721.1_145728col_1721.1_131022

John R. Willaims and Qiqi Wang. Alhubail, Maitham Makki(Maitham Makki Hussain) Massachusetts Institute of Technology. Department of Civil and Environmental Engineering. Massachusetts Institute of Technology. Department of Civil and Environmental Engineering 2019-12-13T18:52:52Z 2019-12-13T18:52:52Z 2019 2019 https://hdl.handle.net/1721.1/123222 1129585911 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). 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. by Maitham Makki Alhubail. Ph.D. in Computational Science and Engineering Ph.D.inComputationalScienceandEngineering Massachusetts Institute of Technology, Department of Civil and Environmental Engineering 104 pages eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Civil and Environmental Engineering. The swept rule for breaking the latency barrier in time-advancing PDEs Thesis application/pdf 2019-12-13T18:52:52Z Publication Doctoral CivEng unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="83616192-c154-4951-8837-d1702429b1ed"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>The swept rule for breaking the latency barrier in time-advancing PDEs</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019</PublicationDate> <Authors> <Author> <DisplayName>Alhubail, Maitham Makki(Maitham Makki Hussain)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Civil and Environmental Engineering.</Keyword> <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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>