{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:54:34Z","timestamp":1775300074387,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050566","type":"print"},{"value":"9783030050573","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05057-3_46","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:52:26Z","timestamp":1544125946000},"page":"618-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conflict-Free Block-with-Stride Access of 2D Storage Structure"],"prefix":"10.1007","author":[{"given":"Rui","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhao","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Chen, S., Postula, A., Jozwiak, L.: Synthesis of XOR storage schemes with different cost for minimization of memory contention. In: 1999 Proceedings of the Euromicro Conference, vol. 1, pp. 170\u2013177. IEEE (1999)","DOI":"10.1109\/EURMIC.1999.794463"},{"key":"46_CR2","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-0-387-35311-1_18","volume-title":"VLSI: Integrated Systems on Silicon","author":"RW Hartenstein","year":"1997","unstructured":"Hartenstein, R.W., Becker, J., Herz, M., Nageldinger, U.: An embedded accelerator for real world computing. In: Reis, R., Claesen, L. (eds.) VLSI: Integrated Systems on Silicon. ITIFIP, pp. 215\u2013226. Springer, Boston (1997). https:\/\/doi.org\/10.1007\/978-0-387-35311-1_18"},{"key":"46_CR3","first-page":"1674","volume":"87-D(7)","author":"E Aho","year":"2004","unstructured":"Aho, E., Vanne, J., Kuusilinna, K., et al.: Address computation in configurable parallel memory architecture. IEICE Trans. Inf. Syst. 87-D(7), 1674\u20131681 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"46_CR4","volume-title":"Signal Processing and Communications","author":"Jarmo Takala","year":"2003","unstructured":"Takala, J., Jarvinen, T.: Stride permutation access in interleaved memory systems (2003)"},{"issue":"12","key":"46_CR5","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1109\/T-C.1971.223171","volume":"20","author":"P Budnik","year":"1971","unstructured":"Budnik, P., Kuck, D.J.: The organization and use of parallel memories. IEEE Trans. Comput. 20(12), 1566\u20131569 (1971)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"46_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/71.914779","volume":"12","author":"JW Park","year":"2002","unstructured":"Park, J.W.: An efficient buffer memory system for subarray access. IEEE Trans. Parallel Distrib. Syst. 12(3), 316\u2013335 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"46_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TC.2004.1268401","volume":"53","author":"JW Park","year":"2004","unstructured":"Park, J.W.: Multiaccess memory system for attached SIMD computer. IEEE Trans. Comput. 53(4), 439\u2013452 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"46_CR8","unstructured":"Park, J.W.: Conflict-free memory system and method of address calculation and data routing by using the same. US 6845423 B2[P], US (2005)"},{"issue":"9","key":"46_CR9","doi-asserted-by":"publisher","first-page":"2490","DOI":"10.1109\/TITS.2016.2519904","volume":"17","author":"Y Hong","year":"2016","unstructured":"Hong, Y., Choi, B., Lee, K., et al.: Conflict management considering a smooth transition of aircraft into adjacent airspace. IEEE Trans. Intell. Transp. Syst. 17(9), 2490\u20132501 (2016)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Liu, C., Yan, X., Qin, X.: An optimized linear skewing interleave scheme for on-chip multi-access memory systems. In: ACM Great Lakes Symposium on VLSI, pp. 8\u201313. ACM (2007)","DOI":"10.1145\/1228784.1228793"},{"issue":"6","key":"46_CR11","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1587\/elex.9.602","volume":"9","author":"S Liu","year":"2012","unstructured":"Liu, S., Chen, S., Chen, H., et al.: A novel parallel memory organization supporting multiple access types with matched memory modules. IEICE Electron Express 9(6), 602\u2013608 (2012)","journal-title":"IEICE Electron Express"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05057-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:57:25Z","timestamp":1775296645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05057-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050566","9783030050573"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05057-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Guangzhou","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}