2026-09-19T00:36:42Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/531282022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Jack Dennis. Jacobs, William J., M. Eng. Massachusetts Institute of Technology Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2010-03-25T15:04:44Z 2010-03-25T15:04:44Z 2009 2009 http://hdl.handle.net/1721.1/53128 503460472 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. Includes bibliographical references (p. 80). 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. by William J. Jacobs. M.Eng. 80 p. eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Designing and compiling functional Java for the Fresh Breeze architecture Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1eba34ba-8d85-4694-8731-816fec2c1182"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Designing and compiling functional Java for the Fresh Breeze architecture</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2009</PublicationDate> <Authors> <Author> <DisplayName>Jacobs, William J., M. Eng. Massachusetts Institute of Technology</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <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> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>