{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:17:33Z","timestamp":1648617453000},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1007\/bf01407858","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T04:52:59Z","timestamp":1112503979000},"page":"241-253","source":"Crossref","is-referenced-by-count":1,"title":["Initializing memory shared by several processors"],"prefix":"10.1007","volume":"18","author":[{"given":"David","family":"Hemmendinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00288966","volume":"17","author":"J. L. W. Kessels","year":"1982","unstructured":"J. L. W. Kessels, Arbitration without Common Modifiable Variables,Acta Informatica,17:135?141 (1982).","journal-title":"Acta Informatica"},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. L. Peterson","year":"1981","unstructured":"G. L. Peterson, Myths about the Mutual Exclusion Problem,Information Processing Letters 12(3):115?116 (1981).","journal-title":"Information Processing Letters"},{"issue":"4","key":"CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01407877","volume":"15","author":"E. D. Brooks III","year":"1986","unstructured":"E. D. Brooks, III, The Butterfly Barrier,Intl. J. of Par. Prog. 15(4):295?307 (1986).","journal-title":"Intl. J. of Par. Prog."},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01379320","volume":"17","author":"D. Hensgen","year":"1988","unstructured":"D. Hensgen, R. Finkel, U. Manber, Two Algorithms for Barrier Synchronization,Intl. J. of Par. Prog.,17(1):1?17 (1988).","journal-title":"Intl. J. of Par. Prog."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"B. K. Szymanski, A Simple Solution to Lamport's Concurrent Programming Problem with Linear Wait,Proc. of the 1988 Intl.Conf. on Supercomputing, St. Malo, pp. 621?626 (1988).","DOI":"10.1145\/55364.55425"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"N. S. Arenstorf and H. F. Jordan, Comparing Barrier Algorithms, Technical Report, Computer Systems Design Group, Department of Electrical and Computer Engineering, Univerity of Colorado (1987).","DOI":"10.21236\/ADA211515"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-8191(86)90030-X","volume":"3","author":"T. S. Axelrod","year":"1986","unstructured":"T. S. Axelrod, Effects of Synchronization Barriers on Multiprocessor Performance,Parallel Computing,3:129?140 (1986).","journal-title":"Parallel Computing"},{"issue":"1","key":"CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport, A Fast Mutual Exclusion Algorithm,ACM Transactions on Computer Systems 5(1):1?11 (1987).","journal-title":"ACM Transactions on Computer Systems"},{"key":"CR9","unstructured":"R. A. Finkel, Lightweight Tasks under Unix, Department of Computer Science, University of Kentucky, TR 103-87 (1987)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407858.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01407858\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:07:03Z","timestamp":1586192823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01407858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01407858"],"URL":"https:\/\/doi.org\/10.1007\/bf01407858","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}