Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp018w32r880k| Title: | IW Project Report |
| Authors: | Macleod, Daniel |
| Advisors: | Walker, David |
| Department: | Computer Science |
| Class Year: | 2022 |
| Abstract: | This paper presents an extension to the Data Plane Programming Language Lucid implementing Sum data types, as well as a test of Lucid’s capacity for multi-switch programming though the implementation of the load balancing algorithm Hula. Lucid is a programming language for programmable switch hardware designed to be more abstract and more concise than current data plane languages, such as P4. This paper first presents an extension to Lucid’s current type system implementing functional style Sum data types. Secondly, this paper provides an implementation of the Hula load balancing algorithm in Lucid as an test of Lucid’s current ability to write complex, multi-switch programs. |
| URI: | http://arks.princeton.edu/ark:/88435/dsp018w32r880k |
| Type of Material: | Princeton University Senior Theses |
| Language: | en |
| Appears in Collections: | Computer Science, 1987-2023 |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| MACLEOD-DANIEL-THESIS.pdf | 160.96 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.