{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:35:48Z","timestamp":1743104148885,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819707973"},{"type":"electronic","value":"9789819707980"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0798-0_10","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:03:04Z","timestamp":1709193784000},"page":"155-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DAS: A DRAM-Based Annealing System for\u00a0Solving Large-Scale Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Wenya","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaohua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/3282307","volume":"62","author":"JL Hennessy","year":"2019","unstructured":"Hennessy, J.L., Patterson, D.A.: A new golden age for computer architecture. Commun. ACM 62(2), 48\u201360 (2019)","journal-title":"Commun. ACM"},{"issue":"7","key":"10_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2008.209","volume":"41","author":"MD Hill","year":"2008","unstructured":"Hill, M.D., Marty, M.R.: Amdahl\u2019s law in the multicore era. Computer 41(7), 33\u201338 (2008)","journal-title":"Computer"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TC.2017.2775618","volume":"67","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Chen, S., Wang, Y.: Advancing CMOS-type Ising arithmetic unit into the domain of real-world applications. IEEE Trans. Comput. 67(5), 604\u2013616 (2017)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10_CR4","first-page":"303","volume":"51","author":"M Yamaoka","year":"2015","unstructured":"Yamaoka, M., Yoshimura, C., Hayashi, M., et al.: A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J. Solid-State Circ. 51(1), 303\u2013309 (2015)","journal-title":"IEEE J. Solid-State Circ."},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1038\/s42254-022-00440-8","volume":"4","author":"N Mohseni","year":"2022","unstructured":"Mohseni, N., McMahon, P.L., Byrnes, T.: Ising machines as hardware solvers of combinatorial optimization problems. Nat. Rev. Phys. 4(6), 363\u2013379 (2022)","journal-title":"Nat. Rev. Phys."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TC.2020.3045112","volume":"71","author":"D Oku","year":"2020","unstructured":"Oku, D., Tawada, M., Tanaka, S., et al.: How to reduce the bit-width of an Ising model by adding auxiliary spins. IEEE Trans. Comput. 71(1), 223\u2013234 (2020)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/JSSC.2019.2949230","volume":"55","author":"T Takemoto","year":"2019","unstructured":"Takemoto, T., Hayashi, M., Yoshimura, C., et al.: A 2$$\\times $$30k-spin multi-chip scalable CMOS annealing processor based on a processing-in-memory approach for solving large-scale combinatorial optimization problems. IEEE J. Solid-State Circuits 55(1), 145\u2013156 (2019)","journal-title":"IEEE J. Solid-State Circuits"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"480","DOI":"10.3390\/sym12030480","volume":"12","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Hu, X., Zhang, J., et al.: AIM: annealing in memory for vision applications. Symmetry 12(3), 480 (2020)","journal-title":"Symmetry"},{"issue":"7","key":"10_CR9","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1109\/JSSC.2021.3139901","volume":"57","author":"Y Su","year":"2022","unstructured":"Su, Y., Kim, H., Kim, B.: CIM-spin: a scalable CMOS annealing processor with digital in-memory spin operators and register spins for combinatorial optimization problems. IEEE J. Solid-State Circ. 57(7), 2263\u20132273 (2022)","journal-title":"IEEE J. Solid-State Circ."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1103\/RevModPhys.39.883","volume":"39","author":"SG Brush","year":"1967","unstructured":"Brush, S.G.: History of the Lenz-Ising model. Rev. Mod. Phys. 39(4), 883 (1967)","journal-title":"Rev. Mod. Phys."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Yoshimura, T., Shirai, T., Tawada, M., et al.: QUBO matrix distorting method for consumer applications. In: 2022 IEEE International Conference on Consumer Electronics (ICCE), pp. 01\u201306. (IEEE) (2022)","DOI":"10.1109\/ICCE53296.2022.9730763"},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., et al.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"10_CR13","series-title":"Complexity of Computer Computations","first-page":"85","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Lee, D., Kim, Y., Pekhimenko, G., et al.: Adaptive-latency DRAM: optimizing DRAM timing for the common-case. In: 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA), pp. 489\u2013501. IEEE (2015)","DOI":"10.1109\/HPCA.2015.7056057"},{"issue":"21","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1049\/el.2016.2218","volume":"52","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Chen, S., Yang, C., et al.: Double random sources: low-cost method to enhance local optima escaping ability in CMOS-type Ising chips. Electron. Lett. 52(21), 1792\u20131793 (2016)","journal-title":"Electron. Lett."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Ferreira, J.D., Falcao, G., G\u00f3mez-Luna, J., et al.: PLUTo: enabling massively parallel computation in DRAM via lookup tables. In: 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 900\u2013919. IEEE (2022)","DOI":"10.1109\/MICRO56248.2022.00067"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Seshadri, V., Kim, Y., Fallin, C., et al.: RowClone: fast and energy-efficient in-DRAM bulk da-ta copy and initialization. In: Proceedings of the 46th Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 185\u2013197 (2013)","DOI":"10.1145\/2540708.2540725"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Seshadri, V., Lee, D., Mullins, T., et al.: Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology. In: 2017 50th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pp. 273\u2013287. IEEE (2017)","DOI":"10.1145\/3123939.3124544"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/LCA.2015.2434872","volume":"14","author":"V Seshadri","year":"2015","unstructured":"Seshadri, V., Hsieh, K., Boroum, A., et al.: Fast bulk bitwise AND and OR in DRAM. IEEE Comput. Archit. Lett. 14(2), 127\u2013131 (2015)","journal-title":"IEEE Comput. Archit. Lett."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Kim, Y., Seshadri, V., Lee, D., et al.: A case for exploiting subarray-level parallelism (SALP) in DRAM. In: 2012 39th Annual International Symposium on Computer Architecture (ISCA), pp. 368\u2013379. IEEE (2012)","DOI":"10.1109\/ISCA.2012.6237032"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Chang, K.K., Nair, P.J., Lee, D., et al.: Low-cost inter-linked subarrays (LISA): enabling fast inter-subarray data movement in DRAM. In: 2016 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 568\u2013580. IEEE (2016)","DOI":"10.1109\/HPCA.2016.7446095"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Lim, K.N., Jang, W.J., Won, H.S., et al.: A 1.2 V 23nm 6F 2 4Gb DDR3 SDRAM with local-bitline sense amplifier, hybrid LIO sense amplifier and dummy-less array architecture. In: 2012 IEEE International Solid-State Circuits Conference, pp. 42\u201344. IEEE (2012)","DOI":"10.1109\/ISSCC.2012.6176870"},{"issue":"11","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1109\/4.962294","volume":"36","author":"T Takahashi","year":"2001","unstructured":"Takahashi, T., Sekiguchi, T., Takemura, R., et al.: A multigigabit DRAM technology with 6F\/sup 2\/open-bitline cell, distributed overdriven sensing, and stacked-flash fuse. IEEE J. Solid-State Circ. 36(11), 1721\u20131727 (2001)","journal-title":"IEEE J. Solid-State Circ."},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/TCSI.2019.2945617","volume":"67","author":"MF Ali","year":"2019","unstructured":"Ali, M.F., Jaiswal, A., Roy, K.: In-memory low-cost bit-serial addition using commodity DRAM technology. IEEE Trans. Circuits Syst. I Regul. Pap. 67(1), 155\u2013165 (2019)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Deng, Q., Jiang, L., Zhang, Y., et al.: DrAcc: a DRAM based accelerator for accurate CNN inference. In: Proceedings of the 55th Annual Design Automation Conference, pp. 1\u20136 (2018)","DOI":"10.1145\/3195970.3196029"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3085572","volume":"14","author":"R Balasubramonian","year":"2017","unstructured":"Balasubramonian, R., Kahng, A.B., Muralimanohar, N., et al.: CACTI 7: new tools for inter-connect exploration in innovative off-chip memories. ACM Trans. Archit. Code Optim. (TACO) 14(2), 1\u201325 (2017)","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Tkacik, T.E.: A hardware random number generator. In: International Work-shop on Cryptographic Hardware and Embedded Systems, pp. 450\u2013453 (2002)","DOI":"10.1007\/3-540-36400-5_32"},{"issue":"11","key":"10_CR28","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10_CR29","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graphcuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Zhang, P., Zhang, J., et al.: Towards high-resolution salient object detection. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 7234\u20137243 (2019)","DOI":"10.1109\/ICCV.2019.00733"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Tang, M., Gorelick, L., Veksler, O., et al.: Grabcut in one cut. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 1769\u20131776 (2013)","DOI":"10.1109\/ICCV.2013.222"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0798-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:05:33Z","timestamp":1709193933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0798-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819707973","9789819707980"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0798-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}