Back to Results
First PageMeta Content
Entropy encoding / Lossless data compression / Arithmetic coding / GPGPU / Huffman coding / Texture compression / LZ77 and LZ78 / Range encoding / Lossy compression / Data compression / Information theory / Computing


Using Arithmetic Coding for Reduction of Resulting Simulation Data Size on Massively Parallel GPGPUs Ana Balevic, Lars Rockstroh, Marek Wroblewski, and Sven Simon Institute for Parallel and Distributed Systems, Universit
Add to Reading List

Document Date: 2008-06-06 12:06:08


Open Document

File Size: 1.009,18 KB

Share Result on Facebook

City

Washington / DC / Stuttgart / /

Company

AMD / NVidia / GPU / /

Country

Germany / United States / /

Currency

USD / /

/

Facility

Sven Simon Institute / /

IndustryTerm

large systems / blockparallel entropy coding algorithm / raw processing power / sequential data compression algorithm / arithmetic co-processors / entropy coding algorithms / statistical lossless data compression algorithm / external file comparison tool / performance computing systems / fundamental lossless algorithms / multi-processor / post-processing / high processing speed / compression algorithms / streaming processors / parallel systems / purpose graphics hardware / data compression algorithms / compression utilities / parallel computing systems / /

Organization

Sven Simon Institute for Parallel and Distributed Systems / IEEE Computer Society / /

Person

Marek Wroblewski / Lars Rockstroh / Ana Balevic / Allen / Claude Shannon / /

Position

General / /

ProgrammingLanguage

DC / /

PublishedMedium

Computer Graphics / /

Technology

128 streaming processors / two fundamental lossless algorithms / statistical lossless data compression algorithm / RAM / data compression algorithms / blockparallel entropy coding algorithm / entropy coding algorithms / sequential data compression algorithm / Simulation / adaptive Huffman algorithms / arithmetic co-processors / Lossless compression algorithms / /

SocialTag