Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Pages 55 - 66
References
[1]
B. Awerbuch, S. Kutten, and D. Peleg. Efficient deadlockfree routing. In Proc. A CM Symposium on Principles of Distributed Computing, pages 177-188, 1991.
[2]
P. E. Berman, L. Gravano, G. D. Pifarr6, and J. L. C. Sanz. Adaptive deadlock- and livelock-free routing with all minimal paths in toms networks. In Proc. A CM Symposium on Parallel Algorithms and Architectures, pages 3-12, 1992.
[3]
N.J. Boden, D. Cohen, R. E. Felderman, A. E. Kulawik, C. E. Seitz, J. N. Seizovic, and W.-K. Su. Myrinet: A gigabit per second local area network. IEEE-Micro, 15(1):29-36, February 1995.
[4]
A. A. Chien and J. H. Kim. Planar-adaptive routing: Lowcost adaptive networks for multiprocessors. In Proc. 19th intl. Symposium on Computer Architecture, pages 268-277, 1992.
[5]
S. A. Cook. The complexity of theorem-proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing, pages 151-158, 1971.
[6]
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, pages 558-565. McGraw-Hill, 1990.
[7]
R. Cypher. Minimal, deadlock-free routing in hypercubic and arbitrary networks. In Proc. 7th IEEE Symposium on Parallel and Distributed Processing, 1995.
[8]
R. Cypher. Minimal, deadlock-free routing in hypercubic and arbitrary networks, 1995.
[9]
R. Cypher and L. Gravano. Adaptive, deadlock-free packet routing in toms networks with minimal storage. In Proc. Intl. Conf. on Parallel Processing, pages 204-2 l l (vol. III), 1992.
[10]
R. Cypher and L. Gravano. Requirements for deadlockfree, adaptive packet routing. SIAM journal on Computing, 23(6): 1266-1274, December 1994.
[11]
R. Cypher and L. Gravano. Storage-efficient, deadlock-free packet routing algorithms for toms networks. IEEE Transactions on Computers, 43(12):1376-1385, December 1994.
[12]
R. Cypher and J. Sanz. Optimal sorting on feasible parallel computers. RJ 5934 Computer Science, IBM Almaden Research Center, November 1987. Also in Proceedings of AWOC, Greece, 1988, published by Springer Verlag.
[13]
W. J. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, 36:547-553, May 1987.
[14]
J. Duato. Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm. In Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, pages 840-847, 1991.
[15]
S. A. Felperin, H. Laffitte, G. Buranits, and J. L. Sanz. Deadlock-free minimal packet routing in the toms network. Technical Report TR:91-22, IBM Argentina, CRAAG, 1991.
[16]
R. W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 5(6):345, 1962.
[17]
D.E. Foulser, M. Li, and Q. Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57:143-181, 1992.
[18]
C. B. Fraser and R. W. irving. Approximation algorithms for the shortest common supersequence. Nordic Journal of Computing, 2:303-325, 1995.
[19]
M.R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
[20]
B. Gavish, P. Merlin, and P. Schweitzer. Minimal buffer requirements for avoiding store-and-forward deadlock. Technical Report RC 6672, IBM T.J. Watson Research Center, August 1977.
[21]
C.J. Glass and L. M. Ni. Partially adaptive wormhole routing based on turn model. Technical Report MSU-CPS-ACS-44, Dept. of Computer Science, Michigan State U., 1991.
[22]
C. J. Glass and L. M. Ni. The turn model for adaptive routing. In Proc. 19th Intl. Symposium on Computer Architecture, pages 278-287, 1992.
[23]
I. S. Gopal. Prevention of store-and-forward deadlock in computer networks. IEEE Transactions on Communications, 33(t 2): 1258-1264, December 1985.
[24]
K. Gtinther. Prevention of deadlocks in packet-switched data transport systems. IEEE Transactions on Communications, 29(4), April 1981.
[25]
P. A. Hilbers and J. J. Lukkien. Deadlock-free message routing in multicomputer networks. Distributed Computing, 3:178-186, 1989.
[26]
C. Jesshope, P. Miller, and J. Yantchev. High performance communications in processor networks. In Proc. 16th Intl. Symposium on Computer Architecture, pages 150-157, 1989.
[27]
T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing, 24(5): 1122-1139, October 1995.
[28]
D. E. Knuth. The Stanford GraphBase. Addison-Wesley, 1993.
[29]
S. Konstantinidou. Adaptive, minimal routing in hypercubes. In Proc. 6th. MIT Conference on Advanced Research in VLSI, pages 139-153, 1990.
[30]
S. Konstantinidou and L. Snyder. The Chaos router: A practical application of randomization in network routing. In Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 21-30, 1990.
[31]
T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults on multibutterflies. In IEEE, editor, 30th Annual Symposium on Foundations of Computer Science, pages 384-389, October 1989.
[32]
D. Maier. The complexity of some problems on subsequences and supersequences. Journal of the ACM, 25(2):322-336, April 1978.
[33]
Y. Mansour and B. Patt-Shamir. Greedy packet scheduling on shortest paths. In Proc. A CM Symposium on Principles of Distributed Computing, pages 165-175, 1991.
[34]
P. Merlin and P. Schweitzer. Deadlock avoidance in storeand-forward networks. 1: Store-and-forward deadlock. IEEE Transactions on Communications, 28(3):345-354, March 1980.
[35]
P. Merlin and P. Schweitzer. Minimal buffer requirements for avoiding store-and-forward deadlock. IEEE Transactions on Communications, COM-28(3), March 1980.
[36]
Y. Ofek and M. Yung. Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link. In Proc. A CM Symposium on Principles of Distributed Computing, pages 161-175, 1990.
[37]
G. D. Pifarr6, L. Gravano, S. A. Felperin, and J. L. Sanz. Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks. In Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 278- 290, 1991.
[38]
K.-J. R#iiha and E. Ukkonen. The shortest common supersequence problem over binary alphabet is np-complete. Theoretical Computer Science, 16:187-198, 1981.
[39]
M.D. Schroeder, A. D. Birell, M. Burrows, H. Murray, R. M. Needham, T. L. Rodeheffer, E. H. Satterthwaite, and C. P. Thacker. Autonet: A high-speed, self-configuring local area network using point-to-point links. IEEE Journal on Selected Areas in Communications, 9(8):1318-1335, October 1991.
[40]
V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25:565-580, 1990.
[41]
S. Toueg and K. Steiglitz. Some complexity results in the design of deadlock-free packet switching networks. SlAM Journal on Computing, 10(4):702-712, November 1981.
[42]
S. Toueg and J. D. Ullman. Deadlock-free packet switching networks. SIAM Journal on Computing, 10(3):594-611, August 1981.
[43]
E. Upfal. An O(log N) deterministic packet routing scheme. Journal of the ACM, pages 55-70, 1992.
[44]
J. Yantchev and C. Jesshope. Adaptive, low latency, deadlockfree packet routing for networks of processors. IEE Proc., Pt. E, 136(3):178-186, May 1989.
Index Terms
- Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Recommendations
Minimal, deadlock-free routing in hypercubic and arbitrary networks
SPDP '95: Proceedings of the 7th IEEE Symposium on Parallel and Distributeed ProcessingIn this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular we examine the possibility of creating scalable algorithms that ...
Shortest-Path Routing in Arbitrary Networks
We introduce an on-line protocol which routes any set ofNpackets along shortest paths with congestionCand dilationDthrough an arbitrary network inO(C+D+logN) steps, with high probability. This time bound is optimal up to the additive logN, and it has ...
Comments
Information & Contributors
Information
Published In
Copyright © 1998 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1998
Check for updates
Qualifiers
- Article
Conference
SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing
June 28 - July 2, 1998
Puerto Vallarta, Mexico
Acceptance Rates
SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 403Total Downloads
- Downloads (Last 12 months)19
- Downloads (Last 6 weeks)1
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in