{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T22:10:09Z","timestamp":1682547009941},"reference-count":18,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0165-6074(90)90321-y","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"703-712","source":"Crossref","is-referenced-by-count":4,"title":["A deadlock-free communication kernel for loop connected message passing computer architecture"],"prefix":"10.1016","volume":"30","author":[{"given":"P.","family":"Pramanik","sequence":"first","affiliation":[]},{"given":"P.K.","family":"Das","sequence":"additional","affiliation":[]},{"given":"A.K.","family":"Bandyopadhyay","sequence":"additional","affiliation":[]},{"given":"D.Q.M.","family":"Fay","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(90)90321-Y_BIB1","series-title":"A Basis for Theoretical Computer Science","author":"Arbib","year":"1981"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.73","article-title":"Multicomputers: Message Passing Concurrent Computers","author":"Athas","year":"1988","journal-title":"IEEE Computer"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB3","series-title":"22nd Annual Simulation Symposium","article-title":"Simulation and Design of Message Routing Systems for Network of Transputers","author":"Bagchi","year":"1989"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB4","doi-asserted-by":"crossref","unstructured":"Bornat, R., \u201cA protocol for generalized Occam\u201d, Software practice and experience, 16(9), pp. 783\u2013799.","DOI":"10.1002\/j.1097-024X.1986.tb00010.x"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB5","doi-asserted-by":"crossref","unstructured":"Buckley, G.N. and Silberschatz A., \u201cAn effective implementation of the generalized input-output construct of C S P\u201d, ACM TOPLAS, 5(2), pp. 223\u2013235.","DOI":"10.1145\/69624.357208"},{"issue":"No. 5","key":"10.1016\/0165-6074(90)90321-Y_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"Vol. C-36","author":"Dally","year":"1987","journal-title":"IEEE Trans. on Comp."},{"key":"10.1016\/0165-6074(90)90321-Y_BIB7","series-title":"Proc. Euromicro '88 conference","first-page":"281","article-title":"Performance studies of multitransputer architectures with static and dynamic links","author":"Das","year":"1988"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB8","series-title":"Scientific Application of Multiprocessors","article-title":"Reconfigurable Transputer Networks: Practical Concurrent Computation","author":"Hey","year":"1989"},{"issue":"8","key":"10.1016\/0165-6074(90)90321-Y_BIB9","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating Sequential Processes","volume":"Vol. 21","author":"Hoare","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB10","author":"Inmos Limited","year":"1988"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB11","author":"Inmos Limited","year":"1988"},{"issue":"no. 7","key":"10.1016\/0165-6074(90)90321-Y_BIB12","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, Clocks and the ordering of events in a distributed system","volume":"vol. 21","author":"Lamport","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB13","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB14","series-title":"Distributed Algorithms and Protocols","author":"Raynal","year":"1988"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB15","series-title":"Petri Nets, An Introduction","author":"Reisig","year":"1982"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB16","series-title":"Parallel Programming of Transputer Based Machines","first-page":"57","article-title":"Routing messages through networks: an exercise in deadlock avoidance","author":"Roscoe","year":"1988"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB17","article-title":"Distributed synchronisation of communicating sequential processes","author":"Schwartz","year":"1978"},{"key":"10.1016\/0165-6074(90)90321-Y_BIB18","article-title":"Message-Passing Concurrent Computes, Their Architecture and Programming","author":"Seitz","year":"1986"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090321Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090321Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T21:30:34Z","timestamp":1682544634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749090321Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":18,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["016560749090321Y"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(90)90321-y","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}