{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T04:40:50Z","timestamp":1680756050181},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T00:00:00Z","timestamp":1671321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T00:00:00Z","timestamp":1671321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11227-022-04994-3","type":"journal-article","created":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T06:02:10Z","timestamp":1671343330000},"page":"8447-8474","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GVLE: a highly optimized GPU-based implementation of variable-length encoding"],"prefix":"10.1007","volume":"79","author":[{"given":"Antonio","family":"Fuentes-Alventosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"G\u00f3mez-Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Medina-Carnicer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,18]]},"reference":[{"issue":"2","key":"4994_CR1","first-page":"119","volume":"33","author":"U Jayasankar","year":"2021","unstructured":"Jayasankar U, Thirumal V, Ponnurangam D (2021) A survey on data compression techniques: from the perspective of data quality, coding schemes, data type and applications. J King Saud Univ-Comput Inf Sci 33(2):119\u2013140","journal-title":"J King Saud Univ-Comput Inf Sci"},{"key":"4994_CR2","unstructured":"Wise J \u201cHow many videos are uploaded to youtube a day in 2022?\u201d, June 2022. https:\/\/earthweb.com\/how-many-videos-are-uploaded-to-youtube-a-day\/"},{"key":"4994_CR3","volume-title":"Multimedia technologies","author":"A Banerji","year":"2010","unstructured":"Banerji A, Ghosh AM (2010) Multimedia technologies. Tata McGraw Hill, New Delhi"},{"key":"4994_CR4","doi-asserted-by":"crossref","unstructured":"Pu IM (2005) Fundamental data compression. Butterworth-Heinemann","DOI":"10.1016\/B978-075066310-6\/50013-1"},{"issue":"9","key":"4994_CR5","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proc IRE 40(9):1098\u20131101","journal-title":"Proc IRE"},{"issue":"4","key":"4994_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342555","volume":"52","author":"A Moffat","year":"2019","unstructured":"Moffat A (2019) Huffman coding. ACM Comput Surv (CSUR) 52(4):1\u201335","journal-title":"ACM Comput Surv (CSUR)"},{"key":"4994_CR7","doi-asserted-by":"crossref","unstructured":"Balevic A (2009) Parallel variable-length encoding on GPGPUs. In European Conference on Parallel Processing, Springer, Berlin, Heidelberg. pp 26\u201335","DOI":"10.1007\/978-3-642-14122-5_6"},{"key":"4994_CR8","doi-asserted-by":"crossref","unstructured":"Fuentes-Alventosa A, G\u00f3mez-Luna J, Gonz\u00e1lez-Linares JM, Guil N (2014) CUVLE: variable-length encoding on CUDA. In Design and Architectures for Signal and Image Processing (DASIP), 2014 Conference on IEEE. pp 1\u20136","DOI":"10.1109\/DASIP.2014.7115637"},{"key":"4994_CR9","doi-asserted-by":"crossref","unstructured":"Rahmani H, Topal C, Akinlar C (2014) A parallel Huffman coder on the CUDA architecture. In 2014 IEEE Visual Communications and Image Processing Conference, IEEE. pp 311\u2013314","DOI":"10.1109\/VCIP.2014.7051566"},{"key":"4994_CR10","doi-asserted-by":"crossref","unstructured":"Yamamoto N, Nakano K, Ito Y, Takafuji D, Kasagi A, Tabaru T (2020) Huffman coding with gap arrays for GPU acceleration. In 49th International Conference on Parallel Processing-ICPP. pp 1\u201311","DOI":"10.1145\/3404397.3404429"},{"key":"4994_CR11","doi-asserted-by":"crossref","unstructured":"Tian J, Di S, Zhao K, Rivera C, Fulp MH, Underwood R, Cappello F (2020) Cusz: an efficient gpu-based error-bounded lossy compression framework for scientific data. arXiv preprint arXiv:2007.09625","DOI":"10.1145\/3410463.3414624"},{"key":"4994_CR12","doi-asserted-by":"crossref","unstructured":"Tian J, Rivera C, Di S, Chen J, Liang X, Tao D, Cappello F (2021) Revisiting huffman coding: toward extreme performance on modern gpu architectures. In 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE. pp 881\u2013891","DOI":"10.1109\/IPDPS49936.2021.00097"},{"issue":"2","key":"4994_CR13","doi-asserted-by":"publisher","first-page":"2681","DOI":"10.1007\/s11227-021-03971-6","volume":"78","author":"F Zhu","year":"2022","unstructured":"Zhu F, Yan H (2022) An efficient parallel entropy coding method for JPEG compression based on GPU. J Supercomput 78(2):2681\u20132708","journal-title":"J Supercomput"},{"issue":"6","key":"4994_CR14","doi-asserted-by":"publisher","first-page":"7556","DOI":"10.1007\/s11227-021-04183-8","volume":"78","author":"A Fuentes-Alventosa","year":"2022","unstructured":"Fuentes-Alventosa A, G\u00f3mez-Luna J, Gonz\u00e1lez-Linares JM, Guil N, Medina-Carnicer R (2022) CAVLCU: an efficient GPU-based implementation of CAVLC. J Supercomput 78(6):7556\u20137590","journal-title":"J Supercomput"},{"key":"4994_CR15","unstructured":"NVIDIA: GPU-Accelerated Applications (2020) https:\/\/www.nvidia.com\/content\/dam\/en-zz\/Solutions\/Data-Center\/tesla-product-literature\/gpu-applications-catalog.pdf"},{"key":"4994_CR16","unstructured":"NVIDIA: CUDA Zone (2022) https:\/\/developer.nvidia.com\/category\/zone\/cuda-zone"},{"key":"4994_CR17","unstructured":"Khronos group: OpenCL (2022) https:\/\/www.khronos.org\/opencl\/"},{"issue":"39","key":"4994_CR18","first-page":"851","volume":"3","author":"M Harris","year":"2007","unstructured":"Harris M, Sengupta S, Owens JD (2007) Parallel prefix sum (scan) with CUDA. GPU Gems 3(39):851\u2013876","journal-title":"GPU Gems"},{"key":"4994_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00edn PJ, Ayuso LF, Torres R, Gavilanes A (2012) Algorithmic strategies for optimizing the parallel reduction primitive in CUDA. In 2012 International Conference on High Performance Computing & Simulation (HPCS), IEEE. pp 511\u2013519","DOI":"10.1109\/HPCSim.2012.6266966"},{"key":"4994_CR20","unstructured":"Sengupta S, Harris M, Garland M (2008) Efficient parallel scan algorithms for GPUs. NVIDIA, Santa Clara, CA, Tech. Rep. NVR-2008-003, 1(1), 1\u201317"},{"key":"4994_CR21","doi-asserted-by":"crossref","unstructured":"Yan S, Long G, Zhang Y (2013) StreamScan: fast scan algorithms for GPUs without global barrier synchronization. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming pp 229\u2013238","DOI":"10.1145\/2442516.2442539"},{"key":"4994_CR22","unstructured":"Luitjens J \u201cCUDA Pro Tip: increase Performance with Vectorized Memory Access\u201d, Dec. 2013. https:\/\/devblogs.nvidia.com\/cuda-pro-tip-increase-performance-with-vectorized-memory-access\/"},{"key":"4994_CR23","unstructured":"NVIDIA: CUDA C Programming Guide (2022) https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html"},{"key":"4994_CR24","unstructured":"NVIDIA: CUDA C Best Practices Guide (2022) https:\/\/docs.nvidia.com\/cuda\/cuda-c-best-practices-guide\/index.html"},{"key":"4994_CR25","doi-asserted-by":"crossref","unstructured":"Manz O (2021) Well Packed-Not a Bit Too Much. Springer Fachmedien Wiesbaden","DOI":"10.1007\/978-3-658-34737-6"},{"key":"4994_CR26","doi-asserted-by":"publisher","DOI":"10.1142\/11277","volume-title":"Telecommunications engineering: principles and practice","author":"A Gyasi-Agyei","year":"2019","unstructured":"Gyasi-Agyei A (2019) Telecommunications engineering: principles and practice. World Scientific, Singapore"},{"key":"4994_CR27","doi-asserted-by":"crossref","unstructured":"Unger H, Kyamaky K, Kacprzyk J. (Eds.). (2011). Autonomous Systems: Developments and Trends (Vol. 391). Springer","DOI":"10.1007\/978-3-642-24806-1"},{"key":"4994_CR28","doi-asserted-by":"crossref","unstructured":"Lal S, Lucas J, Juurlink B (2017) E$$^{2}$$MC: entropy encoding based memory compression for GPUs. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE. pp 1119\u20131128","DOI":"10.1109\/IPDPS.2017.101"},{"key":"4994_CR29","doi-asserted-by":"crossref","unstructured":"Choukse E, Sullivan MB, O\u2019Connor M, Erez M, Pool J, Nellans D, Keckler SW (2020) Buddy compression: enabling larger memory for deep learning and HPC workloads on GPUs. In 2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA), IEEE. pp 926\u2013939","DOI":"10.1109\/ISCA45697.2020.00080"},{"issue":"3","key":"4994_CR30","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1145\/79147.79150","volume":"37","author":"LL Larmore","year":"1990","unstructured":"Larmore LL, Hirschberg DS (1990) A fast algorithm for optimal length-limited Huffman codes. J ACM (JACM) 37(3):464\u2013473","journal-title":"J ACM (JACM)"},{"key":"4994_CR31","doi-asserted-by":"crossref","unstructured":"Katajainen J, Moffat A, Turpin A (1995) A fast and space-economical algorithm for length-limited coding. In International Symposium on Algorithms and Computation. Springer, Berlin, Heidelberg. pp 12\u201321","DOI":"10.1007\/BFb0015404"},{"key":"4994_CR32","unstructured":"NVIDIA CUDA Compiler Driver NVCC (2022) https:\/\/docs.nvidia.com\/cuda\/cuda-compiler-driver-nvcc\/index.html"},{"key":"4994_CR33","unstructured":"Luna JGG, Chang LW, Sung IJ, Hwu WM, Guil N (2015) In-place data sliding algorithms for many-core architectures. In: 2015 44th International Conference on Parallel Processing, IEEE. pp 210\u2013219"},{"key":"4994_CR34","doi-asserted-by":"crossref","unstructured":"Di S, Cappello F (2016) Fast error-bounded lossy HPC data compression with SZ. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE. pp 730\u2013739","DOI":"10.1109\/IPDPS.2016.11"},{"issue":"5","key":"4994_CR35","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s00138-012-0443-3","volume":"24","author":"J G\u00f3mez-Luna","year":"2013","unstructured":"G\u00f3mez-Luna J, Gonz\u00e1lez-Linares JM, Benavides JI, Guil N (2013) An optimized approach to histogram computation on GPU. Mach Vis Appl 24(5):899\u2013908","journal-title":"Mach Vis Appl"},{"key":"4994_CR36","unstructured":"Barnett ML (2003) U.S. Patent No. 6,657,569. Washington, DC: U.S. Patent and Trademark Office"},{"key":"4994_CR37","doi-asserted-by":"crossref","unstructured":"Su H, Zhang C, Chai J, Wen M, Wu N, Ren J (2011) A high-efficient software parallel CAVCL encoder based on GPU, 2011 34th International Conference on Telecommunications and Signal Processing (TSP), Budapest, pp 534\u2013540","DOI":"10.1109\/TSP.2011.6043672"},{"key":"4994_CR38","doi-asserted-by":"crossref","unstructured":"Su H, Wen M, Wu N, Ren J, Zhang C (2014) Efficient parallel video processing techniques on GPU: from framework to implementation. Sci World J, 2014","DOI":"10.1155\/2014\/716020"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04994-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04994-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04994-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T19:35:47Z","timestamp":1680723347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04994-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,18]]},"references-count":38,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["4994"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04994-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,18]]},"assertion":[{"value":"3 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No, I declare that the authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The corresponding author has read the Springer journal policies on author responsibilities and submits this manuscript in accordance with those policies.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"I have read and understood the publishing policy, and submit this manuscript in accordance with this policy.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}