{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T21:01:58Z","timestamp":1720472518706},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1016\/j.future.2023.04.007","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T11:03:05Z","timestamp":1681988585000},"page":"207-221","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Load balanced locality-aware parallel SGD on multicore architectures for latent factor based collaborative filtering"],"prefix":"10.1016","volume":"146","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9364-9711","authenticated-orcid":false,"given":"Selcuk","family":"Gulcan","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6239-9622","authenticated-orcid":false,"given":"Muhammet Mustafa","family":"Ozdal","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4559-1321","authenticated-orcid":false,"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.future.2023.04.007_b1","series-title":"Advances in Neural Information Processing Systems","first-page":"2177","article-title":"Neural word embedding as implicit matrix factorization","author":"Levy","year":"2014"},{"key":"10.1016\/j.future.2023.04.007_b2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.dss.2015.03.008","article-title":"Recommender system application developments: a survey","volume":"74","author":"Lu","year":"2015","journal-title":"Decis. Support Syst."},{"issue":"12","key":"10.1016\/j.future.2023.04.007_b3","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","article-title":"Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis","volume":"23","author":"Kim","year":"2007","journal-title":"Bioinformatics"},{"key":"10.1016\/j.future.2023.04.007_b4","series-title":"Proceedings of KDD Cup and Workshop. Vol. 2007","first-page":"35","article-title":"The netflix prize","author":"Bennett","year":"2007"},{"issue":"1","key":"10.1016\/j.future.2023.04.007_b5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1080\/09332480.2010.10739787","article-title":"All together now: A perspective on the netflix prize","volume":"23","author":"Bell","year":"2010","journal-title":"Chance"},{"issue":"2","key":"10.1016\/j.future.2023.04.007_b6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1345448.1345465","article-title":"Lessons from the Netflix prize challenge","volume":"9","author":"Bell","year":"2007","journal-title":"SiGKDD Explorations"},{"issue":"6","key":"10.1016\/j.future.2023.04.007_b7","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","article-title":"Exact matrix completion via convex optimization","volume":"9","author":"Cand\u00e8s","year":"2009","journal-title":"Found. Comput. Math."},{"key":"10.1016\/j.future.2023.04.007_b8","unstructured":"P. Jain, P. Netrapalli, Fast exact matrix completion with finite samples, in: Conference on Learning Theory, 2015, pp. 1007\u20131034."},{"key":"10.1016\/j.future.2023.04.007_b9","series-title":"Slow learners are fast","author":"Langford","year":"2009"},{"key":"10.1016\/j.future.2023.04.007_b10","series-title":"Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"69","article-title":"Large-scale matrix factorization with distributed stochastic gradient descent","author":"Gemulla","year":"2011"},{"key":"10.1016\/j.future.2023.04.007_b11","series-title":"Advances in Neural Information Processing Systems","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"Recht","year":"2011"},{"key":"10.1016\/j.future.2023.04.007_b12","series-title":"Proceedings of the 7th ACM Conference on Recommender Systems","first-page":"249","article-title":"A fast parallel SGD for matrix factorization in shared memory systems","author":"Zhuang","year":"2013"},{"issue":"11","key":"10.1016\/j.future.2023.04.007_b13","doi-asserted-by":"crossref","first-page":"975","DOI":"10.14778\/2732967.2732973","article-title":"NOMAD: Non-locking, stochastic multi-machine algorithm for asynchronous and decentralized matrix completion","volume":"7","author":"Yun","year":"2014","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.future.2023.04.007_b14","series-title":"Proceedings of the 8th ACM Conference on Recommender Systems","first-page":"241","article-title":"GASGD: stochastic gradient descent for distributed asynchronous matrix completion via graph partitioning","author":"Petroni","year":"2014"},{"key":"10.1016\/j.future.2023.04.007_b15","unstructured":"H. Lakkaraju, J. McAuley, J. Leskovec, What\u2019s in a name? understanding the interplay between titles, content, and communities in social media, in: Seventh International AAAI Conference on Weblogs and Social Media, 2013."},{"key":"10.1016\/j.future.2023.04.007_b16","unstructured":"T. Bertin-Mahieux, D.P. Ellis, B. Whitman, P. Lamere, The Million Song Dataset, in: Proceedings of the 12th International Conference on Music Information Retrieval, ISMIR 2011, 2011."},{"issue":"4","key":"10.1016\/j.future.2023.04.007_b17","first-page":"1","article-title":"The movielens datasets: History and context","volume":"5","author":"Harper","year":"2015","journal-title":"Acm Trans Inter. Intell. Syst. (Tiis)"},{"key":"10.1016\/j.future.2023.04.007_b18","series-title":"Proceedings of COMPSTAT\u20192010","first-page":"177","article-title":"Large-scale machine learning with stochastic gradient descent","author":"Bottou","year":"2010"},{"issue":"3","key":"10.1016\/j.future.2023.04.007_b19","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","article-title":"Stochastic estimation of the maximum of a regression function","volume":"23","author":"Kiefer","year":"1952","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.future.2023.04.007_b20","series-title":"VTune Performance Analyzer Essentials","author":"Reinders","year":"2005"},{"issue":"3","key":"10.1016\/j.future.2023.04.007_b21","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10115-013-0718-7","article-title":"Shared-memory and shared-nothing stochastic gradient descent algorithms for matrix completion","volume":"42","author":"Makari","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.future.2023.04.007_b22","series-title":"Efficient matrix factorization on heterogeneous CPU-GPU systems","author":"Yu","year":"2020"},{"key":"10.1016\/j.future.2023.04.007_b23","article-title":"BaPa: A novel approach of improving load balance in parallel matrix factorization for recommender systems","author":"Guo","year":"2020","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.future.2023.04.007_b24","doi-asserted-by":"crossref","unstructured":"X. Xie, W. Tan, L.L. Fong, Y. Liang, CuMF_SGD: Parallelized stochastic gradient descent for matrix factorization on GPUs, in: Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing, 2017, pp. 79\u201392.","DOI":"10.1145\/3078597.3078602"},{"issue":"7","key":"10.1016\/j.future.2023.04.007_b25","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1109\/TPDS.2017.2718515","article-title":"MSGD: A novel matrix factorization approach for large-scale collaborative filtering recommender systems on GPUs","volume":"29","author":"Li","year":"2017","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.future.2023.04.007_b26","series-title":"2018 3rd International Conference on Information Systems Engineering","first-page":"118","article-title":"Parallelizing stochastic gradient descent with hardware transactional memory for matrix factorization","author":"Wu","year":"2018"},{"key":"10.1016\/j.future.2023.04.007_b27","doi-asserted-by":"crossref","unstructured":"M. Yagci, T. Aytekin, F. Gurgen, On parallelizing SGD for pairwise learning to rank in collaborative filtering recommender systems, in: Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017, pp. 37\u201341.","DOI":"10.1145\/3109859.3109906"},{"issue":"2","key":"10.1016\/j.future.2023.04.007_b28","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s12525-018-0297-2","article-title":"Fractional stochastic gradient descent for recommender systems","volume":"29","author":"Khan","year":"2019","journal-title":"Electr. Mark."},{"key":"10.1016\/j.future.2023.04.007_b29","series-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"865","article-title":"Fast and robust parallel SGD matrix factorization","author":"Oh","year":"2015"},{"key":"10.1016\/j.future.2023.04.007_b30","doi-asserted-by":"crossref","unstructured":"D. Lee, J. Oh, C. Faloutsos, B. Kim, H. Yu, Disk-based matrix completion for memory limited devices, in: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018, pp. 1093\u20131102.","DOI":"10.1145\/3269206.3271685"},{"key":"10.1016\/j.future.2023.04.007_b31","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.knosys.2012.07.016","article-title":"Applying the learning rate adaptation to the matrix factorization based collaborative filtering","volume":"37","author":"Luo","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.future.2023.04.007_b32","doi-asserted-by":"crossref","first-page":"10245","DOI":"10.1007\/s00521-019-04562-6","article-title":"Design of normalized fractional SGD computing paradigm for recommender systems","volume":"32","author":"Khan","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.future.2023.04.007_b33","first-page":"1","article-title":"MISGD: Moving-information-based stochastic gradient descent paradigm for personalized fuzzy recommender systems","author":"Khan","year":"2022","journal-title":"Int. J. Fuzzy Syst."},{"key":"10.1016\/j.future.2023.04.007_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2022.112204","article-title":"Generalized fractional strategy for recommender systems with chaotic ratings behavior","volume":"160","author":"Khan","year":"2022","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.future.2023.04.007_b35","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/j.future.2023.04.007_b36","series-title":"Parallel Stochastic Gradient Descent on Multicore Architectures","author":"Gulcan","year":"2020"},{"issue":"1","key":"10.1016\/j.future.2023.04.007_b37","first-page":"46","article-title":"OpenMP: An industry-standard API for shared-memory programming","author":"Dagum","year":"1998","journal-title":"Comput. Sci. Eng."},{"key":"10.1016\/j.future.2023.04.007_b38","series-title":"2012 IEEE 12th International Conference on Data Mining","first-page":"765","article-title":"Scalable coordinate descent approaches to parallel matrix factorization for recommender systems","author":"Yu","year":"2012"},{"issue":"1","key":"10.1016\/j.future.2023.04.007_b39","first-page":"1","article-title":"The University of Florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X23001413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X23001413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T15:45:25Z","timestamp":1711986325000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X23001413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":39,"alternative-id":["S0167739X23001413"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2023.04.007","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Load balanced locality-aware parallel SGD on multicore architectures for latent factor based collaborative filtering","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2023.04.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.FUTURE.2023.04.007', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>8</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>