| dc.contributor |
Leiserson, Charles |
|
| dc.contributor |
Schardl, Tao B. |
|
| dc.contributor |
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
|
| dc.creator |
Kralj, Tim |
|
| dc.date |
2022-01-14T15:18:43Z |
|
| dc.date |
2022-01-14T15:18:43Z |
|
| dc.date |
2021-06 |
|
| dc.date |
2021-06-17T20:13:33.281Z |
|
| dc.date.accessioned |
2022-05-04T06:26:44Z |
|
| dc.date.available |
2022-05-04T06:26:44Z |
|
| dc.identifier |
https://hdl.handle.net/1721.1/139542 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/2954 |
|
| dc.description |
Julia [5] [15] is a high-level computing language used by many developers for its performance and ease of use. Julia operates on tasks that are run concurrently on threads. In its current state, however, Julia is not able to effectively employ fine-grained parallelism. OpenCilk [9] is an open-source implementation of the Cilk concurrency platform designed to utilize fine-grain parallelism. The Cilk runtime system, based on Cheetah [12], offers provably efficient parallel scheduling whose performance is borne out in theory and practice. I propose a combination of the Julia and OpenCilk runtimes through the integration of multiple components. One contribution of this thesis is a novel algorithm for combining C/C++ memory allocations with Julia’s precise garbage collector. Composing the parallelism of OpenCilk and Julia enables programmers to write efficient multithreaded code. Additionally, this work is a case study of combining the high levels of parallelism present in Cilk with a high-level language. |
|
| dc.description |
M.Eng. |
|
| dc.format |
application/pdf |
|
| dc.publisher |
Massachusetts Institute of Technology |
|
| dc.rights |
In Copyright - Educational Use Permitted |
|
| dc.rights |
Copyright MIT |
|
| dc.rights |
http://rightsstatements.org/page/InC-EDU/1.0/ |
|
| dc.title |
Composing Parallel Runtime Systems: A Case Study in How to Compose the Julia and OpenCilk Runtimes |
|
| dc.type |
Thesis |
|