{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:31:36Z","timestamp":1699835496884},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":10891,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1977,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Since E. W. Dijkstra's work on the mutual interdependencies of co\u2010operating sequential processes there has been much discussion on various synchronizing mechanisms. This discussion usually leads to abstract definitions of synchronizing primitives. However, their realization proceeds differently in various environments. Length of critical regions, number of processors, and dispatching strategy have to be taken into account. In this paper is presented a family of synchronizing operations, the members of which are all based on the same fundamentals. They have been designed with the concept of structured programming in mind.<\/jats:p>","DOI":"10.1002\/spe.4380070107","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:34:01Z","timestamp":1163766841000},"page":"115-126","source":"Crossref","is-referenced-by-count":9,"title":["The implementation of synchronizing operations in various environments"],"prefix":"10.1002","volume":"7","author":[{"given":"H.","family":"Wettstein","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"43","volume-title":"Programming Languages","author":"Dijkstra E. W.","year":"1968"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288684"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/362759.362813"},{"key":"e_1_2_1_5_2","volume-title":"Towards a theory of parallel programming","author":"Hoare C. A. R.","year":"1971"},{"key":"e_1_2_1_6_2","volume-title":"Operating System Principles","author":"Brinch Hansen P.","year":"1973"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289519"},{"key":"e_1_2_1_8_2","unstructured":"J. H.Saltzer \u2018Traffic control in a multiplexed computer system\u2019 MAC\u2010TR\u201030 Mass. Inst. of Techn. 1966."},{"key":"e_1_2_1_9_2","first-page":"8","article-title":"Eine Familie von Warteoperationen in Betriebssystemen","volume":"17","author":"Wettstein H.","year":"1975","journal-title":"Elektron. Rechenanlagen"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380070107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380070107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:14:17Z","timestamp":1699780457000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380070107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,1]]}},"alternative-id":["10.1002\/spe.4380070107"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380070107","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,1]]}}}