{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:43Z","timestamp":1740123523559,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:00:00Z","timestamp":1622592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11227-021-03904-3","type":"journal-article","created":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T14:23:30Z","timestamp":1622643810000},"page":"945-961","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms"],"prefix":"10.1007","volume":"78","author":[{"given":"Robert","family":"Ritchie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3301-0232","authenticated-orcid":false,"given":"Khodakhast","family":"Bibak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,2]]},"reference":[{"key":"3904_CR1","doi-asserted-by":"publisher","DOI":"10.1201\/9781003047179","volume-title":"Restricted Congruences in Computing","author":"K Bibak","year":"2020","unstructured":"Bibak K (2020) Restricted Congruences in Computing. CRC Press, USA"},{"issue":"7","key":"3904_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ipl.2016.03.009","volume":"116","author":"K Bibak","year":"2016","unstructured":"Bibak K, Kapron BM, Srinivasan V (2016) MMH$$^*$$ with arbitrary modulus is always almost-universal. Inf Process Lett 116(7):481\u2013483","journal-title":"Inf Process Lett"},{"issue":"03","key":"3904_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054118500089","volume":"29","author":"K Bibak","year":"2018","unstructured":"Bibak K, Kapron BM, Srinivasan V, T\u00f3th L (2018) On an almost-universal hash function family with applications to authentication and secrecy codes. Int J Found Comput Sci 29(03):357\u2013375","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"3904_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"Carter JL, Wegman MN (1979) Universal classes of hash functions. J Comput Syst Sci 18(2):143\u2013154","journal-title":"J Comput Syst Sci"},{"key":"3904_CR5","unstructured":"Cicirello VA (2018) Impact of random number generation on parallel genetic algorithms. In The Thirty-First International Flairs Conference"},{"key":"3904_CR6","unstructured":"Contini S, Rivest RL, Robshaw MJB, and Yin YL (1998) The security of the RC6 block cipher. https:\/\/people.csail.mit.edu\/rivest\/ContiniRivestRobshawYin-TheSecurityOfTheRC6BlockCipher.pdf"},{"key":"3904_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"SA Cook","year":"1969","unstructured":"Cook SA, Aanderaa SO (1969) On the minimum computation time of functions. Trans Am Math Soc 142:291\u2013314","journal-title":"Trans Am Math Soc"},{"key":"3904_CR8","doi-asserted-by":"crossref","unstructured":"Etzel M, Patel S, Ramzan Z (1999) Square hash: fast message authentication via optimized universal hash functions. In: Wiener Michael (ed) Advances in Cryptology - CRYPTO\u2019 99. Lecture Notes in Computer Science. Springer, Berlin Heidelberg, pp 234\u2013251","DOI":"10.1007\/3-540-48405-1_15"},{"key":"3904_CR9","doi-asserted-by":"crossref","unstructured":"Halevi S, Krawczyk H (1997) MMH: Software message authentication in the gbit\/second rates. In: Biham E (ed) Fast Software Encryption. Lecture Notes in Computer Science. Springer, Berlin Heidelberg, pp 172\u2013189","DOI":"10.1007\/BFb0052345"},{"issue":"2","key":"3904_CR10","first-page":"293","volume":"145","author":"A Karatsuba","year":"1962","unstructured":"Karatsuba A, Ofman YP (1962) Multiplication of many-digital numbers by automatic computers. Dokl. Akad. Nauk SSSR 145(2):293\u2013294","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"3904_CR11","unstructured":"Knuth DE (1997) The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 3rd ed. Addison-Wesley"},{"issue":"5","key":"3904_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/00029890.1913.11997943","volume":"20","author":"DN Lehmer","year":"1913","unstructured":"Lehmer DN (1913) Certain theorems in the theory of quadratic residues. Am Math Mon 20(5):151\u2013157","journal-title":"Am Math Mon"},{"key":"3904_CR13","unstructured":"Leiserson CE, chardl TB, and Lee IA (2018) Cilk hub, https:\/\/cilk.mit.edu"},{"key":"3904_CR14","doi-asserted-by":"crossref","unstructured":"Leiserson CE, Schardl TB, and Sukha J (2012) Deterministic parallel random-number generation for dynamic-multithreading platforms. In Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP \u201912, pages 193\u2013204","DOI":"10.1145\/2145816.2145841"},{"key":"3904_CR15","unstructured":"Oracle. Class SplittableRandom. https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/SplittableRandom.html"},{"key":"3904_CR16","unstructured":"Paar C (2015) Implementation of Cryptographic Schemes. Ruhr University Bochum"},{"key":"3904_CR17","unstructured":"Rivest RL, Robshaw MJB, Sidney R, and Yin YL (1998) The RC6 block cipher. https:\/\/people.csail.mit.edu\/rivest\/pubs\/RRSY98.pdf"},{"key":"3904_CR18","unstructured":"Schardl TB (2016) Performance engineering of multicore software: developing a science of fast code for the post-Moore era. PhD thesis, Massachusetts Institute of Technology"},{"key":"3904_CR19","doi-asserted-by":"crossref","unstructured":"Schardl TB, Lee IA, and Leiserson CE (2018) Brief announcement: open cilk. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA \u201918, pages 351\u2013353","DOI":"10.1145\/3210377.3210658"},{"key":"3904_CR20","doi-asserted-by":"crossref","unstructured":"Schardl TB, Moses WS, and Leiserson CE (2019) Tapir: Embedding recursive fork-join parallelism into llvm\u2019s intermediate representation. ACM Transactions on Parallel Computing, 6(4):19:1\u201319:33","DOI":"10.1145\/3365655"},{"issue":"3","key":"3904_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage A, Strassen V (1971) Schnelle Multiplikation gro\u00dfer Zahlen. Computing 7(3):281\u2013292","journal-title":"Computing"},{"key":"3904_CR22","doi-asserted-by":"crossref","unstructured":"Steele GL, Jr., Lea D, and Flood CH (2014) Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA \u201914, pages 453\u2013472, New York, NY, USA","DOI":"10.1145\/2660193.2660195"},{"key":"3904_CR23","first-page":"714","volume":"3","author":"AL Toom","year":"1963","unstructured":"Toom AL (1963) The complexity of a scheme of functional elements realizing the multiplication of integers. Sov Math Doklady 3:714\u2013716","journal-title":"Sov Math Doklady"},{"key":"3904_CR24","doi-asserted-by":"publisher","unstructured":"Utterback R, Agrawal K, Lee IA, and Kulkarni M (2017) Processor-Oblivious record and replay. In Proceedings of the 22Nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP \u201917, pages 145\u2013161, New York, NY, USA, 2017. Austin, Texas, USA. https:\/\/doi.org\/10.1145\/3018743.3018764","DOI":"10.1145\/3018743.3018764"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03904-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03904-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03904-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T12:21:24Z","timestamp":1641298884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03904-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["3904"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03904-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,6,2]]},"assertion":[{"value":"19 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}