?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Proof+of+the+deadlock-freeness+of+ALD+routing+algorithm&rft.creator=Wang%2C+Hong&rft.creator=Xu%2C+Du&rft.creator=Jiang%2C+Guo&rft.creator=Yao%2C+Yao&rft.creator=Xu%2C+Shizhong&rft.creator=Li%2C+Lemin&rft.subject=Dynamical+Systems&rft.description=This+is+the+appendix+to+the+paper+Load-Balanced+Adaptive+Routing+for+Torus+Networks+to+provide+a+detailed%2C+formal+proof+of+the+deadlock-freeness+of+the+routing+algorithm+proposed+in+the+paper.+The+paper+is+submitted+to+Electronics+Letters%2C+and+the+abstract+of+which+is+as+follows%3A%0A+%0AA+new+routing+algorithm+for+torus+interconnection+networks+to+achieve+high+throughput+on+various+traffic+patterns%2C+Adaptive+Load-balanced+routing+with+cycle+Detection+(ALD)%2C+is+presented.+Instead+of+the++-channels+scheme+adopted+in+a+few+recently+proposed+algorithms+of+the+same+category%2C+a+cycle+detection+scheme+is+employed+in+ALD+to+handle+deadlock%2C+which+leads+to+higher+routing+adaptability.+Simulation+results+demonstrate+that+ALD+achieves+higher+throughput+than+the+recently+proposed+algorithms+on+both+benign+and+adversarial+traffic+patterns.+&rft.date=2006-01&rft.type=Preprint&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F4701%2F1%2FDeadlock.pdf&rft.identifier=++Wang%2C+Hong+and+Xu%2C+Du+and+Jiang%2C+Guo+and+Yao%2C+Yao+and+Xu%2C+Shizhong+and+Li%2C+Lemin++(2006)+Proof+of+the+deadlock-freeness+of+ALD+routing+algorithm.++%5BPreprint%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F4701%2F