{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:29:04Z","timestamp":1648866544871},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2015edl8088","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T18:07:46Z","timestamp":1443636466000},"page":"1847-1851","source":"Crossref","is-referenced-by-count":0,"title":["Greedy Approach Based Heuristics for Partitioning Sparse Matrices"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Jiasen","family":"HUANG","sequence":"first","affiliation":[{"name":"State-Key Laboratory of ASIC and Systems, Fudan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyan","family":"REN","sequence":"additional","affiliation":[{"name":"State-Key Laboratory of ASIC and Systems, Fudan University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"LI","sequence":"additional","affiliation":[{"name":"State-Key Laboratory of ASIC and Systems, Fudan University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Zhang, Y.H. Shalabi, R. Jain, K.K. Nagar, and J.D. Bakos, \u201cFPGA vs. GPU for Sparse Matrix Vector Multiply,\u201d Int. Conf. Field-Programmable Tech. (FPT 2009), pp.255-262, Dec. 2009.","DOI":"10.1109\/FPT.2009.5377620"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] V.E. Taylor, A. Ranade, and D.G. Messerschmitt, \u201cSPAR: a new architecture for large finite element computations,\u201d IEEE Trans. Computers, vol.44, no.4, pp.531-545, April 1995.","DOI":"10.1109\/12.376168"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Gregg, C. McSweeney, C. McElroy, F. Connor, S. McGettrick, D. Moloney, and D. Geraghty, \u201cFPGA Based Sparse Matrix Vector Multiplication using Commodity DRAM Memory,\u201d Proc. Int. Conf. Field Programmable Logic Applicat. (FPL 2007), pp.786-791, Aug. 2007.","DOI":"10.1109\/FPL.2007.4380769"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D. DuBois, A. DuBois, C. Connor, and S. Poole, \u201cSparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer,\u201d Proc. Int. Symp. Field-programmable gate array (FPGA \u201808), pp.239-247, 2008.","DOI":"10.1109\/FCCM.2008.53"},{"key":"5","unstructured":"[5] E.-J. Im and K. Yelick, \u201cOptimizing sparse matrix computations for register reuse in SPARSITY,\u201d Int. Conf. Comput. Sci. (ISSC \u201801), vol.2073, pp.127-136, Springer Berlin Heidelberg, Berlin, Heidelberg, 2001."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Buatois, G. Caumon, and B. L\u00e9vy, \u201cConcurrent number cruncher: a gpu implementation of a general sparse linear solver,\u201d Int. J. Parallel Emerg. Distrib. Syst., vol.24, no.3, pp.205-223, 2009.","DOI":"10.1080\/17445760802337010"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] N. Bell and M. Garland, \u201cImplementing sparse matrix-vector multiplication on throughput-oriented processors,\u201d Conference on High Performance Computing Networking, Storage and Analysis, 2009.","DOI":"10.1145\/1654059.1654078"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Belgin, G. Back, and C.J. Ribbens, \u201cPattern based sparse matrix representation for memory-efficient SMVM kernels,\u201d Proc. ACM Int. Conf. Supercomputing, pp.100-109, 2009.","DOI":"10.1145\/1542275.1542294"},{"key":"9","unstructured":"[9] A. Monakov, A. Lokhmotov, and A. Avetisyan, \u201cAutomatically tuning sparse matrix vector multiplication for GPU architectures,\u201d High Performance Embedded Architectures and Compilers, vol.5952, pp.111-125, Berlin, Heidelberg, 2010."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, et al., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Society for Industrial and Applied Mathematics, 2000.","DOI":"10.1137\/1.9780898719581"},{"key":"11","unstructured":"[11] E.-J. Im, \u201cOptimizing the performance of sparse matrix-vector multiplication,\u201d PhD thesis, UC Berkeley, 2000."},{"key":"12","unstructured":"[12] R.W. Vuduc, \u201cAutomatic Performance Tuning of Sparse Matrix Kernels,\u201d Ph.D. thesis, UC Berkeley, 2003."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] W. Yang, K. Li, Z. Mo, and K. Li, \u201cPerformance Optimization Using Partitioned SpMV on GPUs and Multicore CPUs,\u201d IEEE Trans. Comput., p.1, 2014.","DOI":"10.1109\/TC.2014.2366731"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] T.A. Davis and Y. Hu, \u201cThe university of Florida sparse matrix collection,\u201d ACM Trans. Math. Softw., vol.38, no.1, pp.1-25, 2011. Available: www.cise.ufl.edu\/research\/sparse\/matrices","DOI":"10.1145\/2049662.2049663"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/10\/E98.D_2015EDL8088\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T00:23:54Z","timestamp":1567211034000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/10\/E98.D_2015EDL8088\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":14,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edl8088","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}