{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:46:43Z","timestamp":1743004003398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030656201"},{"type":"electronic","value":"9783030656218"}],"license":[{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-65621-8_10","type":"book-chapter","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T12:32:07Z","timestamp":1607689927000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Memory Optimized Dynamic Matrix Chain Multiplication Using Shared Memory in GPU"],"prefix":"10.1007","author":[{"given":"Girish","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nandini","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,12]]},"reference":[{"key":"10_CR1","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2012","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press and PHI, New Delhi (2012)","edition":"3"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Nishida, K., Ito, Y., Nakano, K.: Accelerating the dynamic programming for the matrix chain product on the GPU. In: Second International Conference on Networking and Computing, pp. 320\u2013326 (2011)","DOI":"10.1109\/ICNC.2011.62"},{"key":"10_CR3","unstructured":"NVIDIA, CUDA C Programming Guide Version 4.2 (2012). https:\/\/developer.download.nvidia.com\/compute\/DevZone\/docs\/html\/C\/doc\/CUDA_C_Programming_Guide.pdf. Accessed 22 Jun 2020"},{"key":"10_CR4","unstructured":"Wani, M.A., Quadri, S.M.K.: Accelerated dynamic programming on gpu: a study of speed up and programming approach. In: Int. J. Comput. Appl., 0975\u20138887 (2013)"},{"key":"10_CR5","unstructured":"NVIDIA, CUDA ZONE. https:\/\/developer.nvidia.com\/cuda-zone. Accessed 12 Jul 2020"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Fauzia, N., Pouchet, L.N., Sadayappan, P.: Characterizing and enhancing global memory data coalescing on GPUs. In: IEEE\/ACM International Symposium on Code Generation and Optimization (2015)","DOI":"10.1109\/CGO.2015.7054183"},{"key":"10_CR7","unstructured":"Whitepaper NVIDIA\u2019s Next Generation CUDATM Compute Architecture: FermiTM. https:\/\/www.nvidia.com\/content\/PDF\/fermi_white_papers\/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf. Accessed 15 Jul 2020"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ito, Y., Nakano, K.: A GPU implementation of dynamic programming for the optimal polygon triangulation. IEICE Trans. Inf. Syst., D(12), 2596\u20132603 (2013)","DOI":"10.1587\/transinf.E96.D.2596"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Pimple, M.R., Sathe, S.R.: Analysis of resource utilization on GPU. Int. J. Adv. Comput. Sci. Appl., 10(2) (2019)","DOI":"10.14569\/IJACSA.2019.0100238"},{"key":"10_CR10","unstructured":"Bergeron, J.P.: Programming of shared memory GPUs shared memory systems, University of Ottawa (2011)"},{"key":"10_CR11","unstructured":"NVIDIA, DEVELOPER ZONE. https:\/\/docs.nvidia.com\/cuda\/cuda-c-best-practices-guide\/index.html#shared-memory. Accessed 26 Jul 2020"},{"key":"10_CR12","unstructured":"NVIDIA, Shared memory bank conflicts with byte arrays. https:\/\/forums.developer.nvidia.com\/t\/shared-memory-bank-conflicts-with-byte-arrays\/20553\/4. Accessed 26 Jul 2020"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65621-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:23:41Z","timestamp":1607991821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65621-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,12]]},"ISBN":["9783030656201","9783030656218"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65621-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020,12,12]]},"assertion":[{"value":"12 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/17th-icdcit-2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","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":"13","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":"4","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":"13% - 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":"2.5","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}