{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:05:16Z","timestamp":1730221516915,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/ewdts.2019.8884385","type":"proceedings-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T11:34:05Z","timestamp":1572953645000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["A novel technique for atomic instructions functional verification using lock contention analysis"],"prefix":"10.1109","author":[{"given":"Chibisov","family":"Peter","sequence":"first","affiliation":[]},{"given":"Grevtsev","family":"Nikita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","article-title":"Characterizing active data sharing in threaded applications using shared footprint","author":"luo","year":"0","journal-title":"Proceedings of the The 11th International Workshop on Dynamic Analysis WODA &#x2018;"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898072"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.31114\/2078-7707-2019-2-12-17"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.40"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2014.7097804"},{"key":"ref12","first-page":"1","article-title":"More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms","volume":"ppopp","author":"gramoli","year":"0","journal-title":"Proceedings of 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_11"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MCSoC.2014.55"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03869-3_17"},{"journal-title":"V 2 The MIPS64&#x2122; Instruction Set Reference Manual Revision 6 04 MIPS Technologies Inc","article-title":"MIPS64&#x2122; Architecture For Programmers","year":"2015","key":"ref16"},{"key":"ref17","first-page":"201","article-title":"LIME: A Framework for Debugging Load Imbalancein Multi-threaded Execution","author":"jungju","year":"0","journal-title":"Proceedings of the 33rd International Conference on Software Engineering (ICSE)"},{"key":"ref18","first-page":"617","article-title":"Reuse Distance as a Metric for Cache Behavior","author":"beyls","year":"0","journal-title":"Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems IASTED"},{"key":"ref19","article-title":"Accord: An analytical cache contention model using reuse distances for modern multiprocessors","author":"hemani","year":"2014","journal-title":"21st Annual International Conference on High Performance Computing Student Research Symposium (HiPC SRS)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024914"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1952682.1952688"},{"journal-title":"PARSEC benchmarks Benchmarking Modern Multiprocessors Christian Bienia","year":"2011","key":"ref27"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1145\/2854038.2854039","article-title":"Cheetah: detecting false sharing efficiently and effectively","author":"liu","year":"2016","journal-title":"Proceedings of the 2016 International Symposium on Code Generation and Optimization"},{"key":"ref6","first-page":"76","article-title":"Cache Contention and Application Performance Prediction for Multi-Core Systems","author":"xu","year":"0","journal-title":"Proceedings of the 2010 IEEE International Symposium on Performance Analysis of Systems and Softwares IEEE ISPASS 2010"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.31114\/2078-7707-2019-2-25-31"},{"key":"ref5","article-title":"Locking in os kernels for smp systems","author":"starke","year":"2006","journal-title":"CiteSeer"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786815"},{"journal-title":"Predicting the Cost of Lock Contention in Parallel Applications on Multicores using Analytic Modeling - MCC12","year":"2012","author":"pan","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693489"},{"key":"ref1","article-title":"The Art of Multiprocessor Programming","author":"herlihy","year":"2012","journal-title":"Revised Reprint Elsevier"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"journal-title":"A Memo on Exploration of SPLASH-2 Input Sets PARSEC Group Princeton University","year":"2011","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2016.7482081"},{"key":"ref24","article-title":"YAMATO Putting LTP to Test - validating the Linux Kernel and test cases","author":"singh","year":"2009","journal-title":"Proceedings of the 2009 Montreal Linux Symposium"},{"journal-title":"Kernel Lock Torture Test Operation [Electronic resource]","year":"0","key":"ref23"},{"key":"ref26","first-page":"98","article-title":"Understanding PARSEC performance on contemporary CMPs","author":"major","year":"0","journal-title":"IEEE International Symposium on Workload Characterization IISWC"},{"key":"ref25","article-title":"Waiting for Locks: How Long Does It Usually Take?. In: Stoelinga M., Pinger R. (eds)Formal Methods for Industrial Critical Systems","volume":"7437","author":"baier","year":"2012","journal-title":"FMICS 2012 Lecture Notes in Computer Science"}],"event":{"name":"2019 IEEE East-West Design & Test Symposium (EWDTS)","start":{"date-parts":[[2019,9,13]]},"location":"Batumi, Georgia","end":{"date-parts":[[2019,9,16]]}},"container-title":["2019 IEEE East-West Design &amp; Test Symposium (EWDTS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8871308\/8884369\/08884385.pdf?arnumber=8884385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:25:23Z","timestamp":1658157923000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8884385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/ewdts.2019.8884385","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}