Show simple item record

dc.contributor.advisorLoguinov, Dmitri
dc.creatorZhang, Xiaoxi
dc.date.accessioned2012-02-14T22:19:32Z
dc.date.accessioned2012-02-16T16:18:58Z
dc.date.available2014-01-15T07:05:31Z
dc.date.created2011-12
dc.date.issued2012-02-14
dc.date.submittedDecember 2011
dc.identifier.urihttps://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10308
dc.description.abstractThis paper demonstrates an efficient text compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 GHz CPU. We measure match finder time, range encoder compression time and demonstrate realtime performance on a large dataset: 10 GB web pages crawled by IRLbot. Our parallel range encoder is 15 times faster than sequential algorithm (FastAC) with static model.en
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectGPUsen
dc.subjectparallel computingen
dc.subjectcompressionen
dc.titleEfficient Parallel Text Compression on GPUsen
dc.typeThesisen
thesis.degree.departmentComputer Science and Engineeringen
thesis.degree.disciplineComputer Scienceen
thesis.degree.grantorTexas A&M Universityen
thesis.degree.nameMaster of Scienceen
thesis.degree.levelMastersen
dc.contributor.committeeMemberFriesen, Donald
dc.contributor.committeeMemberReddy, A. L. Narasimha
dc.type.genrethesisen
dc.type.materialtexten
local.embargo.terms2014-01-15


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record