2026-09-18T18:55:38Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1501762023-04-01T03:17:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Schardl, Tao B.
Trollback, August
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-03-31T14:37:42Z
2023-03-31T14:37:42Z
2023-02
2023-02-27T18:43:10.025Z
https://hdl.handle.net/1721.1/150176
Work stealing schedulers are widely used by parallel programming platforms to distribute tasks across multiple processors. Memory blowup from scheduling a program with work stealing can be bounded by using continuation stealing when new tasks are spawned. Continuation stealing is opposed to child stealing, a different method for spawning tasks that is simpler to implement, but comes at the expense of potentially unbounded memory use. An extension to the Julia programming langauge that adds support for optimizable spawn and sync parallel constructs has been proposed, but it does not currently support continuation stealing. In my thesis, I implement continuation stealing in Julia using two different metaprogramming approaches. One approach uses Julia’s macro system, while the other uses the Julia compiler’s internal representation (IR) of functions. My results show that the IR-based approach uses less memory than the child stealing implementation in the proposed extension to Julia, while having similar speed.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Continuation Stealing in Julia
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b9ba8b22-1c4b-4835-9cb0-8ec41749f5ba">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Continuation Stealing in Julia</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2023-02</PublicationDate>
<Authors>
<Author>
<DisplayName>Trollback, August</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Work stealing schedulers are widely used by parallel programming platforms to distribute tasks across multiple processors. Memory blowup from scheduling a program with work stealing can be bounded by using continuation stealing when new tasks are spawned. Continuation stealing is opposed to child stealing, a different method for spawning tasks that is simpler to implement, but comes at the expense of potentially unbounded memory use. An extension to the Julia programming langauge that adds support for optimizable spawn and sync parallel constructs has been proposed, but it does not currently support continuation stealing. In my thesis, I implement continuation stealing in Julia using two different metaprogramming approaches. One approach uses Julia’s macro system, while the other uses the Julia compiler’s internal representation (IR) of functions. My results show that the IR-based approach uses less memory than the child stealing implementation in the proposed extension to Julia, while having similar speed.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>