|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| I. Cidon, "An Efficient Distributed Knot Detection Algorithm," IEEE Transactions on Software Engineering, vol. 15, no. 5, pp. 644-649, May, 1989. | |||
| BibTex | x | ||
| @article{ 10.1109/32.24714, author = {I. Cidon}, title = {An Efficient Distributed Knot Detection Algorithm}, journal ={IEEE Transactions on Software Engineering}, volume = {15}, number = {5}, issn = {0098-5589}, year = {1989}, pages = {644-649}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.24714}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - An Efficient Distributed Knot Detection Algorithm IS - 5 SN - 0098-5589 SP644 EP649 EPD - 644-649 A1 - I. Cidon, PY - 1989 KW - memory bits; store communication networks; distributed knot detection algorithm; general graphs; messages; nodes; links; cycle detection; clustering; deadlock detection; forward communication networks; transaction systems; computational complexity; distributed processing; graph theory VL - 15 JA - IEEE Transactions on Software Engineering ER - | |||
A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is the number of links). This is compared to O(n/sup 2/) messages needed in the best algorithm previously published. The knot detection algorithm makes use of efficient cycle detection and clustering techniques. Various applications for the knot detection algorithms are presented. In particular, its importance to deadlock detection in store and forward communication networks and in transaction systems is demonstrated.
[1] K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512-524, Apr. 1981.
[2] G. Gambosi, D. P. Bovet, and D. A. Menascoe, "A detection and removal of deadlocks in store and forward communication networks," inPerformance of Computer-Communication Systems, H. Rudin and W. Bux, Ed. Amsterdam: Elsevier Science B.V. (North-Holland), 1984, pp. 219-229.
[3] I. Cidon, J. M. Jaffe, and M. Sidi, "Local distributed deadlock detection by cycle detection and clustering,"IEEE Trans. Software Eng., vol. SE-13, no. 1, pp. 3-14, Jan. 1987.
[4] I. Cidon, J. M. Jaffe, and M. Sidi, "Local distributed deadlock detection with finite buffers," inProc. IEEE INFOCOM'86, Miami, FL, Apr. 1986, pp. 478-486.
[5] J. Misra and K.M. Chandy, "A distributed graph algorithm: Knot detection,"ACM Trans. Programming Languages Syst., vol. 4, no. 4, pp. 678-688, Oct. 1982.
[6] G. Bracha and S. Toueg, "Distributed algorithm for generalized deadlock detection," inProc. Third ACM Symp. Principles Distributed Comput., Aug. 1984.
[7] R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum weight spanning trees,"ACM Trans. Programming Languages and Syst., vol. 5, no. 1, pp. 66-67, Jan. 1983.
[8] P. A. Humblet, "A distributed algorithm for minimum weight direct spanning trees,"IEEE Trans. Comput., vol. C-31, no. 6, pp. 756-762, June 1983.
[9] E. Gafni and Y. Afek, "Election and traversal in unidirectional networks," Dep. Comput. Sci., UCLA.
[10] I. Cidon, "An efficient distributed knot detection algorithm," IBM Res. Rep. RC 12099, Aug. 1986.