{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:21:35Z","timestamp":1742383295757},"reference-count":20,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0167-8191(03)00062-0","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T08:37:35Z","timestamp":1056184655000},"page":"953-968","source":"Crossref","is-referenced-by-count":3,"title":["Distributed-sum termination detection supporting multithreaded execution"],"prefix":"10.1016","volume":"29","author":[{"given":"Y.","family":"Tseng","sequence":"first","affiliation":[]},{"given":"R.F.","family":"DeMara","sequence":"additional","affiliation":[]},{"given":"P.J.","family":"Wilder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0167-8191(03)00062-0_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(89)90212-3","article-title":"Global quiescence detection based on credit distribution and discovery","volume":"30","author":"Mattern","year":"1989","journal-title":"Information Processing Letters"},{"issue":"14","key":"10.1016\/S0167-8191(03)00062-0_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01407877","article-title":"The butterfly barrier","volume":"15","author":"Brooks","year":"1986","journal-title":"International Journal of Parallel Programming"},{"issue":"1","key":"10.1016\/S0167-8191(03)00062-0_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01379320","article-title":"Two algorithms for barrier synchronization","volume":"17","author":"Hensgen","year":"1988","journal-title":"International Journal of Parallel Programming"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-8191(89)90050-1","article-title":"Comparing barrier algorithms","volume":"12","author":"Arenstorf","year":"1989","journal-title":"Parallel Computing"},{"issue":"3","key":"10.1016\/S0167-8191(03)00062-0_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0743-7315(90)90099-B","article-title":"A message-optimal algorithm for distributed termination detection","volume":"8","author":"Chandrasekaran","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB6","doi-asserted-by":"crossref","unstructured":"T.H. Lai, Y.C. Tseng, X. Dong, A more efficient message-optimal algorithm for distributed termination detection, Technical Research Report, OSU-CISRC-1\/92-TR-2, Ohio State University, 1992. A brief version was published in Proceedings of Sixth International Parallel Processing Symposium, IEEE CS Press, March 1992, pp. 646\u2013649","DOI":"10.1109\/IPPS.1992.222991"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1006\/jpdc.1993.1036","article-title":"A simultaneous access design for idle processor reactivation and the detection of the termination of a parallel activity","volume":"17","author":"Cheng","year":"1993","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB8","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0743-7315(92)90031-H","article-title":"Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers","volume":"15","author":"Xu","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"10.1016\/S0167-8191(03)00062-0_BIB9","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/71.689440","article-title":"Designing tree-based barrier synchronization on 2D mesh networks","volume":"9","author":"Yang","year":"1998","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"10.1016\/S0167-8191(03)00062-0_BIB10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","article-title":"The performance of spin lock alternatives for shared-memory multiprocessor","volume":"1","author":"Anderson","year":"1990","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB11","doi-asserted-by":"crossref","unstructured":"R. DeMara, B. Motlagh, C. Lin, S. Kuo, Barrier synchronization techniques for distributed process creation, in: 8th International Parallel Processing Symposium Proceedings April 1994, pp. 597\u2013603","DOI":"10.1109\/IPPS.1994.288243"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB12","unstructured":"A.B. Sinha L.V. Kale, A dynamic and adaptive quiescence detection algorithm, Department of Computer Science, University of Illinois, Urbana, IL, 1991"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB13","unstructured":"K. Ghose, D.-C. Cheng, Efficient synchronization schemes for large-scale shared-memory multiprocessors, in: Proceedings of the 1991 International Conference on Parallel Processing, 1991, pp. 153\u2013158"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB14","doi-asserted-by":"crossref","unstructured":"H.G. Dietz, R. Hoare, T. Mattox, A fine-grain parallel architecture based on barrier synchronization, in: Proceedings of the International Conference on Parallel Processing, August 1996, pp. 247\u2013250","DOI":"10.1109\/ICPP.1996.539061"},{"issue":"6","key":"10.1016\/S0167-8191(03)00062-0_BIB15","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/71.388040","article-title":"Distributed hardwired barrier synchronization for scalable multiprocessor clusters","volume":"6","author":"Shang","year":"1995","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB16","unstructured":"K. Hwang, S. Shang, Wired-NOR barrier synchronization for designing large shared-memory multiprocessors, in: Proceedings of the 1991 International Conference on Parallel Processing, 1991, pp. 171\u2013175"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB17","doi-asserted-by":"crossref","unstructured":"C.J. Beckmann, C.D. Polychronopoulos, Fast barrier synchronization hardware, CSRD Report No. 986, University of Illinois, Urbana-Champaign, November 1990","DOI":"10.1109\/SUPERC.1990.130019"},{"issue":"5","key":"10.1016\/S0167-8191(03)00062-0_BIB18","article-title":"An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems","volume":"8","author":"Leung","year":"1997","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"10.1016\/S0167-8191(03)00062-0_BIB19","article-title":"The range barrier synchronization mechanism on a bus-based multiprocessor","volume":"38","author":"Higashi","year":"2001","journal-title":"IPSJ Journal"},{"key":"10.1016\/S0167-8191(03)00062-0_BIB20","unstructured":"Y. Tseng, R.F. DeMara, Event-based methodology for performance analysis of termination detection schemes, in: 2002 International Conference on Parallel and Distributed Systems, Taiwan, ROC, December 17\u201320, 2002"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T10:28:56Z","timestamp":1552991336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0167819103000620"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00062-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}