Commit | Line | Data |
---|---|---|
7f918cf1 CE |
1 | <!DOCTYPE html>\r |
2 | <html lang="en">\r | |
3 | <head>\r | |
4 | <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">\r | |
5 | <meta name="generator" content="AsciiDoc 8.6.9">\r | |
6 | <title>Google Summer of Code (2014)</title>\r | |
7 | <link rel="stylesheet" href="./asciidoc.css" type="text/css">\r | |
8 | <link rel="stylesheet" href="./pygments.css" type="text/css">\r | |
9 | \r | |
10 | \r | |
11 | <script type="text/javascript" src="./asciidoc.js"></script>\r | |
12 | <script type="text/javascript">\r | |
13 | /*<![CDATA[*/\r | |
14 | asciidoc.install(2);\r | |
15 | /*]]>*/\r | |
16 | </script>\r | |
17 | <link rel="stylesheet" href="./mlton.css" type="text/css">\r | |
18 | </head>\r | |
19 | <body class="article">\r | |
20 | <div id="banner">\r | |
21 | <div id="banner-home">\r | |
22 | <a href="./Home">MLton 20180207</a>\r | |
23 | </div>\r | |
24 | </div>\r | |
25 | <div id="header">\r | |
26 | <h1>Google Summer of Code (2014)</h1>\r | |
27 | <div id="toc"> | |
28 | <div id="toctitle">Table of Contents</div> | |
29 | <noscript><p><b>JavaScript must be enabled in your browser to display the table of contents.</b></p></noscript> | |
30 | </div>\r | |
31 | </div>\r | |
32 | <div id="content">\r | |
33 | <div class="sect1">\r | |
34 | <h2 id="_mentors">Mentors</h2>\r | |
35 | <div class="sectionbody">\r | |
36 | <div class="paragraph"><p>The following developers have agreed to serve as mentors for the 2014 Google Summer of Code:</p></div>\r | |
37 | <div class="ulist"><ul>\r | |
38 | <li>\r | |
39 | <p>\r | |
40 | <a href="http://www.cs.rit.edu/%7Emtf">Matthew Fluet</a>\r | |
41 | </p>\r | |
42 | </li>\r | |
43 | <li>\r | |
44 | <p>\r | |
45 | <a href="http://www.cse.buffalo.edu/%7Elziarek/">Lukasz (Luke) Ziarek</a>\r | |
46 | </p>\r | |
47 | </li>\r | |
48 | <li>\r | |
49 | <p>\r | |
50 | <a href="http://people.cs.uchicago.edu/~jhr/">John Reppy</a>\r | |
51 | </p>\r | |
52 | </li>\r | |
53 | <li>\r | |
54 | <p>\r | |
55 | <a href="http://www.cs.purdue.edu/homes/chandras">KC Sivaramakrishnan</a>\r | |
56 | </p>\r | |
57 | </li>\r | |
58 | </ul></div>\r | |
59 | </div>\r | |
60 | </div>\r | |
61 | <div class="sect1">\r | |
62 | <h2 id="_ideas_list">Ideas List</h2>\r | |
63 | <div class="sectionbody">\r | |
64 | <div class="sect2">\r | |
65 | <h3 id="_implement_a_partial_redundancy_elimination_pre_optimization">Implement a Partial Redundancy Elimination (PRE) Optimization</h3>\r | |
66 | <div class="paragraph"><p>Partial redundancy elimination (PRE) is a program transformation that\r | |
67 | removes operations that are redundant on some, but not necessarily all\r | |
68 | paths, through the program. PRE can subsume both common subexpression\r | |
69 | elimination and loop-invariant code motion, and is therefore a\r | |
70 | potentially powerful optimization. However, a naïve\r | |
71 | implementation of PRE on a program in static single assignment (SSA)\r | |
72 | form is unlikely to be effective. This project aims to adapt and\r | |
73 | implement the SSAPRE algorithm(s) of Thomas VanDrunen in MLton’s SSA\r | |
74 | intermediate language.</p></div>\r | |
75 | <div class="paragraph"><p>Background:</p></div>\r | |
76 | <div class="openblock">\r | |
77 | <div class="content">\r | |
78 | <div class="ulist"><ul>\r | |
79 | <li>\r | |
80 | <p>\r | |
81 | <a href="http://onlinelibrary.wiley.com/doi/10.1002/spe.618/abstract">Anticipation-based partial redundancy elimination for static single assignment form</a>; Thomas VanDrunen and Antony L. Hosking\r | |
82 | </p>\r | |
83 | </li>\r | |
84 | <li>\r | |
85 | <p>\r | |
86 | <a href="http://cs.wheaton.edu/%7Etvandrun/writings/thesis.pdf">Partial Redundancy Elimination for Global Value Numbering</a>; Thomas VanDrunen\r | |
87 | </p>\r | |
88 | </li>\r | |
89 | <li>\r | |
90 | <p>\r | |
91 | <a href="http://www.springerlink.com/content/w06m3cw453nphm1u/">Value-Based Partial Redundancy Elimination</a>; Thomas VanDrunen and Antony L. Hosking\r | |
92 | </p>\r | |
93 | </li>\r | |
94 | <li>\r | |
95 | <p>\r | |
96 | <a href="http://portal.acm.org/citation.cfm?doid=319301.319348">Partial redundancy elimination in SSA form</a>; Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, and Fred Chow\r | |
97 | </p>\r | |
98 | </li>\r | |
99 | </ul></div>\r | |
100 | </div></div>\r | |
101 | <div class="paragraph"><p>Recommended Skills: SML programming experience; some middle-end compiler experience</p></div>\r | |
102 | </div>\r | |
103 | <div class="sect2">\r | |
104 | <h3 id="_design_and_implement_a_heap_profiler">Design and Implement a Heap Profiler</h3>\r | |
105 | <div class="paragraph"><p>A heap profile is a description of the space usage of a program. A\r | |
106 | heap profile is concerned with the allocation, retention, and\r | |
107 | deallocation (via garbage collection) of heap data during the\r | |
108 | execution of a program. A heap profile can be used to diagnose\r | |
109 | performance problems in a functional program that arise from space\r | |
110 | leaks. This project aims to design and implement a heap profiler for\r | |
111 | MLton compiled programs.</p></div>\r | |
112 | <div class="paragraph"><p>Background:</p></div>\r | |
113 | <div class="openblock">\r | |
114 | <div class="content">\r | |
115 | <div class="ulist"><ul>\r | |
116 | <li>\r | |
117 | <p>\r | |
118 | <a href="http://portal.acm.org/citation.cfm?doid=583854.582451">GCspy: an adaptable heap visualisation framework</a>; Tony Printezis and Richard Jones\r | |
119 | </p>\r | |
120 | </li>\r | |
121 | <li>\r | |
122 | <p>\r | |
123 | <a href="http://journals.cambridge.org/action/displayAbstract?aid=1349892">New dimensions in heap profiling</a>; Colin Runciman and Niklas Röjemo\r | |
124 | </p>\r | |
125 | </li>\r | |
126 | <li>\r | |
127 | <p>\r | |
128 | <a href="http://www.springerlink.com/content/710501660722gw37/">Heap profiling for space efficiency</a>; Colin Runciman and Niklas Röjemo\r | |
129 | </p>\r | |
130 | </li>\r | |
131 | <li>\r | |
132 | <p>\r | |
133 | <a href="http://journals.cambridge.org/action/displayAbstract?aid=1323096">Heap profiling of lazy functional programs</a>; Colin Runciman and David Wakeling\r | |
134 | </p>\r | |
135 | </li>\r | |
136 | </ul></div>\r | |
137 | </div></div>\r | |
138 | <div class="paragraph"><p>Recommended Skills: C and SML programming experience; some experience with UI and visualization</p></div>\r | |
139 | </div>\r | |
140 | <div class="sect2">\r | |
141 | <h3 id="_garbage_collector_improvements">Garbage Collector Improvements</h3>\r | |
142 | <div class="paragraph"><p>The garbage collector plays a significant role in the performance of\r | |
143 | functional languages. Garbage collect too often, and program\r | |
144 | performance suffers due to the excessive time spent in the garbage\r | |
145 | collector. Garbage collect not often enough, and program performance\r | |
146 | suffers due to the excessive space used by the uncollected garbage.\r | |
147 | One particular issue is ensuring that a program utilizing a garbage\r | |
148 | collector "plays nice" with other processes on the system, by not\r | |
149 | using too much or too little physical memory. While there are some\r | |
150 | reasonable theoretical results about garbage collections with heaps of\r | |
151 | fixed size, there seems to be insufficient work that really looks\r | |
152 | carefully at the question of dynamically resizing the heap in response\r | |
153 | to the live data demands of the application and, similarly, in\r | |
154 | response to the behavior of the operating system and other processes.\r | |
155 | This project aims to investigate improvements to the memory behavior of\r | |
156 | MLton compiled programs through better tuning of the garbage\r | |
157 | collector.</p></div>\r | |
158 | <div class="paragraph"><p>Background:</p></div>\r | |
159 | <div class="openblock">\r | |
160 | <div class="content">\r | |
161 | <div class="ulist"><ul>\r | |
162 | <li>\r | |
163 | <p>\r | |
164 | <a href="http://www.dcs.gla.ac.uk/%7Ewhited/papers/automated_heap_sizing.pdf">Automated Heap Sizing in the Poly/ML Runtime (Position Paper)</a>; David White, Jeremy Singer, Jonathan Aitken, and David Matthews\r | |
165 | </p>\r | |
166 | </li>\r | |
167 | <li>\r | |
168 | <p>\r | |
169 | <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4145125">Isla Vista Heap Sizing: Using Feedback to Avoid Paging</a>; Chris Grzegorczyk, Sunil Soman, Chandra Krintz, and Rich Wolski\r | |
170 | </p>\r | |
171 | </li>\r | |
172 | <li>\r | |
173 | <p>\r | |
174 | <a href="http://portal.acm.org/citation.cfm?doid=1152649.1152652">Controlling garbage collection and heap growth to reduce the execution time of Java applications</a>; Tim Brecht, Eshrat Arjomandi, Chang Li, and Hang Pham\r | |
175 | </p>\r | |
176 | </li>\r | |
177 | <li>\r | |
178 | <p>\r | |
179 | <a href="http://portal.acm.org/citation.cfm?doid=1065010.1065028">Garbage collection without paging</a>; Matthew Hertz, Yi Feng, and Emery D. Berger\r | |
180 | </p>\r | |
181 | </li>\r | |
182 | <li>\r | |
183 | <p>\r | |
184 | <a href="http://portal.acm.org/citation.cfm?doid=1029873.1029881">Automatic heap sizing: taking real memory into account</a>; Ting Yang, Matthew Hertz, Emery D. Berger, Scott F. Kaplan, and J. Eliot B. Moss\r | |
185 | </p>\r | |
186 | </li>\r | |
187 | </ul></div>\r | |
188 | </div></div>\r | |
189 | <div class="paragraph"><p>Recommended Skills: C programming experience; some operating systems and/or systems programming experience; some compiler and garbage collector experience</p></div>\r | |
190 | </div>\r | |
191 | <div class="sect2">\r | |
192 | <h3 id="_implement_successor_160_ml_language_features">Implement Successor ML Language Features</h3>\r | |
193 | <div class="paragraph"><p>Any programming language, including Standard ML, can be improved.\r | |
194 | The community has identified a number of modest extensions and\r | |
195 | revisions to the Standard ML programming language that would\r | |
196 | likely prove useful in practice. This project aims to implement these\r | |
197 | language features in the MLton compiler.</p></div>\r | |
198 | <div class="paragraph"><p>Background:</p></div>\r | |
199 | <div class="openblock">\r | |
200 | <div class="content">\r | |
201 | <div class="ulist"><ul>\r | |
202 | <li>\r | |
203 | <p>\r | |
204 | <a href="http://successor-ml.org/index.php?title=Main_Page">Successor ML</a>\r | |
205 | </p>\r | |
206 | </li>\r | |
207 | <li>\r | |
208 | <p>\r | |
209 | <a href="http://www.mpi-sws.org/%7Erossberg/hamlet/index.html#successor-ml">HaMLet (Successor ML)</a>\r | |
210 | </p>\r | |
211 | </li>\r | |
212 | <li>\r | |
213 | <p>\r | |
214 | <a href="http://journals.cambridge.org/action/displayAbstract?aid=1322628">A critique of Standard ML</a>; Andrew W. Appel\r | |
215 | </p>\r | |
216 | </li>\r | |
217 | </ul></div>\r | |
218 | </div></div>\r | |
219 | <div class="paragraph"><p>Recommended Skills: SML programming experience; some front-end compiler experience (i.e., scanners and parsers)</p></div>\r | |
220 | </div>\r | |
221 | <div class="sect2">\r | |
222 | <h3 id="_implement_source_level_debugging">Implement Source-level Debugging</h3>\r | |
223 | <div class="paragraph"><p>Debugging is a fact of programming life. Unfortunately, most SML\r | |
224 | implementations (including MLton) provide little to no source-level\r | |
225 | debugging support. This project aims to add basic to intermediate\r | |
226 | source-level debugging support to the MLton compiler. MLton already\r | |
227 | supports source-level profiling, which can be used to attribute bytes\r | |
228 | allocated or time spent in source functions. It should be relatively\r | |
229 | straightforward to leverage this source-level information into basic\r | |
230 | source-level debugging support, with the ability to set/unset\r | |
231 | breakpoints and step through declarations and functions. It may be\r | |
232 | possible to also provide intermediate source-level debugging support,\r | |
233 | with the ability to inspect in-scope variables of basic types (e.g.,\r | |
234 | types compatible with MLton’s foreign function interface).</p></div>\r | |
235 | <div class="paragraph"><p>Background:</p></div>\r | |
236 | <div class="openblock">\r | |
237 | <div class="content">\r | |
238 | <div class="ulist"><ul>\r | |
239 | <li>\r | |
240 | <p>\r | |
241 | <a href="http://mlton.org/HowProfilingWorks">MLton — How Profiling Works</a>\r | |
242 | </p>\r | |
243 | </li>\r | |
244 | <li>\r | |
245 | <p>\r | |
246 | <a href="http://mlton.org/ForeignFunctionInterfaceTypes">MLton — Foreign Function Interface Types</a>\r | |
247 | </p>\r | |
248 | </li>\r | |
249 | <li>\r | |
250 | <p>\r | |
251 | <a href="http://dwarfstd.org/">DWARF Debugging Standard</a>\r | |
252 | </p>\r | |
253 | </li>\r | |
254 | <li>\r | |
255 | <p>\r | |
256 | <a href="http://sourceware.org/gdb/current/onlinedocs/stabs/index.html">STABS Debugging Format</a>\r | |
257 | </p>\r | |
258 | </li>\r | |
259 | </ul></div>\r | |
260 | </div></div>\r | |
261 | <div class="paragraph"><p>Recommended Skills: SML programming experience; some compiler experience</p></div>\r | |
262 | </div>\r | |
263 | <div class="sect2">\r | |
264 | <h3 id="_region_based_memory_management">Region Based Memory Management</h3>\r | |
265 | <div class="paragraph"><p>Region based memory management is an alternative automatic memory\r | |
266 | management scheme to garbage collection. Regions can be inferred by\r | |
267 | the compiler (e.g., Cyclone and MLKit) or provided to the programmer\r | |
268 | through a library. Since many students do not have extensive\r | |
269 | experience with compilers we plan on adopting the later approach.\r | |
270 | Creating a viable region based memory solution requires the removal of\r | |
271 | the GC and changes to the allocator. Additionally, write barriers\r | |
272 | will be necessary to ensure references between two ML objects is never\r | |
273 | established if the left hand side of the assignment has a longer\r | |
274 | lifetime than the right hand side. Students will need to come up with\r | |
275 | an appropriate interface for creating, entering, and exiting regions\r | |
276 | (examples include RTSJ scoped memory and SCJ scoped memory).</p></div>\r | |
277 | <div class="paragraph"><p>Background:</p></div>\r | |
278 | <div class="openblock">\r | |
279 | <div class="content">\r | |
280 | <div class="ulist"><ul>\r | |
281 | <li>\r | |
282 | <p>\r | |
283 | Cyclone\r | |
284 | </p>\r | |
285 | </li>\r | |
286 | <li>\r | |
287 | <p>\r | |
288 | MLKit\r | |
289 | </p>\r | |
290 | </li>\r | |
291 | <li>\r | |
292 | <p>\r | |
293 | RTSJ + SCJ scopes\r | |
294 | </p>\r | |
295 | </li>\r | |
296 | </ul></div>\r | |
297 | </div></div>\r | |
298 | <div class="paragraph"><p>Recommended Skills: SML programming experience; C programming experience; some compiler and garbage collector experience</p></div>\r | |
299 | </div>\r | |
300 | <div class="sect2">\r | |
301 | <h3 id="_integration_of_multi_mlton">Integration of Multi-MLton</h3>\r | |
302 | <div class="paragraph"><p><a href="http://multimlton.cs.purdue.edu">MultiMLton</a> is a compiler and runtime\r | |
303 | environment that targets scalable multicore platforms. It is an\r | |
304 | extension of MLton. It combines new language abstractions and\r | |
305 | associated compiler analyses for expressing and implementing various\r | |
306 | kinds of fine-grained parallelism (safe futures, speculation,\r | |
307 | transactions, etc.), along with a sophisticated runtime system tuned\r | |
308 | to efficiently handle large numbers of lightweight threads. The core\r | |
309 | stable features of MultiMLton will need to be integrated with the\r | |
310 | latest MLton public release. Certain experimental features, such as\r | |
311 | support for the Intel SCC and distributed runtime will be omitted.\r | |
312 | This project requires students to understand the delta between the\r | |
313 | MultiMLton code base and the MLton code base. Students will need to\r | |
314 | create build and configuration scripts for MLton to enable MultiMLton\r | |
315 | features.</p></div>\r | |
316 | <div class="paragraph"><p>Background</p></div>\r | |
317 | <div class="openblock">\r | |
318 | <div class="content">\r | |
319 | <div class="ulist"><ul>\r | |
320 | <li>\r | |
321 | <p>\r | |
322 | <a href="http://multimlton.cs.purdue.edu/mML/Publications.html">MultiMLton — Publications</a>\r | |
323 | </p>\r | |
324 | </li>\r | |
325 | </ul></div>\r | |
326 | </div></div>\r | |
327 | <div class="paragraph"><p>Recommended Skills: SML programming experience; C programming experience; some compiler experience</p></div>\r | |
328 | </div>\r | |
329 | <div class="sect2">\r | |
330 | <h3 id="_concurrent_160_ml_improvements">Concurrent ML Improvements</h3>\r | |
331 | <div class="paragraph"><p><a href="http://cml.cs.uchicago.edu/">Concurrent ML</a> is an SML concurrency\r | |
332 | library based on synchronous message passing. MLton has a partial\r | |
333 | implementation of the CML message-passing primitives, but its use in\r | |
334 | real-world applications has been stymied by the lack of completeness\r | |
335 | and thread-safe I/O libraries. This project would aim to flesh out\r | |
336 | the CML implementation in MLton to be fully compatible with the\r | |
337 | "official" version distributed as part of SML/NJ. Furthermore, time\r | |
338 | permitting, runtime system support could be added to allow use of\r | |
339 | modern OS features, such as asynchronous I/O, in the implementation of\r | |
340 | CML’s system interfaces.</p></div>\r | |
341 | <div class="paragraph"><p>Background</p></div>\r | |
342 | <div class="openblock">\r | |
343 | <div class="content">\r | |
344 | <div class="ulist"><ul>\r | |
345 | <li>\r | |
346 | <p>\r | |
347 | <a href="http://cml.cs.uchicago.edu/">http://cml.cs.uchicago.edu/</a>\r | |
348 | </p>\r | |
349 | </li>\r | |
350 | <li>\r | |
351 | <p>\r | |
352 | <a href="http://mlton.org/ConcurrentML">http://mlton.org/ConcurrentML</a>\r | |
353 | </p>\r | |
354 | </li>\r | |
355 | <li>\r | |
356 | <p>\r | |
357 | <a href="http://mlton.org/ConcurrentMLImplementation">http://mlton.org/ConcurrentMLImplementation</a>\r | |
358 | </p>\r | |
359 | </li>\r | |
360 | </ul></div>\r | |
361 | </div></div>\r | |
362 | <div class="paragraph"><p>Recommended Skills: SML programming experience; knowledge of concurrent programming; some operating systems and/or systems programming experience</p></div>\r | |
363 | </div>\r | |
364 | </div>\r | |
365 | </div>\r | |
366 | </div>\r | |
367 | <div id="footnotes"><hr></div>\r | |
368 | <div id="footer">\r | |
369 | <div id="footer-text">\r | |
370 | </div>\r | |
371 | <div id="footer-badges">\r | |
372 | </div>\r | |
373 | </div>\r | |
374 | </body>\r | |
375 | </html>\r |