{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:25Z","timestamp":1740122365342,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["61860206011","61876061","61876164"],"award-info":[{"award-number":["61860206011","61876061","61876164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10586-022-03591-6","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T11:12:49Z","timestamp":1650280369000},"page":"539-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PI-sqrt: novel parallel implementations of in-place sequence rotation on multicore systems"],"prefix":"10.1007","volume":"26","author":[{"given":"Mervat","family":"Hashem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3433-7640","authenticated-orcid":false,"given":"Ahmad","family":"Salah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"unstructured":"Avmoskal: Get started with parallel stl (2018). https:\/\/software.intel.com\/en-us\/get-started-with-pstl","key":"3591_CR1"},{"doi-asserted-by":"crossref","unstructured":"Awan, M.G., Saeed, F.: Gpu-arraysort: A parallel, in-place algorithm for sorting large number of arrays. In: Parallel processing workshops (ICPPW), 2016 45th international conference on, pp. 78\u201387. IEEE (2016)","key":"3591_CR2","DOI":"10.1109\/ICPPW.2016.27"},{"key":"3591_CR3","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s11227-018-2623-z","volume":"75","author":"HM Bahig","year":"2018","unstructured":"Bahig, H.M.: A new constant-time parallel algorithm for merging. J. Supercomput. 75, 968\u2013983 (2018)","journal-title":"J. Supercomput."},{"key":"3591_CR4","volume-title":"Programming pearls","author":"J Bentley","year":"2000","unstructured":"Bentley, J.: Programming pearls, 2nd edn. Addison-Wesley Professional, Boston (2000)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Berney, K., Casanova, H., Higuchi, A., Karsin, B., Sitchinava, N.: Beyond binary search: parallel in-place construction of implicit search tree layouts. In: 2018 IEEE international parallel and distributed processing symposium (IPDPS), pp. 1070\u20131079. IEEE (2018)","key":"3591_CR5","DOI":"10.1109\/IPDPS.2018.00116"},{"key":"3591_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3075392","author":"K Berney","year":"2021","unstructured":"Berney, K., Casanova, H., Karsin, B., Sitchinava, N.: Beyond binary search: parallel in-place construction of implicit search tree layouts. IEEE Trans. Comput. (2021). https:\/\/doi.org\/10.1109\/TC.2021.3075392","journal-title":"IEEE Trans. Comput."},{"unstructured":"Bornat, R.: Lecture slides on algorithms. online (1998). http:\/\/www.eis.mdx.ac.uk\/staffpages\/r_bornat\/oldteaching\/I2A\/","key":"3591_CR7"},{"issue":"1","key":"3591_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry standard API for shared-memory programming. Comput. Sci. Eng., IEEE 5(1), 46\u201355 (1998)","journal-title":"Comput. Sci. Eng., IEEE"},{"key":"3591_CR9","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.procs.2010.12.172","volume":"3","author":"ME Dalkilic","year":"2011","unstructured":"Dalkilic, M.E., Acar, E., Tokatli, G.: A simple shuffle-based stable in-place merge algorithm. Procedia Comput. Sci. 3, 1049\u20131054 (2011). https:\/\/doi.org\/10.1016\/j.procs.2010.12.172","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"3591_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1093\/comjnl\/43.1.40","volume":"43","author":"J Ellis","year":"2000","unstructured":"Ellis, J., Markov, M.: In situ, stable merging by way of the perfect shuffle. Comput. J. 43(1), 40\u201353 (2000)","journal-title":"Comput. J."},{"unstructured":"Furia, C.A.: Rotation of sequences: algorithms and proofs. arXiv preprint arXiv:1406.5453 (2014)","key":"3591_CR11"},{"key":"3591_CR12","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama, A., Kumar, V., Gupta, A., Karypis, G.: Introduction to parallel computing. Pearson Education, London (2003)"},{"unstructured":"Gries, D., Mills, H.: Swapping sections. Cornell University, Tech. rep. (1981)","key":"3591_CR13"},{"doi-asserted-by":"crossref","unstructured":"Gu, Y., Obeya, O., Shun, J.: Parallel in-place algorithms: Theory and practice. In: Symposium on algorithmic principles of computer systems (APOCS), pp. 114\u2013128. SIAM (2021)","key":"3591_CR14","DOI":"10.1137\/1.9781611976489.9"},{"issue":"6","key":"3591_CR15","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1145\/3140587.3062354","volume":"52","author":"T Henriksen","year":"2017","unstructured":"Henriksen, T., Serup, N.G., Elsman, M., Henglein, F., Oancea, C.E.: Futhark: purely functional GPU-programming with nested parallelism and in-place array updates. ACM SIGPLAN Notices 52(6), 556\u2013571 (2017)","journal-title":"ACM SIGPLAN Notices"},{"unstructured":"Intel: intel\/parallelstl. https:\/\/github.com\/intel\/parallelstl\/blob\/master\/include\/pstl\/internal\/glue_algorithm_impl.h. https:\/\/github.com\/intel\/parallelstl\/blob\/master\/include\/pstl\/internal\/glue_algorithm_impl.h. Accessed 1 Sept 2021","key":"3591_CR16"},{"unstructured":"Intel: intel\/parallelstl. https:\/\/github.com\/intel\/parallelstl\/blob\/master\/include\/pstl\/internal\/algorithm_impl.h. https:\/\/github.com\/intel\/parallelstl\/blob\/master\/include\/pstl\/internal\/algorithm_impl.h. Accessed 1 Sept 2021","key":"3591_CR17"},{"key":"3591_CR18","doi-asserted-by":"publisher","first-page":"120261","DOI":"10.1109\/ACCESS.2021.3108404","volume":"9","author":"H Kang","year":"2021","unstructured":"Kang, H., Lee, J., Kim, D.: Hi-FFT: heterogeneous parallel in-place algorithm for large-scale 2D-FFT. IEEE Access 9, 120261\u2013120273 (2021)","journal-title":"IEEE Access"},{"key":"3591_CR19","volume-title":"Practical PRAM programming. WileyInterscience","author":"J Keller","year":"2001","unstructured":"Keller, J., Kessler, C., Tr\u00e4ff, J.: Practical PRAM programming. WileyInterscience. Wiley, Hoboken (2001)"},{"key":"3591_CR20","doi-asserted-by":"publisher","DOI":"10.2307\/2005383","volume-title":"The art of computer programming, vol. 3: sorting and searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, vol. 3: sorting and searching, vol. 28. Addison-Wesley, Boston (1973). https:\/\/doi.org\/10.2307\/2005383"},{"issue":"12","key":"3591_CR21","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1109\/TC.2018.2842050","volume":"67","author":"B Lao","year":"2018","unstructured":"Lao, B., Nong, G., Chan, W.H., Xie, J.Y.: Fast in-place suffix sorting on a multicore computer. IEEE Trans. Comput. 67(12), 1737\u20131749 (2018)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Obeya, O., Kahssay, E., Fan, E., Shun, J.: Theoretically-efficient and practical parallel in-place radix sorting. In: The 31st ACM symposium on parallelism in algorithms and architectures, pp. 213\u2013224 (2019)","key":"3591_CR22","DOI":"10.1145\/3323165.3323198"},{"issue":"7","key":"3591_CR23","doi-asserted-by":"publisher","first-page":"2049","DOI":"10.1109\/TPDS.2015.2475763","volume":"27","author":"A Salah","year":"2016","unstructured":"Salah, A., Li, K., Li, K.: Lazy-merge: a novel implementation for indexed parallel $$k$$-way in-place merging. IEEE Trans. Parallel Distrib. Syst. 27(7), 2049\u20132061 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"3591_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3391443","volume":"7","author":"A Salah","year":"2020","unstructured":"Salah, A., Li, K., Liao, Q., Hashem, M., Li, Z., Chronopoulos, A.T., Zomaya, A.Y.: A time-space efficient algorithm for parallel k-way in-place merging based on sequence partitioning and perfect shuffle. ACM Trans. Parallel Comput. (TOPC) 7(2), 1\u201323 (2020)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"key":"3591_CR25","volume-title":"MPI\u2013the complete reference: The MPI core","author":"M Snir","year":"1998","unstructured":"Snir, M., Otto, S., Huss-Lederman, S., Dongarra, J., Walker, D.: MPI\u2013the complete reference: The MPI core, vol. 1. MIT press, Cambridge (1998)"},{"issue":"1","key":"3591_CR26","first-page":"109","volume":"12","author":"V Vajnovszki","year":"2010","unstructured":"Vajnovszki, V.: Generating involutions, derangements, and relatives by eco. Discrete Math. Theor. Comput. Sci. 12(1), 109\u2013122 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"3591_CR27","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/TC.2018.2876827","volume":"68","author":"P Zhou","year":"2019","unstructured":"Zhou, P., Huang, J., Qin, X., Xie, C.: Pars: a popularity-aware redundancy scheme for in-memory stores. IEEE Trans. Comput. 68(4), 556\u2013569 (2019)","journal-title":"IEEE Trans. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03591-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03591-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03591-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T14:18:07Z","timestamp":1677507487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03591-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["3591"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03591-6","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,4,18]]},"assertion":[{"value":"2 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"M.H.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}