2026-09-19T07:05:58Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/531492022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Saman Amarasinghe.
Steele, Matthew D., M. Eng. (Matthew David). 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:07:19Z
2010-03-25T15:07:19Z
2009
2009
http://hdl.handle.net/1721.1/53149
505551965
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 81-82).
Many computational systems need to deal with various forms of imprecision and uncertainty in their data; it is also the case that many systems, especially mobile and distributed systems, must be able to trade off the precision of their data and operations against the cost of performing those operations. Unfortunately, for many applications, trying to make these tradeoffs severely complicates the program, because there does not yet exist a programming model that gives the programmer the ability to easily describe the relevant tradeoffs between precision and cost of operations or to express in an algorithm what tradeoffs are appropriate under what circumstances. This paper lays a solid foundation for exploring such programming models by introducing and analyzing a simple core abstraction on which others can be based. We determine what sorts of strategies are and are not possible within this abstraction, and discuss what specific difficulties must be overcome in future work in order to extend the abstraction to encompass a larger class of programs.
by Matthew D. Steele.
M.Eng.
82 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.
A programming language for precision--cost tradeoffs
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5f86ab6b-be3d-4640-8651-868e6eb3076a">
<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>A programming language for precision--cost tradeoffs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2009</PublicationDate>
<Authors>
<Author>
<DisplayName>Steele, Matthew D., M. Eng. (Matthew David). 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>Many computational systems need to deal with various forms of imprecision and uncertainty in their data; it is also the case that many systems, especially mobile and distributed systems, must be able to trade off the precision of their data and operations against the cost of performing those operations. Unfortunately, for many applications, trying to make these tradeoffs severely complicates the program, because there does not yet exist a programming model that gives the programmer the ability to easily describe the relevant tradeoffs between precision and cost of operations or to express in an algorithm what tradeoffs are appropriate under what circumstances. This paper lays a solid foundation for exploring such programming models by introducing and analyzing a simple core abstraction on which others can be based. We determine what sorts of strategies are and are not possible within this abstraction, and discuss what specific difficulties must be overcome in future work in order to extend the abstraction to encompass a larger class of programs.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>