Parallel Algorithms for Network Routing Problems and Recurrences
Pages 379 - 394
Abstract
In this paper, we consider the parallel solution of recurrences, and linear systems in the regular algebra of Carré. These problems are equivalent to solving the shortest path problem in graph theory, and they also arise in the analysis of Fortran programs. Our methods for solving linear systems in the regular algebra are analogues of well-known methods for solving systems of linear algebraic equations. A parallel version of Dijkstra’s method, which has no linear algebraic analogue, is presented. Considerations for choosing an algorithm when the problem is large and sparse are also discussed.
References
[1]
Richard Bellman, On a routing problem, Quart. Appl. Math., 16 (1958), 87–90
[2]
B. A. Carré, An algebra for network routing problems, J. Inst. Math. Appl., 7 (1971), 273–294
[3]
B. A. Carré, J. K. Reid, An elimination method for minima-cost network flow problems, Large Sparse Sets of Linear Equations, Academic Press, London, 1971, Proc. I.M.A. Conference, Oxford, 1970
[4]
Y. K. Chen, T. Feng, A parallel algorithm for the maximum flow problem, Proc. 1973 Sagmore Conf. on Parallel Processing, 1973, 60–, (summary)
[5]
R. Cruon, P. Hervé, Quelques résultats relatifs à une structure algébrique et son application au problème central de l'ordonnancement, Revue fr. Rech. opér., 34 (1965), 3–19
[6]
E. Dekel, S. Sahni, Parallel matrix and graph algorithms, Tech. Rep., 79-10, Dept. Computer Science, University of Minnesota, 1979, June
[7]
E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1 (1977), 269–271
[8]
S. E. Dreyfus, An appraisal of some shortest-path algorithms, Operations Res., 17 (1969), 395–412
[9]
L. R. Ford, Jr., Network flow theory, P-928, The Rand Corporation, Santa Monica, CA, 1956, August
[10]
L. R. Ford, Jr., D. R. Fulkerson, Flows in networks, Princeton University Press, Princeton, N.J., 1962xii+194
[11]
D. Heller, On the efficient computation of recurrence relations, Dept. Computer Science, Carnegie-Mellon University Pittsburgh, PA, ICASE, Hampton, VA, 1974
[12]
T. C. Hu, Revised matrix algorithms for shortest paths, SIAM J. Appl. Math., 15 (1967), 207–218
[13]
B. L. Hulme, MINDPT: a code for minimizing detection probability up to a given time away from a sabatoge target, Rep., SAND 77-2039, Sandia Laboratories, Albuquerque, NM, 1977, Dec.
[14]
B. L. Hulme, J. A. Wisniewski, A comparison of shortest path algorithms applied to sparse graphs, Rep., SAND78-1411, Sandia Laboratories, Albuquerque, NM, 1978, August
[15]
L. Hyafil, H. T. Kung, Parallel algorithms for solving triangular linear systems with small parallelism, Dept. of Computer Science, Carnegie–Mellon University, Pittsburgh, PA, 1974
[16]
R. Kalaba, Proc.10th Symposium on Applied Mathematics, American Mathematical Society, Providence, RI, 1958
[17]
D. J. Kuck, personal communication
[18]
D. J. Kuck, A. H. Sameh, The Structure of Computers and Computation, Vol. II, John Wiley, New York, in preparation
[19]
K. N. Levitt, W. H. Kautz, Cellular arrays for the solution of graph problems, Comm. ACM, 15 (1972), 789–801
[20]
G. C. Moisil, Asupra unor reprezentari ale grafurilor ce intervin in probleme de economia transporturilor, Communicrile Acad. Republicii Populare Romı⁁ne, 10 (1960), 647–652
[21]
Edward F. Moore, The shortest path through a mazeProc. Internat. Sympos. Switching Theory 1957, Part II, Harvard Univ. Press, Cambridge, Mass., 1959, 285–292, Annals of the Computation Laboratory of Harvard University
[22]
Ahmed H. Sameh, Richard P. Brent, Solving triangular systems on a parallel computer, SIAM J. Numer. Anal., 14 (1977), 1101–1113
[23]
G. B. Varnado, Reactor safeguards system assessment and design, Volume I, Rep., SAND77-0644, Sandia Laboratories, Albuquerque, NM, 1978, June
Index Terms
- Parallel Algorithms for Network Routing Problems and Recurrences
Index terms have been assigned to the content through auto-classification.
Recommendations
Low complexity algorithms for linear recurrences
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationWe consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over ...
Comments
Information & Contributors
Information
Published In
Copyright © 1982 Society for Industrial and Applied Mathematics.
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 September 1982
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
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