{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/53128"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/53128","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Designing and compiling functional Java for the Fresh Breeze architecture","abstract":"The Fresh Breeze architecture is a novel approach to computing that aims to support a high degree of parallelism. Rather than striving for heroic complexity in order to support exceptional single-thread performance, as in the Pentium and PowerPC processors, it focuses on using a medium level of complexity with a view to enabling exceptional parallelized performance. The design makes certain sacrifices with regard to capability in order to achieve a lower degree of complexity. These design choices have significant implications for compiling for the architecture. In particular, Fresh Breeze uses immutable, fixed-size memory chunks rather than sequential, mutable memory to store data [1][2][3]. This work demonstrates Functional Java, a subset of the Java language that one can compile to Fresh Breeze machine code with relative ease, overcoming challenges pertaining to aliased arrays and objects. It also describes work on a compiler designed for the Fresh Breeze architecture and how the work overcomes various challenges in compiling Java bytecode to data flow graphs.","abstract_html":"The Fresh Breeze architecture is a novel approach to computing that aims to support a high degree of parallelism. Rather than striving for heroic complexity in order to support exceptional single-thread performance, as in the Pentium and PowerPC processors, it focuses on using a medium level of complexity with a view to enabling exceptional parallelized performance. The design makes certain sacrifices with regard to capability in order to achieve a lower degree of complexity. These design choices have significant implications for compiling for the architecture. In particular, Fresh Breeze uses immutable, fixed-size memory chunks rather than sequential, mutable memory to store data [1][2][3]. This work demonstrates Functional Java, a subset of the Java language that one can compile to Fresh Breeze machine code with relative ease, overcoming challenges pertaining to aliased arrays and objects. It also describes work on a compiler designed for the Fresh Breeze architecture and how the work overcomes various challenges in compiling Java bytecode to data flow graphs.","abstract_has_math":false,"creators":["Jacobs, William J., M. Eng. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Jack Dennis."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:20:58Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/53128","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Jack Dennis."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Jacobs, William J., M. Eng. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-03-25T15:04:44Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-03-25T15:04:44Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/53128"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Includes bibliographical references (p. 80)."]},{"key":"dc:description.abstract","label":"Abstract","values":["The Fresh Breeze architecture is a novel approach to computing that aims to support a high degree of parallelism. Rather than striving for heroic complexity in order to support exceptional single-thread performance, as in the Pentium and PowerPC processors, it focuses on using a medium level of complexity with a view to enabling exceptional parallelized performance. The design makes certain sacrifices with regard to capability in order to achieve a lower degree of complexity. These design choices have significant implications for compiling for the architecture. In particular, Fresh Breeze uses immutable, fixed-size memory chunks rather than sequential, mutable memory to store data [1][2][3]. This work demonstrates Functional Java, a subset of the Java language that one can compile to Fresh Breeze machine code with relative ease, overcoming challenges pertaining to aliased arrays and objects. It also describes work on a compiler designed for the Fresh Breeze architecture and how the work overcomes various challenges in compiling Java bytecode to data flow graphs."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Designing and compiling functional Java for the Fresh Breeze architecture"]}]}],"canonical_facts":{"dc:contributor.advisor":["Jack Dennis."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Jacobs, William J., M. Eng. Massachusetts Institute of Technology"],"dc:date.accessioned":["2010-03-25T15:04:44Z"],"dc:date.available":["2010-03-25T15:04:44Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Includes bibliographical references (p. 80)."],"dc:description.abstract":["The Fresh Breeze architecture is a novel approach to computing that aims to support a high degree of parallelism. Rather than striving for heroic complexity in order to support exceptional single-thread performance, as in the Pentium and PowerPC processors, it focuses on using a medium level of complexity with a view to enabling exceptional parallelized performance. The design makes certain sacrifices with regard to capability in order to achieve a lower degree of complexity. These design choices have significant implications for compiling for the architecture. In particular, Fresh Breeze uses immutable, fixed-size memory chunks rather than sequential, mutable memory to store data [1][2][3]. This work demonstrates Functional Java, a subset of the Java language that one can compile to Fresh Breeze machine code with relative ease, overcoming challenges pertaining to aliased arrays and objects. It also describes work on a compiler designed for the Fresh Breeze architecture and how the work overcomes various challenges in compiling Java bytecode to data flow graphs."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/53128"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Designing and compiling functional Java for the Fresh Breeze architecture"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:58Z"}