{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T21:54:23Z","timestamp":1722117263954},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7383","type":"journal-article","created":{"date-parts":[[2017,4,30]],"date-time":"2017-04-30T18:14:38Z","timestamp":1493576078000},"page":"1003-1015","source":"Crossref","is-referenced-by-count":13,"title":["A High Performance FPGA-Based Sorting Accelerator with a Data Compression Mechanism"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Ryohei","family":"KOBAYASHI","sequence":"first","affiliation":[{"name":"University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenji","family":"KISE","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H. Inoue and K. Taura, \u201cSimd- and cache-friendly algorithm for sorting an array of structures,\u201d Proc. VLDB Endow., vol.8, no.11, pp.1274-1285, July 2015.","DOI":"10.14778\/2809974.2809988"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Cho, D. Brand, R. Bordawekar, U. Finkler, V. Kulandaisamy, and R. Puri, \u201cParadis: An efficient parallel algorithm for in-place radix sort,\u201d Proc. VLDB Endow., vol.8, no.12, pp.1518-1529, Aug. 2015.","DOI":"10.14778\/2824032.2824050"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] O. Polychroniou and K.A. Ross, \u201cA comprehensive study of main-memory partitioning and its application to large-scale comparison- and radix-sort,\u201d Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD '14, New York, NY, USA, pp.755-766, ACM, 2014.","DOI":"10.1145\/2588555.2610522"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] B. Chandramouli and J. Goldstein, \u201cPatience is a virtue: Revisiting merge and sort on modern processors,\u201d Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD '14, New York, NY, USA, pp.731-742, ACM, 2014.","DOI":"10.1145\/2588555.2593662"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] H. Sundar, D. Malhotra, and G. Biros, \u201cHyksort: A new variant of hypercube quicksort on distributed memory architectures,\u201d Proceedings of the 27th International ACM Conference on International Conference on Supercomputing, ICS '13, New York, NY, USA, pp.293-302, ACM, 2013.","DOI":"10.1145\/2464996.2465442"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C. Balkesen, G. Alonso, J. Teubner, and M.T. \u00d6zsu, \u201cMulti-core, main-memory joins: Sort vs. hash revisited,\u201d Proc. VLDB Endow., vol.7, no.1, pp.85-96, Sept. 2013.","DOI":"10.14778\/2732219.2732227"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] C. Kim, J. Park, N. Satish, H. Lee, P. Dubey, and J. Chhugani, \u201cCloudramsort: Fast and efficient large-scale distributed ram sort on shared-nothing cluster,\u201d Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12, New York, NY, USA, pp.841-850, ACM, 2012.","DOI":"10.1145\/2213836.2213965"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] N. Satish, C. Kim, J. Chhugani, A.D. Nguyen, V.W. Lee, D. Kim, and P. Dubey, \u201cFast sort on cpus and gpus: A case for bandwidth oblivious simd sort,\u201d Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD '10, New York, NY, USA, pp.351-362, ACM, 2010.","DOI":"10.1145\/1807167.1807207"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] R. Kobayashi and K. Kise, \u201cFace: Fast and customizable sorting accelerator for heterogeneous many-core systems,\u201d Embedded Multicore\/Manycore SoCs (MCSoc), 2015 IEEE 9th International Symposium on, pp.49-56, Sept 2015.","DOI":"10.1109\/MCSoC.2015.40"},{"key":"10","unstructured":"[10] \u201cFACE.\u201d https:\/\/github.com\/monotone-RK\/FACE"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] G. Pekhimenko, V. Seshadri, O. Mutlu, P.B. Gibbons, M.A. Kozuch, and T.C. Mowry, \u201cBase-delta-immediate compression: Practical data compression for on-chip caches,\u201d Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques, PACT '12, New York, NY, USA, pp.377-388, ACM, 2012.","DOI":"10.1145\/2370816.2370870"},{"key":"12","unstructured":"[12] D.E. Knuth, The Art of Computer Programming, Volume 3: (2nd Ed.) Sorting and Searching, Addison Wesley Longman Publishing, Redwood City, CA, USA, 1998."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R. Mueller, J. Teubner, and G. Alonso, \u201cSorting networks on fpgas,\u201d The VLDB Journal, vol.21, no.1, pp.1-23, Feb. 2012.","DOI":"10.1007\/s00778-011-0232-z"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] V. Sklyarov and I. Skliarova, \u201cHigh-performance implementation of regular and easily scalable sorting networks on an fpga,\u201d Microprocess. Microsyst., vol.38, no.5, pp.470-484, July 2014.","DOI":"10.1016\/j.micpro.2014.03.003"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] R. Chen, S. Siriyal, and V. Prasanna, \u201cEnergy and memory efficient mapping of bitonic sorting on fpga,\u201d Proceedings of the 2015 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA '15, New York, NY, USA, pp.240-249, ACM, 2015.","DOI":"10.1145\/2684746.2689068"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] K.E. Batcher, \u201cSorting networks and their applications,\u201d Proceedings of the April 30-May 2, 1968, Spring Joint Computer Conference, AFIPS '68 (Spring), New York, NY, USA, pp.307-314, ACM, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] D. Koch and J. Torresen, \u201cFpgasort: A high performance sorting architecture exploiting run-time reconfiguration on fpgas for large problem sorting,\u201d Proceedings of the 19th ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA '11, New York, NY, USA, pp.45-54, ACM, 2011.","DOI":"10.1145\/1950413.1950427"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J. Casper and K. Olukotun, \u201cHardware acceleration of database operations,\u201d Proceedings of the 2014 ACM\/SIGDA International Symposium on Field-programmable Gate Arrays, FPGA '14, New York, NY, USA, pp.151-160, ACM, 2014.","DOI":"10.1145\/2554688.2554787"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] T. Usui, R. Kobayashi, and K. Kise, \u201cA challenge of portable and high-speed fpga accelerator,\u201d Applied Reconfigurable Computing, ed. K. Sano, D. Soudris, M. H\u00fcbner, and P.C. Diniz, Lecture Notes in Computer Science, vol.9040, pp.383-392, Springer International Publishing, 2015.","DOI":"10.1007\/978-3-319-16214-0_34"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Ziv and A. Lempel, \u201cA universal algorithm for sequential data compression,\u201d Information Theory, IEEE Transactions on, vol.23, no.3, pp.337-343, May 1977.","DOI":"10.1109\/TIT.1977.1055714"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] D. Huffman, \u201cA method for the construction of minimum-redundancy codes,\u201d Proceedings of the IRE, vol.40, no.9, pp.1098-1101, Sept. 1952.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] P. Deutsch, \u201cDeflate compressed data format specification version 1.3,\u201d 1996.","DOI":"10.17487\/rfc1951"},{"key":"23","unstructured":"[23] \u201cXilinx Virtex-7 FPGA VC707 Evaluation Kit.\u201d http:\/\/www.xilinx.com\/products\/boards-and-kits\/ek-v7-vc707-g.html"},{"key":"24","unstructured":"[24] \u201cMemory Interface Generator (MIG).\u201d http:\/\/www.xilinx.com\/products\/intellectual-property\/mig.html"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] M. Jacobsen, D. Richmond, M. Hogains, and R. Kastner, \u201cRiffa 2.1: A reusable integration framework for fpga accelerators,\u201d ACM Trans. Reconfigurable Technol. Syst., vol.8, no.4, pp.22:1-22:23, Sept. 2015.","DOI":"10.1145\/2815631"},{"key":"26","unstructured":"[26] \u201cVivado Design Suite.\u201d http:\/\/www.xilinx.com\/products\/design-tools\/vivado.html"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] G. Marsaglia, \u201cXorshift rngs,\u201d Journal of Statistical Software, vol.8, no.14, pp.1-6, 2003.","DOI":"10.18637\/jss.v008.i14"},{"key":"28","unstructured":"[28] \u201cNexys4 DDR Artix-7 FPGA Board.\u201d https:\/\/www.digilentinc.com\/."},{"key":"29","unstructured":"[29] \u201cXilinx Kintex-7 FPGA KC705 Evaluation Kit.\u201d http:\/\/www.xilinx.com\/products\/boards-and-kits\/ek-k7-kc705-g.html"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M. Zuluaga, P. Milder, and M. P\u00fcschel, \u201cComputer generation of streaming sorting networks,\u201d Proceedings of the 49th Annual Design Automation Conference, DAC '12, New York, NY, USA, pp.1245-1253, ACM, 2012.","DOI":"10.1145\/2228360.2228588"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7383\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T11:44:19Z","timestamp":1569152659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/5\/E100.D_2016EDP7383\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7383","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}