{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T10:37:59Z","timestamp":1772620679212,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2020,5,1]]},"DOI":"10.1109\/tc.2019.2954139","type":"journal-article","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T20:58:29Z","timestamp":1574197109000},"page":"621-632","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Model-Based Scheduling in Software Transactional Memory"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6136-6303","authenticated-orcid":false,"given":"Pierangelo","family":"Di Sanzo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0179-9868","authenticated-orcid":false,"given":"Alessandro","family":"Pellegrini","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Sannicandro","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Ciciani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5616-7980","authenticated-orcid":false,"given":"Francesco","family":"Quaglia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582725"},{"key":"ref11","first-page":"125","article-title":"Car-stm: scheduling-based collision avoidance and resolution for software transactional memory","author":"dolev","year":"2008","journal-title":"Proc ACM Symp Principles Distributed Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92990-1_3"},{"key":"ref13","first-page":"1","article-title":"Relstm: A proactive transactional memory scheduley","author":"sainz","year":"2013","journal-title":"Proc 8th ACM SIGPLAN Workshop Trans Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-012-0205-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.11.001"},{"key":"ref16","article-title":"Predicting the scalability of an STM: A pragmatic approach","author":"dragojevi?","year":"2010","journal-title":"Proc 5th ACM Workshop on Transactional Computing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2011.05.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2010.39"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2010.29"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2010.39"},{"key":"ref4","article-title":"Advanced concurrency control for transactional memory","author":"ansari","year":"0","journal-title":"1st Workshop Programmability MultiCore Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153733"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2740285"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.99"},{"key":"ref29","article-title":"Stamp need not be considered harmful","author":"ruan","year":"2014","journal-title":"Proc 9th ACM Workshop Transactional Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40148-0_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2316\/P.2011.719-011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345241"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.06.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85451-7_77"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378564"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02205-0_24"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2014.24"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2014.118"},{"key":"ref26","volume":"i","author":"kleinrock","year":"1975","journal-title":"Queueing Systems"},{"key":"ref25","year":"2012"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9058928\/08906078.pdf?arnumber=8906078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:16:13Z","timestamp":1651068973000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8906078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,1]]},"references-count":29,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.2019.2954139","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,1]]}}}