{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T23:40:02Z","timestamp":1749771602859,"version":"3.41.0"},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016pap0006","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T22:14:27Z","timestamp":1480544067000},"page":"2860-2870","source":"Crossref","is-referenced-by-count":2,"title":["A Waiting Mechanism with Conflict Prediction on Hardware Transactional Memory"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Keisuke","family":"MASHITA","sequence":"first","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maya","family":"TABUCHI","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryohei","family":"YAMADA","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoaki","family":"TSUMURA","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Herlihy and J.E.B. Moss, \u201cTransactional Memory: Architectural Support for Lock-Free Data Structures,\u201d Proc. 20th Annual Int&apos;l Symp. on Computer Architecture (ISCA&apos;93), pp.289-300, May 1993.","DOI":"10.1145\/165123.165164"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] V. Leis, A. Kemper, and T. Neumann, \u201cExploiting Hardware Transactional Memory in Main-Memory Databases,\u201d Proc. 30th Int&apos;l Conf. on Data Engineering (ICDE&apos;2014), pp.580-591, Jan. 2014.","DOI":"10.1109\/ICDE.2014.6816683"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K. Mashita, S. Miyake, R. Yamada, and T. Tsumura, \u201cYet Another Waiting Mechanism for Hardware Transactional Memory,\u201d Proc. 3rd Int&apos;l Workshop on Computer Systems and Architectures (CSA&apos;15), pp.400-403, Dec. 2015.","DOI":"10.1109\/CANDAR.2015.57"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] K.E. Moore, J. Bobba, M.J. Moravan, M.D. Hill, and D.A. Wood, \u201cLogTM: Log-based Transactional Memory,\u201d Proc. 12th Int&apos;l Symp. on High-Performance Computer Architecture (HPCA&apos;06), pp.258-269, Feb. 2006.","DOI":"10.1109\/HPCA.2006.1598134"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] P.S. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. H\u00e5llberg, J. H\u00f6gberg, F. Larsson, A. Moestedt, and B. Werner, \u201cSimics: A Full System Simulation Platform,\u201d Computer, vol.35, no.2, pp.50-58, Feb. 2002.","DOI":"10.1109\/2.982916"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M.M.K. Martin, D.J. Sorin, B.M. Beckmann, M.R. Marty, M. Xu, A.R. Alameldeen, K.E. Moore, M.D. Hill, and D.A. Wood, \u201cMultifacet&apos;s General Execution-driven Multiprocessor Simulator (GEMS) Toolset,\u201d ACM SIGARCH Computer Architecture News, vol.33, no.4, pp.92-99, Sept. 2005.","DOI":"10.1145\/1105734.1105747"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, and A. Gupta, \u201cThe SPLASH-2 Programs: Characterization and Methodological Considerations,\u201d Proc. 22nd Annual Int&apos;l. Symp. on Computer Architecture (ISCA&apos;95), pp.24-36, 1995.","DOI":"10.1109\/ISCA.1995.524546"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] C.C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun, \u201cSTAMP: Stanford Transactional Applications for Multi-Processing,\u201d Proc. IEEE Int&apos;l Symp. on Workload Characterization (IISWC&apos;08), pp.35-46, Sept. 2008.","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] A.R. Alameldeen and D.A. Wood, \u201cVariability in Architectural Simulations of Multi-Threaded Workloads,\u201d Proc. 9th Int&apos;l Symp. on High-Performance Computer Architecture (HPCA&apos;03), pp.7-18, Feb. 2003.","DOI":"10.1109\/HPCA.2003.1183520"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.E.B. Moss and A.L. Hosking, \u201cNested Transactional Memory: Model and Preliminary Architecture Sketches,\u201d Science of Computer Programming, vol.63, no.2, pp.186-201, 2006.","DOI":"10.1016\/j.scico.2006.05.010"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M.J. Moravan, J. Bobba, K.E. Moore, L. Yen, M.D. Hill, B. Liblit, M.M. Swift, and D.A. Wood, \u201cSupporting Nested Transactional Memory in LogTM,\u201d Proc. 12th Int&apos;l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp.359-370, Oct. 2006.","DOI":"10.1145\/1168857.1168902"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. McDonald, J. Chung, B.D. Caristrom, C.C. Minh, H. Chafi, C. Kozyrakis, and K. Olukotun, \u201cArchitectural Semantics for Practical Transactional Memory,\u201d Proc. 33rd Annual Int&apos;l Symp. on Computer Architecture (ISCA&apos;06), pp.53-65, 2006.","DOI":"10.1109\/ISCA.2006.9"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] A. Shriraman, S. Dwarkadas, and M.L. Scott, \u201cFlexible Decoupled Transactional Memory Support,\u201d Proc. 35th Annual Int&apos;l Symp. on Computer Architecture (ISCA&apos;08), vol.36, no.3, pp.139-150, 2008.","DOI":"10.1109\/ISCA.2008.17"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] S. Tomi\u0107, C. Perfumo, C. Kulkarni, A. Armejach, A. Cristal, O. Unsal, T. Harris, and M. Valero, \u201cEazyhtm, Eager-lazy Hardware Transactional Memory,\u201d Proc. 42nd Annual IEEE\/ACM Int&apos;l Symp. on Microarchitecture (MICRO-42), pp.145-155, 2009.","DOI":"10.1145\/1669112.1669132"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Lupon, G. Magklis, and A. Gonz\u00e1lez, \u201cA Dynamically Adaptable Hardware Transactional Memory,\u201d Proc. 43rd Annual IEEE\/ACM Int&apos;l Symp. on Microarchitecture (MICRO-43), pp.27-38, 2010.","DOI":"10.1109\/MICRO.2010.23"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] R.M. Yoo and H.-H.S. Lee, \u201cAdaptive Transaction Scheduling for Transactional Memory Systems,\u201d Proc. 20th Annual Symp. on Parallelism in Algorithms and Architectures (SPAA&apos;08), pp.169-178, June 2008.","DOI":"10.1145\/1378533.1378564"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] G. Blake, R.G. Dreslinski, and T. Mudge, \u201cBloom Filter Guided Transaction Scheduling,\u201d Proc. 17th Int&apos;l Conf. on High-Performance Computer Architecture (HPCA-17), pp.75-86, 2011.","DOI":"10.1109\/HPCA.2011.5749718"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Armejach, A. Negi, A. Cristal, O. Unsal, P. Stenstrom, and T. Harris, \u201cHarp: Adaptive abort recurrence prediction for hardware transactional memory,\u201d Proc. 20th Int&apos;l Conf. on High Performance Computing (HiPC&apos;13), pp.196-205, Dec. 2013.","DOI":"10.1109\/HiPC.2013.6799100"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] S. Tomi\u0107, E. Akpinar, A. Crist\u00e1l, O. Unsal, and M. Valero, \u201cA Comprehensive Study of Conflict Resolution Policies in Hardware Transactional Memory,\u201d Proc. 6th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT&apos;11), vol.18, pp.270-279, 2013.","DOI":"10.1016\/j.procs.2013.05.190"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Bobba, K.E. Moore, H. Volos, L. Yen, M.D. Hill, M.M. Swift, and D.A. Wood, \u201cPerformance Pathologies in Hardware Transactional Memory,\u201d Proc. 34th Annual Int&apos;l Symp. on Computer Architecture (ISCA&apos;07), pp.81-91, 2007.","DOI":"10.1145\/1250662.1250674"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/12\/E99.D_2016PAP0006\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T23:24:47Z","timestamp":1749770687000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/12\/E99.D_2016PAP0006\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016pap0006","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2016]]}}}