{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:54Z","timestamp":1740123534482,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T00:00:00Z","timestamp":1513382400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005877","name":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta","doi-asserted-by":"publisher","award":["289773"],"award-info":[{"award-number":["289773"]}],"id":[{"id":"10.13039\/501100005877","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003406","name":"Tekes","doi-asserted-by":"publisher","award":["E!5828 CELTIC+ CONVINcE"],"award-info":[{"award-number":["E!5828 CELTIC+ CONVINcE"]}],"id":[{"id":"10.13039\/501100003406","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11227-017-2199-z","type":"journal-article","created":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T01:47:59Z","timestamp":1513388879000},"page":"1911-1933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["REPLICA MBTAC: multithreaded dual-mode processor"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4865-8058","authenticated-orcid":false,"given":"Martti","family":"Forsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jussi","family":"Roivainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ville","family":"Lepp\u00e4nen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,16]]},"reference":[{"key":"2199_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad M, Hijaz F, Shi Q, Khan O (2015) Crono: a benchmark suite for multithreaded graph algorithms executing on futuristic multicores. In: Workload Characterization (IISWC), 2015 IEEE International Symposium on, pp 44\u201355","DOI":"10.1109\/IISWC.2015.11"},{"issue":"4","key":"2199_CR2","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M Dietzfelbinger","year":"1994","unstructured":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE (1994) Dynamic perfect hashing: upper and lower bounds. SIAM J Comput 23(4):738\u2013761","journal-title":"SIAM J Comput"},{"key":"2199_CR3","unstructured":"Engelmann C (1992) Simulationen von PRAM\u2019s, Master\u2019s thesis. Universitat des Saarlandes, FB Informatik"},{"issue":"4","key":"2199_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/190787.190804","volume":"22","author":"M Forsell","year":"1994","unstructured":"Forsell M (1994) Are multiport memories physically feasible? SIGARCH Comput Archit News 22(4):47\u201354","journal-title":"SIGARCH Comput Archit News"},{"issue":"5","key":"2199_CR5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/MM.2002.1044299","volume":"22","author":"M Forsell","year":"2002","unstructured":"Forsell M (2002) A scalable high-performance computing solution for networks on chips. IEEE Micro 22(5):46\u201355","journal-title":"IEEE Micro"},{"issue":"3","key":"2199_CR6","first-page":"807","volume":"3","author":"M Forsell","year":"2004","unstructured":"Forsell M (2004) E\u2014a language for thread-level parallel programming on synchronous shared memory NOCs. WSEAS Trans Comput 3(3):807\u2013812","journal-title":"WSEAS Trans Comput"},{"issue":"1","key":"2199_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.15803\/ijnc.1.1_21","volume":"1","author":"M Forsell","year":"2011","unstructured":"Forsell M (2011) A PRAM-NUMA model of computation for addressing low-TLP workloads. Int J Netw Comput 1(1):21\u201335","journal-title":"Int J Netw Comput"},{"issue":"2","key":"2199_CR8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.micpro.2010.07.003","volume":"35","author":"M Forsell","year":"2011","unstructured":"Forsell M (2011) Performance comparison of some shared memory organizations for 2D mesh-like NOCs. Microprocess Microsyst 35(2):274\u2013284","journal-title":"Microprocess Microsyst"},{"key":"2199_CR9","doi-asserted-by":"crossref","unstructured":"Forsell M, Roivainen J, Lepp\u00e4nen V (2014) Prototyping the MBTAC processor for the REPLICA CMP. In: Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, IPDPSW \u201914. IEEE Computer Society, Washington, pp 709\u2013716","DOI":"10.1109\/IPDPSW.2014.82"},{"key":"2199_CR10","volume-title":"Computer architecture: a quantitative approach","author":"J Hennessy","year":"1990","unstructured":"Hennessy J, Patterson D (1990) Computer architecture: a quantitative approach. Morgan Kaufmann Publishers Inc., Palo Alto"},{"key":"2199_CR11","unstructured":"HiPEAC (2013) The HiPEAC vision for advance computing in Horizon 2020. \n                        http:\/\/www.hipeac.net\/system\/files\/hp-roadmap-2013.pdf"},{"key":"2199_CR12","unstructured":"Intel (2006) Research at Intel From a Few Cores to Many: A Tera-scale Computing Research Overview. White Paper"},{"key":"2199_CR13","volume-title":"Introduction to parallel algorithms","author":"J Jaja","year":"1992","unstructured":"Jaja J (1992) Introduction to parallel algorithms. Addison-Wesley, Reading"},{"key":"2199_CR14","volume-title":"Practical PRAM programming","author":"J Keller","year":"2001","unstructured":"Keller J, Kessler C, Traff J (2001) Practical PRAM programming. Wiley, New York"},{"key":"2199_CR15","doi-asserted-by":"crossref","unstructured":"Krommydas K, Scogland TRW, Feng W-C (2013) On the programmability and performance of heterogeneous platforms. In: Proceedings of the 2013 International Conference on Parallel and Distributed Systems, ICPADS \u201913. IEEE Computer Society, Washington, pp 224\u2013231","DOI":"10.1109\/ICPADS.2013.41"},{"issue":"3","key":"2199_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/2.121510","volume":"25","author":"D Lenoski","year":"1992","unstructured":"Lenoski D, Laudon J, Gharachorloo K, Weber W-D, Gupta A, Hennessy J, Horowitz M, Lam MS (1992) The Stanford Dash multiprocessor. Computer 25(3):63\u201379","journal-title":"Computer"},{"key":"2199_CR17","unstructured":"Lepp\u00e4nen V (1996) Studies on the realization of PRAM. Turku Centre for Computer Science, University of Turku, Turku, Finland"},{"key":"2199_CR18","unstructured":"Merritt R (2011) Panel: Wall ahead in multicore programming (Multicore Expo). EE Times"},{"key":"2199_CR19","doi-asserted-by":"crossref","unstructured":"Park JJK, Park Y, Mahlke S (2015) Chimera: collaborative preemption for multitasking on a shared GPU. In: Proceedings of ASPLOS","DOI":"10.1145\/2694344.2694346"},{"issue":"7","key":"2199_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MSPEC.2010.5491011","volume":"47","author":"D Patterson","year":"2010","unstructured":"Patterson D (2010) The trouble with multi-core. IEEE Spectr 47(7):28\u201332","journal-title":"IEEE Spectr"},{"issue":"3","key":"2199_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"AG Ranade","year":"1991","unstructured":"Ranade AG (1991) How to emulate shared memory. J Comput Syst Sci 42(3):307\u2013326","journal-title":"J Comput Syst Sci"},{"key":"2199_CR22","unstructured":"Semiconductor\u00a0Industry Association (2015) International Technology Roadmap for Semiconductors. \n                        http:\/\/www.semiconductors.org\/main\/2015_international_technology_roadmap_for_semiconductors_itrs\/"},{"key":"2199_CR23","unstructured":"Sun Microsystems (2005) Throughput computing: changing the economics and ecology of the data center with innovative SPARC Technology. White paper"},{"key":"2199_CR24","doi-asserted-by":"crossref","unstructured":"Vishkin U (2008) Toward realizing a PRAM-on-a-chip vision. In: Proceedings of the 2007 Conference on Parallel Processing, Euro-Par\u201907. Springer, Berlin, pp 5\u20136","DOI":"10.1007\/978-3-540-78474-6_2"},{"issue":"1","key":"2199_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1866739.1866757","volume":"54","author":"U Vishkin","year":"2011","unstructured":"Vishkin U (2011) Using simple abstraction to reinvent computing for parallelism. Commun ACM 54(1):75\u201385","journal-title":"Commun ACM"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2199-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2199-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2199-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T09:54:37Z","timestamp":1524045277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2199-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,16]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2199"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2199-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2017,12,16]]}}}