2026-09-19T10:46:56Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1389812022-01-15T03:27:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Leiserson, Charles E.
Qi, Qi
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-01-14T14:42:32Z
2022-01-14T14:42:32Z
2021-06
2021-06-17T20:14:05.909Z
https://hdl.handle.net/1721.1/138981
In this thesis, I present and analyze the novel stack-augmented split-tree data structure to support splitter hyperobjects for task-parallel systems. Splitters can mitigate races on shared, nonlocal state, where parallel nested tasks make independent local modifications without affecting shared history. The data structure is inspired by โpersistentโ trees, but refined to achieve optimal performance in the common case. I prove that in a program with ๐ splitter variables using the mechanism based on the stack-augmented split-tree data structure, read and write accesses to a splitter variable cost ฮ(1) except for the first access after a task migration, which costs ๐(log ๐ + log ๐ท) where ๐ท is the maximum depth of task nesting. This splitter data structure will enable the parallelization of search algorithms for computationally expensive applications, such as SAT solvers, theorem provers, and game-playing programs. This thesis also contains theory and implementation work on other topics related to task-parallel programming and work stealing schedulers. Some parts of this thesis represent joint work with William Kuszmaul.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
An Efficient Data Structure for Implementing Splitter Hyperobjects in Task-Parallel Systems
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="98471c85-5acf-4e8a-9527-7968bcc74bd5">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>An Efficient Data Structure for Implementing Splitter Hyperobjects in Task-Parallel Systems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2021-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Qi, Qi</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>In this thesis, I present and analyze the novel stack-augmented split-tree data structure to support splitter hyperobjects for task-parallel systems. Splitters can mitigate races on shared, nonlocal state, where parallel nested tasks make independent local modifications without affecting shared history. The data structure is inspired by โpersistentโ trees, but refined to achieve optimal performance in the common case. I prove that in a program with ๐ splitter variables using the mechanism based on the stack-augmented split-tree data structure, read and write accesses to a splitter variable cost ฮ(1) except for the first access after a task migration, which costs ๐(log ๐ + log ๐ท) where ๐ท is the maximum depth of task nesting. This splitter data structure will enable the parallelization of search algorithms for computationally expensive applications, such as SAT solvers, theorem provers, and game-playing programs. This thesis also contains theory and implementation work on other topics related to task-parallel programming and work stealing schedulers. Some parts of this thesis represent joint work with William Kuszmaul.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>