2026-09-27T14:42:52Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1059952026-06-06T01:03:05Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Saman Amarasinghe.
Kanwar, Gurtej
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-12-22T15:17:53Z
2016-12-22T15:17:53Z
2016
2016
http://hdl.handle.net/1721.1/105995
965798235
Thesis: M. Eng. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 155-160).
This thesis presents language extensions to Simit, a language for linear algebra on graphs. Currently, Simit doesn't efficiently handle lattice graphs (regular grids). This thesis defines a stencil assembly construct to capture linear algebra on these graphs. A prototype compiler with a Halide backend demonstrates that these extensions capture the full structure of linear algebra applications operating on lattices, are easily schedulable, and achieve comparable performance to existing methods. Many physical simulations take the form of linear algebra on lattices. This thesis reviews Lattice QCD as a representative example of such a class of applications and identifies the structure of the linear algebra involved. In this application, iterative inversion of the Dirac matrix dominates the runtime, and time-intensive hand-optimization of inverters for specific forms of the matrix limit further research. This thesis implements this computation using the language extensions, while demonstrating competitive performance to existing methods.
by Gurtej Kanwar.
M.Eng. in Computer Science and Engineering
160 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Linear algebra on lattices : Simit language extensions with applications to lattice QCD
Simit language extensions with applications to lattice QCD
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="31849f0a-e87f-426e-9a7e-d4e884d91be5">
<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>Linear algebra on lattices : Simit language extensions with applications to lattice QCD</Title>
<Subtitle>Simit language extensions with applications to lattice QCD</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Kanwar, Gurtej</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>Electrical Engineering and Computer Science.</Keyword>
<Abstract>This thesis presents language extensions to Simit, a language for linear algebra on graphs. Currently, Simit doesn't efficiently handle lattice graphs (regular grids). This thesis defines a stencil assembly construct to capture linear algebra on these graphs. A prototype compiler with a Halide backend demonstrates that these extensions capture the full structure of linear algebra applications operating on lattices, are easily schedulable, and achieve comparable performance to existing methods. Many physical simulations take the form of linear algebra on lattices. This thesis reviews Lattice QCD as a representative example of such a class of applications and identifies the structure of the linear algebra involved. In this application, iterative inversion of the Dirac matrix dominates the runtime, and time-intensive hand-optimization of inverters for specific forms of the matrix limit further research. This thesis implements this computation using the language extensions, while demonstrating competitive performance to existing methods.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>