{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:20:14Z","timestamp":1648689614371},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0141-9331(95)01077-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:59:15Z","timestamp":1027601955000},"page":"97-103","source":"Crossref","is-referenced-by-count":0,"title":["A deadlock prevention strategy for adaptive routing systems"],"prefix":"10.1016","volume":"20","author":[{"given":"Antonio","family":"Corradi","sequence":"first","affiliation":[]},{"given":"Cesare","family":"Stefanelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(95)01077-7_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/2.211888","article-title":"Adaptive routing protocols for hypercube interconnection networks","volume":"26","author":"Gaughan","year":"1993","journal-title":"IEEE Comput."},{"key":"10.1016\/0141-9331(95)01077-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/12.338098","article-title":"The chaos router","volume":"43","author":"Konstantinidou","year":"1994","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0141-9331(95)01077-7_BIB3","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4330040204","article-title":"Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers","volume":"4","author":"Cannataro","year":"1992","journal-title":"Concurr: Pract. Exper."},{"key":"10.1016\/0141-9331(95)01077-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0141-9331(95)01077-7_BIB5","article-title":"Routing Techniques for Massively Parallel Communication","volume":"79","author":"Felperin","year":"1991"},{"key":"10.1016\/0141-9331(95)01077-7_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1981.1675690","article-title":"A DAG-based algorithm for prevention of storeand-forward deadlock in packet networks","volume":"30","author":"Gelernter","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0141-9331(95)01077-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094666","article-title":"Deadlock avoidance in store-andforward networks I: Store-and-forward deadlock","volume":"28","author":"Merlin","year":"1980","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0141-9331(95)01077-7_BIB8","series-title":"Proc. OUG-Parallel Programming of Transputer Based Machines","article-title":"Routing messages through networks: An exercise in deadlock avoidance","author":"Roscoe","year":"1989"},{"key":"10.1016\/0141-9331(95)01077-7_BIB9","series-title":"Proc. WOTUG14, Occam and the Transputer","article-title":"A scalable communication network for a parallel database machine","author":"Walter","year":"1989"},{"key":"10.1016\/0141-9331(95)01077-7_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/88.384585","article-title":"Adaptive routing for dynamic applications in massively parallel architectures","volume":"3","author":"Boari","year":"1995","journal-title":"IEEE Parall. Distrib. Technol."},{"key":"10.1016\/0141-9331(95)01077-7_BIB11","series-title":"Proc. IEEE Int. Conf. on Computer Languages","article-title":"Parallelism in object-oriented programming languages","author":"Corradi","year":"1990"},{"key":"10.1016\/0141-9331(95)01077-7_BIB12","series-title":"Computer Networks","author":"Tanenbaum","year":"1988"},{"key":"10.1016\/0141-9331(95)01077-7_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1987.1096719","article-title":"Input versus output queueing on a space-division packet switch","volume":"35","author":"Karol","year":"1987","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0141-9331(95)01077-7_BIB14","series-title":"Proc. OUG-10, Applying Transputer Based Parallel Machines","article-title":"TRANSNET 3$\u0304A transputer-based communication service","author":"Welch","year":"1989"},{"key":"10.1016\/0141-9331(95)01077-7_BIB15","article-title":"Time-stamp approach to store-and-forward deadlock prevention","volume":"35","author":"Blazewicz","year":"1987","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0141-9331(95)01077-7_BIB16","year":"1989"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933195010777?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933195010777?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T01:58:35Z","timestamp":1556589515000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0141933195010777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0141933195010777"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(95)01077-7","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}