dc.contributor.advisor | Güdükbay, Uğur | |
dc.contributor.author | Özsema, Habibe Güldamla | |
dc.date.accessioned | 2015-10-16T13:04:01Z | |
dc.date.available | 2015-10-16T13:04:01Z | |
dc.date.copyright | 2014-12 | |
dc.date.issued | 2014-12 | |
dc.identifier.uri | http://hdl.handle.net/11693/14014 | |
dc.description | Includes bibliographical references (leaves 47-51). | en_US |
dc.description | Cataloged from PDF version of thesis. | en_US |
dc.description | Thesis (M.S.): Bilkent University, The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2014. | en_US |
dc.description.abstract | There is an ever increasing rate of digital information available in the form of
online data streams. In many application domains, high throughput processing
of such data is a critical requirement for keeping up with the soaring input rates.
Data stream processing is a computational paradigm that aims at addressing this
challenge by processing data streams in an on-the-fly manner.
In this thesis, we study the problem of automatically parallelizing data stream
processing applications to improve throughput. The parallelization is automatic
in the sense that stream programs are written sequentially by the application
developers and are parallelized by the system. We adopt the asynchronous data
flow model for our work, where operators often have dynamic selectivity and are
stateful. We solve the problem of pipelined fission, in which the original sequential
program is parallelized by taking advantage of both pipeline and data parallelism
at the same time. Our solution supports partitioned stateful data parallelism
with dynamic selectivity and is designed for shared-memory multi-core machines.
We first develop a cost-based formulation to express pipelined fission as an optimization
problem. The bruteforce solution of this problem takes a very long
time for moderately sized stream programs. Accordingly, we develop a heuristic
algorithm that can quickly, but approximately, solve this problem. We provide
an extensive evaluation studying the performance of our solution, including simulations
and experiments with an industrial-strength Data Stream Processing
Systems (DSPS). Our results show good scalability for applications that contain
sufficient parallelism, closeness to optimal performance for the algorithm. | en_US |
dc.description.statementofresponsibility | by Habibe Güldamla Özsema. | en_US |
dc.format.extent | xi, 51 leaves : graphics. | en_US |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Data Stream Processing | en_US |
dc.subject | Parallelization | en_US |
dc.subject | Pipelining | en_US |
dc.subject | Fission | en_US |
dc.subject.lcc | QA76.9.A73 O97 2014 | en_US |
dc.subject.lcsh | Computer architecture. | en_US |
dc.title | Pipelined fission for stream programs with dynamic selectivity and partitioned state | en_US |
dc.type | Thesis | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.publisher | Bilkent University | en_US |
dc.description.degree | M.S. | en_US |
dc.identifier.itemid | B149446 | |