Pipelined fission for stream programs with dynamic selectivity and partitioned state

Simple item page
buir.advisorGüdükbay, Uğur
dc.contributor.authorÖzsema, Habibe Güldamla
dc.date.accessioned2015-10-16T13:04:01Z
dc.date.available2015-10-16T13:04:01Z
dc.date.copyright2014-12
dc.date.issued2014-12
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionIncludes bibliographical references (leaves 47-51).en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionThesis (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.abstractThere 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.degreeM.S.en_US
dc.description.statementofresponsibilityby Habibe Güldamla Özsema.en_US
dc.format.extentxi, 51 leaves : graphics.en_US
dc.identifier.itemidB149446
dc.identifier.urihttp://hdl.handle.net/11693/14014
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectData Stream Processingen_US
dc.subjectParallelizationen_US
dc.subjectPipeliningen_US
dc.subjectFissionen_US
dc.subject.lccQA76.9.A73 O97 2014en_US
dc.subject.lcshComputer architecture.en_US
dc.titlePipelined fission for stream programs with dynamic selectivity and partitioned stateen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006766-bilkent.pdf
Size:
660.62 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dept. of Computer Engineering - Master's degree