{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:27:10Z","timestamp":1756312030625,"version":"3.28.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Henan Province Key Scien tific and Technological Projects","award":["222102210072"],"award-info":[{"award-number":["222102210072"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"crossref","award":["2021M700885"],"award-info":[{"award-number":["2021M700885"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972133"],"award-info":[{"award-number":["61972133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Project of Leading Talents in Science and Technology Innovation for Thou- sands of People Plan in Henan Province","award":["204200510021"],"award-info":[{"award-number":["204200510021"]}]},{"name":"The Key Research and Development Plan Special Project of Henan Province","award":["241111211400"],"award-info":[{"award-number":["241111211400"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As an auto-parallelization technique with the level of thread on multi-core, Thread-Level Speculation (TLS) which is also called Speculative Multithreading (SpMT), partitions programs into multiple threads and speculatively executes them under conditions of ambiguous data and control dependence. Thread partitioning approach plays a key role to the performance enhancement in TLS. The existing heuristic rules-based approach (HR-based approach) which is an one-size-fits-all strategy, can not guarantee to achieve the satisfied thread partitioning. In this paper, an importance<jats:underline>d<\/jats:underline>egree b<jats:underline>a<\/jats:underline>sed<jats:underline>t<\/jats:underline>hread<jats:underline>p<\/jats:underline>artitioning<jats:underline>a<\/jats:underline>pproach (IDaTPA) is proposed to realize the partition of irregular programs into multithreads. IDaTPA implements biasing partitioning for every procedure with a machine learning method. It mainly includes: constructing sample set, expression of knowledge, calculation of similarity, prediction model and the partition of the irregular programs is performed by the prediction model. Using IDaTPA, the subprocedures in unseen irregular programs can obtain their satisfied partition. On a generic SpMT processor (called Prophet) to perform the performance evaluation for multithreaded programs, the IDaTPA is evaluated and averagely delivers a speedup of 1.80 upon a 4-core processor. Furthermore, in order to obtain the portability evaluation of IDaTPA, we port IDaTPA to 8-core processor and obtain a speedup of 2.82 on average. Experiment results show that IDaTPA obtains a significant speedup increasement and Olden benchmarks respectively deliver a 5.75% performance improvement on 4-core and a 6.32% performance improvement on 8-core, and SPEC2020 benchmarks obtain a 38.20% performance improvement than the conventional HR-based approach.<\/jats:p>","DOI":"10.1007\/s10791-024-09440-x","type":"journal-article","created":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T13:04:42Z","timestamp":1718802282000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["IDaTPA: importance degree based thread partitioning approach in thread level speculation"],"prefix":"10.1007","volume":"27","author":[{"given":"Li","family":"Yuxiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Zhiyong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Xinyong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huang","family":"Shuaina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su","family":"Yaning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,19]]},"reference":[{"issue":"9","key":"9440_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.3390\/sym9090180","volume":"9","author":"Y Li","year":"2017","unstructured":"Li Y, Zhao Y, Liu B. Qinling: a parametric model in speculative multithreading. Symmetry. 2017;9(9):180.","journal-title":"Symmetry"},{"issue":"2","key":"9440_CR2","first-page":"22","volume":"49","author":"A Estebanez","year":"2016","unstructured":"Estebanez A, Llanos DR, Gonzalez-Escribano A. A survey on thread-level speculation techniques. ACM Comput Surv (CSUR). 2016;49(2):22.","journal-title":"ACM Comput Surv (CSUR)"},{"key":"9440_CR3","doi-asserted-by":"publisher","unstructured":"Wang Y, Watling R, Qiu J, Wang Z. Gspecpal: speculation-centric finite state machine parallelization on gpus. In: 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS); 2022. p. 481\u201391. https:\/\/doi.org\/10.1109\/IPDPS53621.2022.00053.","DOI":"10.1109\/IPDPS53621.2022.00053"},{"key":"9440_CR4","doi-asserted-by":"publisher","unstructured":"Wang Y, Watling R, Qiu J, Wang Z. Gspecpal: speculation-centric finite state machine parallelization on gpus. In: 2022 IEEE 36th international parallel and distributed processing symposium (IPDPS 2022). International Parallel and Distributed Processing Symposium IPDPS; 2022. p. 481\u201391. https:\/\/doi.org\/10.1109\/IPDPS53621.2022.00053. IEEE; IEEE Comp Soc. 36th IEEE International Parallel and Distributed Processing Symposium (IEEE IPDPS), ELECTR NETWORK, May 30-Jun 03, 2022.","DOI":"10.1109\/IPDPS53621.2022.00053"},{"issue":"2","key":"9440_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1145\/225830.224451","volume":"23","author":"M Franklin","year":"1995","unstructured":"Franklin M. Multiscalar processors. Acm Sigarch Comput Arch News. 1995;23(2):414\u201325.","journal-title":"Acm Sigarch Comput Arch News"},{"issue":"3","key":"9440_CR6","first-page":"732","volume":"9","author":"Y Luo","year":"2012","unstructured":"Luo Y, Zhai A. Dynamically dispatching speculative threads to improve sequential execution. Acm Trans Arch Code Optim. 2012;9(3):732\u201341.","journal-title":"Acm Trans Arch Code Optim"},{"issue":"2","key":"9440_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jpdc.2009.05.002","volume":"70","author":"X-H Sun","year":"2010","unstructured":"Sun X-H, Chen Y. Reevaluating Amdahl\u2019s law in the multicore era. J Parallel Distrib Comput. 2010;70(2):183\u20138.","journal-title":"J Parallel Distrib Comput"},{"key":"9440_CR8","doi-asserted-by":"crossref","unstructured":"Vijaykumar T, Sohi GS. Task selection for a multiscalar processor. In: Proceedings of the 31st Annual ACM\/IEEE International Symposium on Microarchitecture, IEEE Computer Society Press; 1998. p. 81\u201392.","DOI":"10.1109\/MICRO.1998.742771"},{"issue":"5","key":"9440_CR9","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/TC.2012.41","volume":"62","author":"L Gao","year":"2013","unstructured":"Gao L, Li L, Xue J, Yew P-C. Seed: a statically greedy and dynamically adaptive approach for speculative loop execution. IEEE Trans Comput. 2013;62(5):1004\u201316.","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9440_CR10","first-page":"19","volume":"9","author":"M Sharafeddine","year":"2012","unstructured":"Sharafeddine M, Jothi K, Akkary H. Disjoint out-of-order execution processor. ACM Trans Arch Code Optim. 2012;9(3):19.","journal-title":"ACM Trans Arch Code Optim"},{"key":"9440_CR11","doi-asserted-by":"crossref","unstructured":"August DI, Huang J, Beard SR, Johnson NP, Jablin TB. Automatically exploiting cross-invocation parallelism using runtime information. In: Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). IEEE Computer Society; 2013. p. 1\u201311.","DOI":"10.1109\/CGO.2013.6495001"},{"issue":"2","key":"9440_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/40.848474","volume":"20","author":"L Hammond","year":"2000","unstructured":"Hammond L, Hubbert BA, Siu M, Prabhu MK, Chen M, Olukolun K. The stanford hydra cmp. IEEE Micro. 2000;20(2):71\u201384.","journal-title":"IEEE Micro"},{"key":"9440_CR13","doi-asserted-by":"crossref","unstructured":"Ohsawa T, Takagi M, Kawahara S, Matsushita S. Pinot: speculative multi-threading processor architecture exploiting parallelism over a wide range of granularities. In: Proceedings of the 38th Annual IEEE\/ACM International Symposium on Microarchitecture. IEEE Computer Society; 2005. p. 81\u201392.","DOI":"10.1109\/MICRO.2005.26"},{"key":"9440_CR14","doi-asserted-by":"crossref","unstructured":"Liu W, Tuck J, Ceze L, Ahn W, Strauss K, Renau J, Torrellas J. Posh: a tls compiler that exploits program structure. In: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM; 2006. p. 158\u201367.","DOI":"10.1145\/1122971.1122997"},{"issue":"7","key":"9440_CR15","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/TPDS.2007.70797","volume":"19","author":"C Madriles","year":"2008","unstructured":"Madriles C, Garc\u00eda-Qui\u00f1ones C, S\u00e1nchez J, Marcuello P, Gonz\u00e1lez A, Tullsen DM, Wang H, Shen JP. Mitosis: a speculative multithreaded processor based on precomputation slices. IEEE Trans Parallel Distrib Syst. 2008;19(7):914\u201325.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"02","key":"9440_CR16","doi-asserted-by":"publisher","first-page":"1240008","DOI":"10.1142\/S0218126612400087","volume":"21","author":"S Wang","year":"2012","unstructured":"Wang S, Yew P-C, Zhai A. Code transformations for enhancing the performance of speculatively parallel threads. J Cir Syst Comput. 2012;21(02):1240008.","journal-title":"J Cir Syst Comput"},{"key":"9440_CR17","unstructured":"Zhai A, Colohan CB, Steffan JG, Mowry TC. Compiler optimization of memory-resident value communication between speculative threads. In: Proceedings of the International Symposium on Code Generation and Optimization: feedback-directed and Runtime Optimization. IEEE Computer Society; 2004. p. 39."},{"key":"9440_CR18","doi-asserted-by":"crossref","unstructured":"Zheng B, Tsai J-Y, Zang B, Chen T, Huang B, Li J, Ding Y, Liang J, Zhen Y, Yew P-C, et\u00a0al. Designing the agassiz compiler for concurrent multithreaded architectures. In: International Workshop on Languages and Compilers for Parallel Computing. Springer; 1999. p. 380\u2013398.","DOI":"10.1007\/3-540-44905-1_24"},{"key":"9440_CR19","doi-asserted-by":"crossref","unstructured":"Johnson TA, Eigenmann R, Vijaykumar T. Min-cut program decomposition for thread-level speculation. In: ACM Sigplan Notices, vol. 39. ACM; 2004. p. 59\u201370.","DOI":"10.1145\/996893.996851"},{"issue":"9","key":"9440_CR20","first-page":"72","volume":"30","author":"G Sohi","year":"1997","unstructured":"Sohi G. Multiscalar: another fourth-generation processor. Computer. 1997;30(9):72\u201372.","journal-title":"Computer"},{"key":"9440_CR21","doi-asserted-by":"crossref","unstructured":"Bhowmik A, Franklin M. A general compiler framework for speculative multithreading. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures. ACM; 2002. p. 99\u2013108.","DOI":"10.1145\/564870.564885"},{"key":"9440_CR22","doi-asserted-by":"crossref","unstructured":"Chen M, Olukotun K. Test: a tracer for extracting speculative threads. In: Code Generation and Optimization, 2003. CGO 2003. International Symposium On. IEEE; 2003. p. 301\u2013312.","DOI":"10.1109\/CGO.2003.1191554"},{"issue":"2","key":"9440_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/40.848474","volume":"20","author":"L Hammond","year":"2000","unstructured":"Hammond L, Hubbert BA, Siu M, Prabhu MK. The stanford hydra cmp. IEEE Micro. 2000;20(2):71\u201384.","journal-title":"IEEE Micro"},{"issue":"3","key":"9440_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1082469.1082471","volume":"23","author":"JG Steffan","year":"2005","unstructured":"Steffan JG, Colohan C, Zhai A, Mowry TC. The stampede approach to thread-level speculation. ACM Trans Comput Syst. 2005;23(3):253\u2013300.","journal-title":"ACM Trans Comput Syst"},{"key":"9440_CR25","doi-asserted-by":"crossref","unstructured":"Qui\u00f1ones CG, Madriles C, S\u00e1nchez J, Marcuello P, Gonz\u00e1lez A, Tullsen DM. Mitosis compiler: an infrastructure for speculative threading based on pre-computation slices. In: ACM Sigplan Notices, vol. 40. ACM; 2005. p. 269\u2013279.","DOI":"10.1145\/1064978.1065043"},{"key":"9440_CR26","doi-asserted-by":"crossref","unstructured":"Chen Z, Zhao Y-L, Pan X-Y, Dong Z-Y, Gao B, Zhong Z-W. An overview of prophet. In: International Conference on Algorithms and Architectures for Parallel Processing. Springer; 2009. p. 396\u2013407.","DOI":"10.1007\/978-3-642-03095-6_38"},{"issue":"10","key":"9440_CR27","first-page":"13","volume":"44","author":"S Song","year":"2010","unstructured":"Song S, Zhao Y, Feng B, Wei Y, Wang X, Zhao H. Prophet+: an extended multicore simulator for speculative multithreading. J Xian Jiaotong Univ. 2010;44(10):13\u20135.","journal-title":"J Xian Jiaotong Univ"},{"key":"9440_CR28","doi-asserted-by":"crossref","unstructured":"Dong Z, Zhao Y, Wei Y, Wang X, Song S. Prophet: a speculative multi-threading execution model with architectural support based on cmp. In: Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009. SCALCOM-EMBEDDEDCOM\u201909. International Conference On. IEEE; 2009. p. 103\u2013108.","DOI":"10.1109\/EmbeddedCom-ScalCom.2009.128"},{"issue":"9","key":"9440_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-017-2000-3","volume":"73","author":"Z Wang","year":"2017","unstructured":"Wang Z, Zhao Y, Liu Y, Chen Z, Lv C, Li Y. A speculative parallel decompression algorithm on apache spark. J Supercomput. 2017;73(9):1\u201330.","journal-title":"J Supercomput"},{"key":"9440_CR30","doi-asserted-by":"publisher","first-page":"4429","DOI":"10.1002\/cpe.4429","volume":"1","author":"Z Wang","year":"2018","unstructured":"Wang Z, Zhao Y, Liu Y, Lv C. A speculative parallel simulated annealing algorithm based on apache spark. Concurr Comput Pract Exp. 2018;1:4429.","journal-title":"Concurr Comput Pract Exp."},{"issue":"6","key":"9440_CR31","first-page":"1053","volume":"11","author":"Y Li","year":"2017","unstructured":"Li Y, Zhao Y, Sun L, Shen M. Optimizing partition thresholds in speculative multithreading. Icic Express Lett. 2017;11(6):1053\u201361.","journal-title":"Icic Express Lett"},{"key":"9440_CR32","doi-asserted-by":"crossref","unstructured":"Li Y, Zhao Y, Shi J. A hybrid samples generation approach in speculative multithreading. In: High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), 2016 IEEE 18th International Conference On. IEEE; 2016. p. 35\u201341.","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0016"},{"issue":"3","key":"9440_CR33","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s11227-013-1000-1","volume":"67","author":"B Liu","year":"2014","unstructured":"Liu B, Zhao Y, Li Y, Sun Y, Feng B. A thread partitioning approach for speculative multithreading. J Supercomput. 2014;67(3):778\u2013805.","journal-title":"J Supercomput"},{"key":"9440_CR34","doi-asserted-by":"crossref","unstructured":"Liu B, Zhao Y, Li M, Liu Y, Feng B. A virtual sample generation approach for speculative multithreading using feature sets and abstract syntax trees. In: 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies. IEEE; 2012. p. 39\u201344.","DOI":"10.1109\/PDCAT.2012.33"},{"issue":"1","key":"9440_CR35","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ejor.2005.05.005","volume":"175","author":"D-C Li","year":"2006","unstructured":"Li D-C, Lin Y-S. Using virtual sample generation to build up management knowledge in the early manufacturing stages. Eur J Oper Res. 2006;175(1):413\u201334.","journal-title":"Eur J Oper Res"},{"issue":"21","key":"9440_CR36","doi-asserted-by":"publisher","first-page":"4294","DOI":"10.1002\/cpe.4294","volume":"29","author":"Y Li","year":"2017","unstructured":"Li Y, Zhao Y, Wu Q. Gba:a graph-based thread partition approach in speculative multithreading. Concurr Comput Pract Exp. 2017;29(21):4294.","journal-title":"Concurr Comput Pract Exp"},{"key":"9440_CR37","doi-asserted-by":"crossref","unstructured":"Grewe D, Wang Z, O\u2019Boyle MF. A workload-aware mapping approach for data-parallel programs. In: Proceedings of the 6th International Conference on High Performance and Embedded Architectures and Compilers. ACM; 2011. p. 117\u201326.","DOI":"10.1145\/1944862.1944881"},{"key":"9440_CR38","doi-asserted-by":"crossref","unstructured":"Long S, Fursin G, Franke B. A cost-aware parallel workload allocation approach based on machine learning techniques. In: IFIP International Conference on Network and Parallel Computing. Springer; 2007. p. 506\u2013515.","DOI":"10.1007\/978-3-540-74784-0_51"},{"issue":"6","key":"9440_CR39","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/1543135.1542496","volume":"44","author":"G Tournavitis","year":"2009","unstructured":"Tournavitis G, Wang Z, Franke B, O\u2019Boyle MF. Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping. ACM Sigplan Notices. 2009;44(6):177\u201387.","journal-title":"ACM Sigplan Notices"},{"key":"9440_CR40","doi-asserted-by":"crossref","unstructured":"Wang Z, O\u2019Boyle MFP. Mapping parallelism to multi-cores: a machine learning based approach. In: ACM Sigplan Symposium on Principles and Practice of Parallel Programming, PPOPP 2009, Raleigh, Nc, Usa, February; 2009. p. 75\u201384.","DOI":"10.1145\/1594835.1504189"},{"key":"9440_CR41","doi-asserted-by":"crossref","unstructured":"Chen X, Long S. Adaptive multi-versioning for openmp parallelization via machine learning. In: Parallel and Distributed Systems (ICPADS), 2009 15th International Conference On. IEEE; 2009. p. 907\u2013912.","DOI":"10.1109\/ICPADS.2009.77"},{"key":"9440_CR42","doi-asserted-by":"crossref","unstructured":"Wang Z, O\u2019Boyle MF. Partitioning streaming parallelism for multi-cores: a machine learning based approach. In: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques. ACM; 2010. p. 307\u2013318.","DOI":"10.1145\/1854273.1854313"},{"key":"9440_CR43","unstructured":"Singer J, Yiapanis P, Pocock A, Lujan M, Brown G, Ioannou N, Cintra M. Static java program features for intelligent squash prediction. Statistical and Machine learning approaches to ARchitecture and compilaTion (SMART 10). 2010;14."},{"issue":"9","key":"9440_CR44","first-page":"4407","volume":"34","author":"M Xupeng","year":"2023","unstructured":"Xupeng M, Yujie W, Jia S, Yuxia S, Bin C. Acceleration of graph neural network training for multiple gpus. J Softw. 2023;34(9):4407\u201320.","journal-title":"J Softw"},{"key":"9440_CR45","doi-asserted-by":"crossref","unstructured":"Sarkar V, Hennessy J. Partitioning parallel programs for macro-dataflow. In: Proceedings of the 1986 ACM Conference on LISP and Functional Programming. ACM; 1986. p. 202\u201311.","DOI":"10.1145\/319838.319863"},{"key":"9440_CR46","first-page":"41","volume":"2016","author":"S Shinmura","year":"2016","unstructured":"Shinmura S. The 100-fold cross validation for small sample method. Data Anal. 2016;2016:41.","journal-title":"Data Anal"},{"key":"9440_CR47","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/978-3-540-39964-3_62","volume":"2888","author":"G Guo","year":"2003","unstructured":"Guo G, Wang H, Bell D, Bi Y, Greer K. Knn model-based approach in classification. Lect Notes Comput Sci. 2003;2888:986\u201396.","journal-title":"Lect Notes Comput Sci"},{"key":"9440_CR48","first-page":"1","volume":"3","author":"Y Li","year":"2017","unstructured":"Li Y, Zhao Y, Sun L, Shen M. A hybrid sample generation approach in speculative multithreading. J Supercomput. 2017;3:1\u201333.","journal-title":"J Supercomput"},{"key":"9440_CR49","doi-asserted-by":"crossref","unstructured":"Monsifrot A, Bodin F, Quiniou R. A machine learning approach to automatic production of compiler heuristics. In: International Conference on Artificial Intelligence: Methodology, Systems, and Applications. Springer; 2002. p. 41\u201350.","DOI":"10.1007\/3-540-46148-5_5"},{"key":"9440_CR50","unstructured":"Olden B. benchmark suite v; 2010."},{"key":"9440_CR51","doi-asserted-by":"crossref","unstructured":"Prabhu MK, Olukotun K. Exposing speculative thread parallelism in spec2000. In: Proceedings of the Tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM; 2005. p. 142\u2013152.","DOI":"10.1145\/1065944.1065964"},{"key":"9440_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-31317-7_2","volume-title":"Contributions in mathematics and engineering","author":"DR Anderson","year":"2016","unstructured":"Anderson DR. Taylor\u2019s formula and integral inequalities for conformable fractional derivatives. In: Contributions in mathematics and engineering. Berlin: Springer; 2016. p. 25\u201343."},{"key":"9440_CR53","doi-asserted-by":"crossref","unstructured":"De\u00a0Cuypere E, De\u00a0Turck K, Wittevrongel S, Fiems D. A maclaurin-series expansion approach to coupled queues with phase-type distributed service times. In: Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools. ACM; 2016.","DOI":"10.4108\/eai.25-10-2016.2266864"},{"key":"9440_CR54","unstructured":"Mullin MD, Sukthankar R. Complete cross-validation for nearest neighbor classifiers. In: ICML; 2000. p. 639\u201346."},{"issue":"12","key":"9440_CR55","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/193209.193217","volume":"29","author":"RP Wilson","year":"1994","unstructured":"Wilson RP, French RS, Wilson CS, Amarasinghe SP, Anderson JM, Tjiang SW, Liao S-W, Tseng C-W, Hall MW, Lam MS, et al. Suif: an infrastructure for research on parallelizing and optimizing compilers. ACM Sigplan Notices. 1994;29(12):31\u20137.","journal-title":"ACM Sigplan Notices"},{"issue":"2","key":"9440_CR56","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/201059.201065","volume":"17","author":"A Rogers","year":"1995","unstructured":"Rogers A, Carlisle MC, Reppy JH, Hendren LJ. Supporting dynamic data structures on distributed-memory machines. ACM Trans Program Lang Syst (TOPLAS). 1995;17(2):233\u201363.","journal-title":"ACM Trans Program Lang Syst (TOPLAS)"},{"key":"9440_CR57","unstructured":"Yuxiang L, Yinliang Z, Huan G. Thread partition prediction model based on artificial neural network; 2017."}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09440-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-024-09440-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09440-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T06:48:53Z","timestamp":1732258133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-024-09440-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,19]]},"references-count":57,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["9440"],"URL":"https:\/\/doi.org\/10.1007\/s10791-024-09440-x","relation":{},"ISSN":["2948-2992"],"issn-type":[{"type":"electronic","value":"2948-2992"}],"subject":[],"published":{"date-parts":[[2024,6,19]]},"assertion":[{"value":"16 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":3,"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 they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}