{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:59Z","timestamp":1750309319071,"version":"3.41.0"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2018YFB0204302"],"award-info":[{"award-number":["2018YFB0204302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Program of National Natural Science Foundation of China","award":["92055213"],"award-info":[{"award-number":["92055213"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872127, 62102141, 61751204"],"award-info":[{"award-number":["61872127, 62102141, 61751204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            With the increasing scale of cloud computing applications of next-generation embedded systems, a major challenge that domain scientists are facing is how to efficiently store and analyze the vast volume of output data. Compression can reduce the amount of data that needs to be transferred and stored. However, most of the large datasets are in floating-point format, which exhibits high entropy. As a result, existing lossless compressors cannot provide enough performance for such applications. To address this problem, we propose a total variation reduction method for improving the compression ratio of lossless compressors (namely, FPC\n            <jats:sup>+<\/jats:sup>\n            and FPZIP\n            <jats:sup>+<\/jats:sup>\n            ), which employs a median-based hyperplane to precondition the data. In particular, we first try to exploit the space-filling curve (SFC), a well-known technique to preserve data locality for a multi-dimensional dataset. We show and explain why a raw SFC, such as Hilbert and Z-order curves, cannot improve the compression ratio. Then, we explore the opportunity and theoretical feasibility of the proposed total variation reduction-based algorithm. The experiment results show the effectiveness of the proposed method. The compression ratios are improved up to 48.2% (20.6% on average) for FPZIP and 42.4% (18.4% on average) for FPC. Moreover, through observing the time composition of the proposed method, it is found that the median finding holds a high percentage of the execution time. Hence, we further introduce an approximate median finding algorithm, providing a linear-time overhead reduction scheme. The experiment results clearly demonstrate that this algorithm reduces execution time by an average of 56.7% and 40.7% compared to FPC\n            <jats:sup>+<\/jats:sup>\n            and FPZIP\n            <jats:sup>+<\/jats:sup>\n            , respectively.\n          <\/jats:p>","DOI":"10.1145\/3605359","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T15:36:33Z","timestamp":1687188993000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["AMP: Total Variation Reduction for Lossless Compression via Approximate Median-based Preconditioning"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6158-4498","authenticated-orcid":false,"given":"Fenfang","family":"Li","sequence":"first","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2392-0267","authenticated-orcid":false,"given":"Huizhang","family":"Luo","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3427-366X","authenticated-orcid":false,"given":"Junqi","family":"Wang","sequence":"additional","affiliation":[{"name":"Rutgers University-Newark, Newark, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6412-7129","authenticated-orcid":false,"given":"Yida","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9081-8153","authenticated-orcid":false,"given":"Zhuo","family":"Tang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2023. Community Earth Simulation Model (CESM). Retrieved December 21 2022 from https:\/\/www.cesm.ucar.edu\/."},{"key":"e_1_3_2_3_2","unstructured":"Amrex-astro. 2021. NYX Simulation. Retrieved from https:\/\/amrex-astro.github.io\/Nyx\/."},{"key":"e_1_3_2_4_2","unstructured":"Krzysztof Blaszczyk Peter Rossmanith Dipl-Inf Alexander Langer and Dipl-Inf Felix Reidl. 2012. PAQ compression algorithm. Avaliable at https:\/\/www.tcs.rwth-aachen.de\/lehre\/Komprimierung\/SS2012\/ausarbeitungen\/PAQ.pdf."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.131"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.43"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2010.08.006"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21840-3_16"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2018.00042"},{"key":"e_1_3_2_11_2","article-title":"Smaller and faster data compression with Zstandard","volume":"1","author":"Collet Yann","year":"2016","unstructured":"Yann Collet and Chip Turner. 2016. Smaller and faster data compression with Zstandard. Facebook Code 1.","journal-title":"Facebook Code"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00042"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00087"},{"issue":"7","key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366647","article-title":"Algorithm 65: Find","volume":"4","author":"Hoare Charles A. R.","year":"1961","unstructured":"Charles A. R. Hoare. 1961. Algorithm 65: Find. Commun. ACM 4, 7 (1961), 321\u2013322.","journal-title":"Commun. ACM"},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","unstructured":"David Huber Ralf Kissmann Anita Reimer and Olaf Reimer. 2021. Relativistic fluid modelling of gamma-ray binaries-I. The model. Astronomy and Astrophysics 646 (2021) A91.","DOI":"10.1051\/0004-6361\/202039277"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC50243.2021.00018"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476224"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622520"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356193"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2018.00036"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.2151\/sola.2017-001"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346458"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2014.04.009"},{"key":"e_1_3_2_25_2","unstructured":"Jean loup Gailly. 2007. GNU Gzip. Retrieved January 13 2022 from http:\/\/www.gzip.org\/."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00044"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00048"},{"key":"e_1_3_2_28_2","unstructured":"Matthew V. Mahoney. 2002. The PAQ1 data compression program. (unpublished)."},{"key":"e_1_3_2_29_2","unstructured":"Nelson Mark. 1991. Arithmetic Coding+ Statistical Modeling= Data Compression. Dr. Dobb's (1991)."},{"key":"e_1_3_2_30_2","unstructured":"Matt Mahoney. 2013. Data Compression Explained. Retrieved March 1 2023 from http:\/\/mattmahoney.net\/dc\/dce.html."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1080\/02664760500079464"},{"key":"e_1_3_2_33_2","unstructured":"NCAR. 2003. IEEE Visualization 2004 Contest. Retrieved from http:\/\/vis.computer.org\/vis2004contest\/data.html."},{"key":"e_1_3_2_34_2","unstructured":"Mark Nelson and Jean-Loup Gailly. 1995. The Data Compression Book 2nd edition. M & T Books New York NY."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1964179.1964189"},{"key":"e_1_3_2_36_2","unstructured":"Igor Pavlov. 2023. 7z format. Retrieved Marcy 2023 from http:\/\/www.7-zip.org\/7z.html."},{"key":"e_1_3_2_37_2","unstructured":"Peter Linderstrom. 2021. Our Codes-Miranda. Retrieved from https:\/\/tasc.llnl.gov\/about-us\/our-codes."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1080\/01431161.2017.1399478"},{"key":"e_1_3_2_39_2","unstructured":"Ramachandra Budihal. 2010. Emerging Trends in Embedded Systems and Applications. Retrieved December 21 2022 from https:\/\/www.embedded.com\/emerging-trends-in-embedded-systems-and-applications\/."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555801"},{"key":"e_1_3_2_41_2","unstructured":"David Reinsel-John Gantz-John Rydning J. Reinsel and J. Gantz. 2018. The digitization of the world from edge to core. Framingham: International Data Corporation 16 (2018)."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/SSIAI.2018.8470318"},{"key":"e_1_3_2_43_2","volume-title":"Introduction to Data Compression","author":"Sayood Khalid","year":"2017","unstructured":"Khalid Sayood. 2017. Introduction to Data Compression. Morgan Kaufmann."},{"key":"e_1_3_2_44_2","unstructured":"Julian Seward. 1996. bzip2 and libbzip2. Retrieved from http:\/\/www.bzip.org."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.115"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2016.54"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29400-7_21"},{"key":"e_1_3_2_48_2","article-title":"Cusz: An efficient gpu-based error-bounded lossy compression framework for scientific data","author":"Tian Jiannan","year":"2020","unstructured":"Jiannan Tian, Sheng Di, Kai Zhao, Cody Rivera, Megan Hickman Fulp, Robert Underwood, Sian Jin, Xin Liang, Jon Calhoun, Dingwen Tao, et\u00a0al. 2020. Cusz: An efficient gpu-based error-bounded lossy compression framework for scientific data. arXiv:2007.09625. Retrieved from https:\/\/arxiv.org\/abs\/2007.09625.","journal-title":"arXiv:2007.09625"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2015.59"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3369583.3392688"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605359","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:55Z","timestamp":1750291435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3605359"],"URL":"https:\/\/doi.org\/10.1145\/3605359","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"2022-12-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}