{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T08:48:07Z","timestamp":1707814087882},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"11n12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Soft. Eng. Knowl. Eng."],"published-print":{"date-parts":[[2021,12]]},"abstract":" Non-volatile memory (NVM) has emerged as an alternative of the next-generation memory due to its non-volatility, byte addressability, high storage-density, and low-energy consumption. However, NVM also has some limitations, e.g. asymmetric read and write latency. Therefore, at present, it is not realistic to completely replace DRAM with NVM in computer systems. A more feasible scheme is to adopt the hybrid memory architecture composed of NVM and DRAM. Following the assumption of hybrid memory architecture, in this paper, we propose an NVM-friendly sorting algorithm called NVMSorting. Particularly, we introduce a new concept called Natural Run to improve the existing MONTRES algorithm. Further, we apply the proposed NVMSorting to database join algorithms to improve the performance of the existing sort-merge join. To verify the performance of our proposal, we implement six existing sorting algorithms as baselines, including the MONTRES algorithm, and conduct comparative experiments on real Intel Optane DC persistent memory. The results show that NVMSorting outperforms other sorting algorithms in terms of execution time and NVM writes. In addition, the results of the join experiment show that the NVMSorting algorithm achieves the highest performance among all schemes. Especially, in the partially ordered data, the execution time of NVMSorting is 2.9%, 2.7%, and 4.2% less than MONTRES, external sort, and quick sort, respectively. Also, the amount of NVM writes of the NVMSorting is 26.1%, 43.6%, 96.2% less than MONTRES, external sort, and quick sort, respectively. <\/jats:p>","DOI":"10.1142\/s0218194021400143","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T09:01:56Z","timestamp":1643101316000},"page":"1603-1621","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Sorting Algorithm for Non-Volatile Memory"],"prefix":"10.1142","volume":"31","author":[{"given":"Zhaole","family":"Chu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Jinzhai Road 96, Hefei 230027, P. R. China"}]},{"given":"Yongping","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Jinzhai Road 96, Hefei 230027, P. R. China"}]},{"given":"Peiquan","family":"Jin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Jinzhai Road 96, Hefei 230027, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"S0218194021400143BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00146"},{"key":"S0218194021400143BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44917-2_8"},{"key":"S0218194021400143BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44917-2_10"},{"key":"S0218194021400143BIB004","first-page":"169","volume-title":"Proc. 8th USENIX Conf. File and Storage Technologies","author":"Yang J.","year":"2020"},{"key":"S0218194021400143BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/3399666.3399898"},{"key":"S0218194021400143BIB006","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732277"},{"key":"S0218194021400143BIB007","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755604"},{"key":"S0218194021400143BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2979819"},{"key":"S0218194021400143BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60245-1_2"},{"key":"S0218194021400143BIB010","first-page":"21","volume-title":"Proc. 5th Biennial Conf. Innovative Data Systems Research","author":"Chen S.","year":"2011"},{"key":"S0218194021400143BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00128"},{"key":"S0218194021400143BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00035"},{"key":"S0218194021400143BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2706678"},{"key":"S0218194021400143BIB014","first-page":"49","volume-title":"Proc. IEEE Non-Volatile Memory Systems and Applications Symp.","author":"Khernache M. B. A.","year":"2018"},{"key":"S0218194021400143BIB015","first-page":"547","volume-title":"Proc. 24th Int. Conf. Extending Database Technology","author":"Jin P.","year":"2021"},{"key":"S0218194021400143BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"}],"container-title":["International Journal of Software Engineering and Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218194021400143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T09:02:12Z","timestamp":1643101332000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218194021400143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":16,"journal-issue":{"issue":"11n12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S0218194021400143"],"URL":"https:\/\/doi.org\/10.1142\/s0218194021400143","relation":{},"ISSN":["0218-1940","1793-6403"],"issn-type":[{"value":"0218-1940","type":"print"},{"value":"1793-6403","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}