Modeling the scalability of acrylic stream programs
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/18004 |
_version_ | 1826214610375540736 |
---|---|
author | Wong, Jeremy Ng, 1981- |
author2 | Saman P. Amarasinghe. |
author_facet | Saman P. Amarasinghe. Wong, Jeremy Ng, 1981- |
author_sort | Wong, Jeremy Ng, 1981- |
collection | MIT |
description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. |
first_indexed | 2024-09-23T16:08:31Z |
format | Thesis |
id | mit-1721.1/18004 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T16:08:31Z |
publishDate | 2005 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/180042019-04-11T13:28:40Z Modeling the scalability of acrylic stream programs Characterizing the streaming application domain Wong, Jeremy Ng, 1981- Saman P. Amarasinghe. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. Includes bibliographical references (p. 109-110). Despite the fact that the streaming application domain is becoming increasingly widespread, few studies have focused specifically on the performance characteristics of stream programs. We introduce two models by which the scalability of stream programs can be predicted to some degree of accuracy. This is accomplished by testing a series of stream benchmarks on our numerical representations of the two models. These numbers are then compared to actual speedups obtained by running the benchmarks through the Raw machine and a Magic network. Using the metrics, we show that stateless acyclic stream programs benefit considerably from data, parallelization. In particular, programs with low communication datarates experience up to a tenfold speedup increase when parallelized to a reasonable margin. Those with high communication data rates also experience approximately a twofold speedup. We find that the model that takes synchronization communication overhead into account, in addition to a cost proportional to the communication rate of the stream, provides the highest predictive accuracy. by Jeremy Ng Wong. M.Eng. 2005-06-02T19:35:23Z 2005-06-02T19:35:23Z 2004 2004 Thesis http://hdl.handle.net/1721.1/18004 57204290 eng 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 110 p. 6072218 bytes 6085525 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
spellingShingle | Electrical Engineering and Computer Science. Wong, Jeremy Ng, 1981- Modeling the scalability of acrylic stream programs |
title | Modeling the scalability of acrylic stream programs |
title_full | Modeling the scalability of acrylic stream programs |
title_fullStr | Modeling the scalability of acrylic stream programs |
title_full_unstemmed | Modeling the scalability of acrylic stream programs |
title_short | Modeling the scalability of acrylic stream programs |
title_sort | modeling the scalability of acrylic stream programs |
topic | Electrical Engineering and Computer Science. |
url | http://hdl.handle.net/1721.1/18004 |
work_keys_str_mv | AT wongjeremyng1981 modelingthescalabilityofacrylicstreamprograms AT wongjeremyng1981 characterizingthestreamingapplicationdomain |