{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T22:26:31Z","timestamp":1672439191167},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0020-0190(98)00061-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"247-253","source":"Crossref","is-referenced-by-count":9,"title":["Relaxed barrier synchronization for the BSP model of computation on message-passing architectures"],"prefix":"10.1016","volume":"66","author":[{"given":"Jin-Soo","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soonhoi","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu Shik","family":"Jhon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00061-1_BIB1","article-title":"cBSP: Zero-cost synchronization in a modified BSP model","author":"Alpert","year":"1997"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB2","article-title":"Communicable memory and lazy barriers for bulk synchronous parallelism in BSPk","author":"Fahmy","year":"1996"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB3","series-title":"Proc. 8th ACM Symp. on Parallel Algorithms and Architectures","first-page":"1","article-title":"Towards efficient and portability: Programming with the BSP model","author":"Goudreau","year":"1996"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB4","article-title":"Practical barrier synchronization","author":"Hill","year":"1996"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB5","series-title":"BSPlib: The BSP programming library","author":"Hill","year":"1997-1997"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB6","series-title":"Proc. of Supercomputing","first-page":"262","article-title":"Parallel Programming in Split-C","author":"Krishnamurthy","year":"1993"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB7","series-title":"Message Passing Interface Forum, MPI-2: Extensions to the message-passing interface","year":"1997"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB8","article-title":"Questions and answers about BSP","author":"Skillicorn","year":"1996"},{"key":"10.1016\/S0020-0190(98)00061-1_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computing","volume":"33","author":"Valiant","year":"1990","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:57Z","timestamp":1556058477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0020019098000611"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00061-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}