{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:31:24Z","timestamp":1767990684744,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:00:00Z","timestamp":1528761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,12]]},"DOI":"10.1145\/3205289.3205315","type":"proceedings-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T12:54:52Z","timestamp":1536843292000},"page":"374-384","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["On Optimizing Distributed Tucker Decomposition for Sparse Tensors"],"prefix":"10.1145","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[{"name":"IBM Research"}]},{"given":"Jee W.","family":"Choi","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Douglas J.","family":"Joseph","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Prakash","family":"Murali","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Shivmaran S.","family":"Pandian","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[{"name":"IBM Research"}]},{"given":"Dheeraj","family":"Sreedhar","sequence":"additional","affiliation":[{"name":"IBM Research"}]}],"member":"320","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"W. Austin G. Ballard and T. Kolda. 2016. Parallel tensor compression for large-scale scientific data. In IPDPS.  W. Austin G. Ballard and T. Kolda. 2016. Parallel tensor compression for large-scale scientific data. In IPDPS.","DOI":"10.1109\/IPDPS.2016.67"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Baskaran B. Meister N. Vasilache and R. Lethin. 2012. Efficient and scalable computations with sparse tensors. In HPEC.  M. Baskaran B. Meister N. Vasilache and R. Lethin. 2012. Efficient and scalable computations with sparse tensors. In HPEC.","DOI":"10.1109\/HPEC.2012.6408676"},{"key":"e_1_3_2_1_4_1","unstructured":"E. Boman K. Devine L. Fisk R. Heaphy B. Hendrickson V. Leung C. Vaughan U. Catalyurek D. Bozdag and W. Mitchell. 1999. Zoltan home page. (1999). http:\/\/www.cs.sandia.gov\/Zoltan.  E. Boman K. Devine L. Fisk R. Heaphy B. Hendrickson V. Leung C. Vaughan U. Catalyurek D. Bozdag and W. Mitchell. 1999. Zoltan home page. (1999). http:\/\/www.cs.sandia.gov\/Zoltan."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"V. Chakaravarthy J. Choi D. Joseph X. Liu P. Murali Y. Sabharwal and D. Sreedhar. 2017. On optimizing distributed Tucker decomposition for dense tensors. In IPDPS.  V. Chakaravarthy J. Choi D. Joseph X. Liu P. Murali Y. Sabharwal and D. Sreedhar. 2017. On optimizing distributed Tucker decomposition for dense tensors. In IPDPS.","DOI":"10.1109\/IPDPS.2017.86"},{"key":"e_1_3_2_1_7_1","unstructured":"J. Choi and S. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Advances in Neural Information Processing Systems.   J. Choi and S. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_8_1","volume-title":"Foundations of the PARAFAC procedure: Models and conditions for an \"explanatory\" multimodal factor analysis. UCLA Working Papers in Phonetics","author":"Harshman R.","year":"1970","unstructured":"R. Harshman . 1970. Foundations of the PARAFAC procedure: Models and conditions for an \"explanatory\" multimodal factor analysis. UCLA Working Papers in Phonetics ( 1970 ). R. Harshman. 1970. Foundations of the PARAFAC procedure: Models and conditions for an \"explanatory\" multimodal factor analysis. UCLA Working Papers in Phonetics (1970)."},{"key":"e_1_3_2_1_9_1","unstructured":"V. Hernandez J. Roman A. Tomas and V. Vidal. 2007. Restarted Lanczos bidiagonalization for the SVD in SLEPc. STR-8 Tech. Rep. (2007).  V. Hernandez J. Roman A. Tomas and V. Vidal. 2007. Restarted Lanczos bidiagonalization for the SVD in SLEPc. STR-8 Tech. Rep. (2007)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/140901.140918"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"I. Jeon E. Papalexakis U. Kang and C. Faloutsos. 2015. HaTen2: Billion-scale tensor decompositions. In ICDE.  I. Jeon E. Papalexakis U. Kang and C. Faloutsos. 2015. HaTen2: Billion-scale tensor decompositions. In ICDE.","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.10.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807624"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"O. Kaya and B. U\u00e7ar. 2016. High performance parallel algorithms for the Tucker decomposition of sparse tensors. In ICPP.  O. Kaya and B. U\u00e7ar. 2016. High performance parallel algorithms for the Tucker decomposition of sparse tensors. In ICPP.","DOI":"10.1109\/ICPP.2016.19"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807624"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.144"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2004.11.029"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.78"},{"key":"e_1_3_2_1_24_1","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith S.","year":"2017","unstructured":"S. Smith , J. Choi , J. Li , R. Vuduc , J. Park , X. Liu , and G. Karypis . 2017 . FROSTT: The Formidable Repository of Open Sparse Tensors and Tools . http:\/\/frostt.io\/. (2017). S. Smith, J. Choi, J. Li, R. Vuduc, J. Park, X. Liu, and G. Karypis. 2017. FROSTT: The Formidable Repository of Open Sparse Tensors and Tools. http:\/\/frostt.io\/. (2017)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"S. Smith and G. Karypis. 2016. A medium-grained algorithm for sparse tensor factorization. In IPDPS.  S. Smith and G. Karypis. 2016. A medium-grained algorithm for sparse tensor factorization. In IPDPS.","DOI":"10.1109\/IPDPS.2016.113"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"S. Smith and G. Karypis. 2017. Accelerating the Tucker Decomposition with Compressed Sparse Tensors. In EuroPar.  S. Smith and G. Karypis. 2017. Accelerating the Tucker Decomposition with Compressed Sparse Tensors. In EuroPar.","DOI":"10.1007\/978-3-319-64203-1_47"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"S. Smith J. Park and G. Karypis. 2017. Sparse tensor factorization on many-Core processors with high-bandwidth memory. In IPDPS.  S. Smith J. Park and G. Karypis. 2017. Sparse tensor factorization on many-Core processors with high-bandwidth memory. In IPDPS.","DOI":"10.1109\/IPDPS.2017.84"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_3_2_1_29_1","volume-title":"Approximation Algorithms","author":"Vazirani V.","unstructured":"V. Vazirani . 2001. Approximation Algorithms . Springer-Verlag . V. Vazirani. 2001. Approximation Algorithms. Springer-Verlag."},{"key":"e_1_3_2_1_30_1","unstructured":"G. Zhou A. Cichocki and S. Xie. 2015. Decomposition of big tensors With low multilinear rank. CoRR arXiv:1412.1885 (2015).  G. Zhou A. Cichocki and S. Xie. 2015. Decomposition of big tensors With low multilinear rank. CoRR arXiv:1412.1885 (2015)."}],"event":{"name":"ICS '18: 2018 International Conference on Supercomputing","location":"Beijing China","acronym":"ICS '18","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 2018 International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205289.3205315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205289.3205315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:55Z","timestamp":1750208935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205289.3205315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,12]]},"references-count":30,"alternative-id":["10.1145\/3205289.3205315","10.1145\/3205289"],"URL":"https:\/\/doi.org\/10.1145\/3205289.3205315","relation":{},"subject":[],"published":{"date-parts":[[2018,6,12]]},"assertion":[{"value":"2018-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}