{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T13:12:16Z","timestamp":1698066736578},"reference-count":22,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":7211,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1987,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The suitability of Concurrent Euclid, Ada and Modula for a special form of asynchronous concurrency, called master\/slave concurrency, is investigated. No language is ideal, with Concurrent Euclid and Modula having major drawbacks. The conclusion lists the features desirable in a language for master\/slave concurrency.<\/jats:p>","DOI":"10.1002\/spe.4380170204","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T02:07:52Z","timestamp":1163815672000},"page":"117-134","source":"Crossref","is-referenced-by-count":2,"title":["The suitability for master\/slave concurrency of concurrent euclid, ada and modula"],"prefix":"10.1002","volume":"17","author":[{"given":"Gregory","family":"Butler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathhew J.","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/358568.358586"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676280"},{"key":"e_1_2_1_4_2","unstructured":"C.Lam J. W.Atwood S.Cabilio B. C.Desai P.GrogonoandJ.Opartney \u2018A multiprocessor project for combinatorial computing\u2019 Proceedings of Session 82 of Canadian Information Processing Society 325\u2013329(1982)."},{"key":"e_1_2_1_5_2","unstructured":"J. W.AtwoodandS.Cabilio \u2018Application\u2010specific vs general\u2010purpose languages for distributed microprocessor systems\u2019 Department of Computer Science Concordia University Montreal in preparation."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234170"},{"key":"e_1_2_1_7_2","first-page":"17","article-title":"A comparison of the concurrency constructs and module facilities of CHILL and Ada","volume":"15","author":"Fidge C. J.","year":"1983","journal-title":"Australian Comp. Journal"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100802"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.234781"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Robert E.StromandShaulaYemini \u2018NIL: an integrated language and system for distributed programming\u2019 Proc. SIGPLAN '83 Synp on Programming Language Issues in Software Systems San Francisco California June1983 pp.73\u201382.","DOI":"10.1145\/800226.806853"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380120804"},{"key":"e_1_2_1_13_2","unstructured":"J. G.Mitchell W.MayburyandR.Sweet Mesa Language Manual Version 5.0 XeroxPARCReport CSL\u201079\u20103 April1979."},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"D. I.Good R. M.CohenandJ.Keeton\u2010Williams \u2018Principles of proving concurrent programs in Gypsy\u2019 Proc. Sixth ACM Synp. on Principles of Programming Languages San Antonio Texas. January1979. pp.42\u201352.","DOI":"10.1145\/567752.567757"},{"key":"e_1_2_1_15_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_16_2","unstructured":"J.Opartney. \u2018Parallel programming constructs for divide\u2010and\u2010conquer computers\u2019 Proceedings of Session 84 of Canadian Information Processing Society 1984."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/366622.366644"},{"key":"e_1_2_1_18_2","volume-title":"Concurrent Euclid, the UNIX System, and Tunis","author":"Holt R. C.","year":"1983"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/954666.971189"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/800022.808307"},{"key":"e_1_2_1_21_2","unstructured":"\u2018Ada reference manual for the Ada programming language\u2019 ANSI\/Mil\u2010STD 1815 A 1983."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380070102"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96717-7"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380170204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380170204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T10:11:51Z","timestamp":1697969511000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380170204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["10.1002\/spe.4380170204"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380170204","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}