{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:06:03Z","timestamp":1757541963692},"reference-count":9,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":8430,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1983,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Matrix multiplication is used as an example to illustrate a method of transforming the specification of a problem into an algorithm suitable for execution on synchronous machines. The transformations are influenced both by the architectures of the target machines and their available high level languages. Three different synchronous machines, a conceptual MCC (mesh connected computer), the Cray\u20101 and the ICL DAP are considered as target hardware.<\/jats:p>","DOI":"10.1002\/spe.4380131007","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T02:46:41Z","timestamp":1163818001000},"page":"961-974","source":"Crossref","is-referenced-by-count":3,"title":["The influence of hardware and software considerations on the design of synchronous parallel algorithms"],"prefix":"10.1002","volume":"13","author":[{"given":"M.","family":"Clint","sequence":"first","affiliation":[]},{"given":"R.","family":"Perrott","sequence":"additional","affiliation":[]},{"given":"C.","family":"Holt","sequence":"additional","affiliation":[]},{"given":"A.","family":"Stewart","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Cray Research Inc. FORTRAN (CFT) Reference Manual (SR\u20100009) 1981."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/357073.357075"},{"key":"e_1_2_1_4_2","unstructured":"ICL DAP: FORTRAN Language (3rd edition) 1981."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264291"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210049"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(82)90130-8"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/359327.359336"},{"key":"e_1_2_1_9_2","volume-title":"Algorithmic Languages","author":"Bossarit A.","year":"1981"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/322169.322172"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380131007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380131007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T01:19:41Z","timestamp":1697764781000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380131007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":9,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["10.1002\/spe.4380131007"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380131007","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}