{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:45:35Z","timestamp":1766065535722,"version":"3.38.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1109\/tpds.2002.1011394","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"529-543","source":"Crossref","is-referenced-by-count":10,"title":["Compile time barrier synchronization minimization"],"prefix":"10.1109","volume":"13","author":[{"given":"M.","family":"O'Boyle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Stohr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41631"},{"volume-title":"Foundations of Computer Science.","year":"1995","author":"Aho","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0025875"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169732"},{"article-title":"A Compiler Strategy for SVM","volume-title":"Proc. Third Workshop Languages, Compilers, and Runtime Systems for Scalable Computing","author":"Bodin","key":"ref5"},{"article-title":"A Global Approach to Detection of Parallelism","year":"1987","author":"Callahan","key":"ref6"},{"article-title":"Compiler Optimizations for Parallel Loops with Fine-Grained Synchronization","year":"1994","author":"Chen","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176495"},{"article-title":"Compile-Time Scheduling and Optimizations for Asynchronous Machines","year":"1984","author":"Cytron","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/bf01407931"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237799"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018724631720"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/143369.143427"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/109025.109051"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009454"},{"article-title":"An Affine Transformation Algorithm to Maximize Parallelism","volume-title":"Proc. Principles of Programming Languages Conf.","author":"Lim","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/181181.181265"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2172\/5768416"},{"article-title":"Compiler Generated Synchronizations for Do Loops","volume-title":"Proc. Int\u2019l Conf. Parallel Processing","author":"Midkiff","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009499"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1117"},{"article-title":"Compiler Reduction of Synchronization in Shared Virtual Memory Systems","volume-title":"Proc. Int\u2019l Conf. Supercomputing","author":"O\u2019Boyle","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/fmpc.1995.380435"},{"key":"ref24","first-page":"76","article-title":"Synchronization Issues in Data-Parallel Languages","volume-title":"Proc. Int\u2019l Workshop Languages and Compiler for Parallel Computing","author":"Prakash"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143129"},{"key":"ref26","first-page":"385","article-title":"Implementing a Data Darallel Language on a Tightly Coupled Multiprocessors","author":"Quinn","year":"1991","journal-title":"Advances in Languages and Compilers for Parallel Processing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031650"},{"article-title":"A Graph Based Approach to Barrier Synchronization Minimization","volume-title":"Proc. Int\u2019l Conf. Supercomputing","author":"St\u00f6hr","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(97)00040-X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/77726.255155"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/181181.181261"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209952"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113449"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/52.1992"},{"volume-title":"Supercompilers for Parallel and Vector Computers.","year":"1991","author":"Zima","key":"ref35"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/71\/21798\/01011394.pdf?arnumber=1011394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:10:10Z","timestamp":1742015410000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1011394\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"URL":"https:\/\/doi.org\/10.1109\/tpds.2002.1011394","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}